Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2018 | https://doi.org/10.1007/s10489-017-1008-y | Appl. Intell. |
Keywords | Field | DocType |
Attribute selection,Filter,Decision tree,High dimensional data,Data pre-processing | Data mining,Decision tree,Feature selection,Computer science,Data pre-processing,Artificial intelligence,ID3 algorithm,Clustering high-dimensional data,Pattern recognition,Algorithm,Information gain ratio,Data compression,Machine learning,Incremental decision tree | Journal |
Volume | Issue | ISSN |
48 | 4 | 0924-669X |
Citations | PageRank | References |
3 | 0.38 | 14 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
José Augusto Baranauskas | 1 | 88 | 4.70 |
Oscar Picchi Netto | 2 | 3 | 0.38 |
Sérgio Ricardo Nozawa | 3 | 6 | 1.13 |
Alessandra Alaniz Macedo | 4 | 15 | 6.46 |