A HYBRID ALGORITHM FOR DECISION TREE GENERATION
DOI:
https://doi.org/10.47839/ijc.3.3.305Keywords:
Genetic algorithm, ID3, tree generation, “hill-climbing”, ensembles of classifiersAbstract
The paper discusses the experiments performed with Machine Learning algorithms (ID3, C4.5, Bagged-C4.5, Boosted-C4.5 and Naive Bayes) and an algorithm made on the basis of a combination of genetic algorithms (GA) and ID3. The latter algorithm is implemented as an extension of the MLC++ Library of Stanford University. The behaviour of the algorithm is tested using 24 databases including those with a large number of attributes. It is shown that owing to “hill-climbing” problem solving, the characteristics of the classifier made with the help of the new algorithm became significantly better. The behaviour of the algorithm is examined when constructing pruned classifiers. The ways to improve standard Machine Learning algorithms are suggested.References
J. R. Quinlan. Bagging, Boosting, and C4.5. University of Sydney, Sydney, 1998
T. M. Mitchell. Machine Learning. The McGraw-Hill Comp., New York, 1997
J. R. Quinlan. C4.5: Programs for Machine Learning. San Mateo, Morgan Kaufman, 1993
L. Breiman, J. H. Friedman, R. A. Olshen and C. J. Stone. Classification and Regression Trees, Wadsworth Int. Group, Belmont, CA, USA, 1984
S. M. Weiss. I. Kapouleas. An Empirical Comparison of Pattern Recognition, Neural Nets, and Machine Learning Classification Methods. Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 57-74, 1989
Y. Kornienko and A. Borisov. Production Rules Induction Algorithm Based On The Finish Learning Principle. Fourth International Conference on Application of Fuzzy Systems and Soft Computing, Siegen, Germany, June 27-29, pp. 287-292, 2000
Downloads
Published
How to Cite
Issue
Section
License
International Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:• Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
• Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
• Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.