A tree-based algorithm for attribute selection

This paper presents an improved version of a decision tree-based filter algorithm for attribute selection. This algorithm can be seen as a pre-processing step of induction algorithms of machine learning and data mining tasks. The filter was evaluated based on thirty medical datasets considering its...

Full description

Saved in:
Bibliographic Details
Published inApplied intelligence (Dordrecht, Netherlands) Vol. 48; no. 4; pp. 821 - 833
Main Authors Baranauskas, José Augusto, Netto, Oscar Picchi, Nozawa, Sérgio Ricardo, Macedo, Alessandra Alaniz
Format Journal Article
LanguageEnglish
Published New York Springer US 01.04.2018
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN0924-669X
1573-7497
1573-7497
DOI10.1007/s10489-017-1008-y

Cover

More Information
Summary:This paper presents an improved version of a decision tree-based filter algorithm for attribute selection. This algorithm can be seen as a pre-processing step of induction algorithms of machine learning and data mining tasks. The filter was evaluated based on thirty medical datasets considering its execution time, data compression ability and AUC (Area Under ROC Curve) performance. On average, our filter was faster than Relief-F but slower than both CFS and Gain Ratio. However for low-density (high-dimensional) datasets, our approach selected less than 2% of all attributes at the same time that it did not produce performance degradation during its further evaluation based on five different machine learning algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0924-669X
1573-7497
1573-7497
DOI:10.1007/s10489-017-1008-y