Pruning Decision Trees using Rules3 Inductive Learning Algorithm
作者： Mehmet Aksoy
DOI: 10.3390/MCA10010113
关键词:
摘要: One important disadvantage of decision tree based inductive learning algorithms is that they use some irrelevant values to establish the tree. This causes final rule set be less general. To overcome with this problem has pruned. In article using recently developed RULES algorithm, pruning a explained. The extracted for an example ID3 algorithm and then pruned RULES. results obtained before after are compared. shows more
mdpi.com
core.ac.uk 
sci-hub.se 参考文章(14)
Jeffrey C. Schlimmer, Douglas Fisher, A case study of incremental concept induction national conference on artificial intelligence. pp. 496- 501 ,(1986)
Guido Cervone, Liviu Panait, Ryszard Michalski, The Development of the AQ20 Learning System and Initial Experiments Advances in Intelligent and Soft Computing. pp. 13- 29 ,(2001) , 10.1007/978-3-7908-1813-0_2
Stuart C. Shapiro, Encyclopedia of Artificial Intelligence ,(1992)
Sholom M. Weiss, Computer systems that learn ,(1990)
Philip K. Chan, Inductive learning with BCT international conference on machine learning. pp. 104- 108 ,(1989) , 10.1016/B978-1-55860-036-2.50035-7
K. A. Horn, P. J. Compton, L. Lazarus, J. R. Quinlan, Inductive knowledge acquisition: a case study Proceedings of the Second Australian Conference on Applications of expert systems. pp. 137- 156 ,(1987)
PAUL E. UTGOFF, ID: An Incremental ID3 international conference on machine learning. pp. 107- 120 ,(1987) , 10.1016/B978-0-934613-64-4.50017-7
Donald Arthur Waterman, A Guide to Expert Systems ,(1985)
Peter Clark, Robin Boswell, Rule induction with CN2: Some recent improvements Lecture Notes in Computer Science. pp. 151- 163 ,(1991) , 10.1007/BFB0017011
J.R. Quinlan, Learning Logical Definitions from Relations Machine Learning. ,vol. 5, pp. 239- 266 ,(1990) , 10.1023/A:1022699322624