作者: Ron Kohavi , George H. John
DOI: 10.1007/978-1-4615-5725-8_3
关键词: Selection (relational algebra) 、 Focus (optics) 、 Relevance (information retrieval) 、 Artificial intelligence 、 Machine learning 、 Feature (computer vision) 、 Filter (mathematics) 、 Relation (database) 、 Feature selection 、 Decision tree 、 Computer science
摘要: In the feature subset selection problem, a learning algorithm is faced with problem of selecting relevant features upon which to focus its attention, while ignoring rest. To achieve best possible performance particular on training set, method should consider how and set interact. We explore relation between optimal relevance. The wrapper searches for an tailored domain. compare approach induction without Relief, filter selection. Improvement in accuracy achieved some datasets two families algorithms used: decision trees Naive-Bayes. addition, subsets selected by are significantly smaller than original used algorithms, thus producing more comprehensible models.