A scalable decision tree system and its application in pattern recognition and intrusion detection
Decision Support Systems
Classifier Ensembles with a Random Linear Oracle
IEEE Transactions on Knowledge and Data Engineering
MulO-AntMiner: a new ant colony algorithm for the multi-objective classification problem
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part II
Model trees for classification of hybrid data types
IDEAL'05 Proceedings of the 6th international conference on Intelligent Data Engineering and Automated Learning
Multivariate decision trees using different splitting attribute subsets for large datasets
AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
Texture based decision tree classification for Arecanut
Proceedings of the CUBE International Information Technology Conference
Hi-index | 0.00 |
A new decision tree method for application in data mining, machine learning, pattern recognition, and other areas is proposed in this paper. The new method incorporates a classical multivariate statistical method, linear discriminant function, into decision trees' recursive partitioning process. The proposed method considers not only the linear combination with all variables, but also combinations with fewer variables. It uses a tabu search technique to find appropriate variable combinations within a reasonable length of time. For problems with more than two classes, the tabu search technique is also used to group the data into two superclasses before each split. The results of our experimental study indicate that the proposed algorithm appears to outperform some of the major classification algorithms in terms of classification accuracy, the proposed algorithm generates decision trees with relatively small sizes, and the proposed algorithm runs faster than most multivariate decision trees and its computing time increases linearly with data size, indicating that the algorithm is scalable to large datasets.