This shows that the pruned decision tree is more general.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:One important disadvantage of decision tree based inductive learning algorithms is that they use some irrelevant values to establish the decision tree.
📊
Temel Bulgular & Veri:The decision tree is extracted for an example problem using the ID3 algorithm and then is pruned using RULES.
💡
Sonuç & Katkı:This shows that the pruned decision tree is more general.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri
Abstract
One important disadvantage of decision tree based inductive learning algorithms is that they use some irrelevant values to establish the decision tree. This causes the final rule set to be less general. To overcome with this problem the tree has to be pruned. In this article using the recently developed RULES inductive learning algorithm, pruning of a decision tree is explained. The decision tree is extracted for an example problem using the ID3 algorithm and then is pruned using RULES. The results obtained before and after pruning are compared. This shows that the pruned decision tree is more general.
🔖
Bu Makaleye Atıf Yap
AKSOY, M. S. (2005). Pruning decision trees using rules 3 inductive learning algorithm. Mathematical and Computational Applications, Cilt: 10 - Sayı: 1, 113–120. https://ajindex.com/articles/280129
M.S. Aksoy, New Algorithms for Machine Learning, Ph.D. thesis, University of Wales, College of Cardiff, U.K., 1994. 2.G. Cervone, L.A. Panait and R.S. Michalski, The Development of the AQ20 Learning System and Initial Experiments, Tenth International Symposium on Intelligent Information Systems, Zakopane, Poland, June, 2001. 3.P.K.Chan, Inductive Learning With BCT, Proc. Sixth Int. Workshop on Machine Learning, Cornell Univ. Ithaca, New York, pp.104-108, 1989. 4.J. Cheng et al., Improved decision trees: a generalised version of ID3, in proc.Fifth Int. Conf. on Machine Learning, The University of Michigan, Ann Arbor, MI,June 12-14, pp.100-106, 1988. 5.P. Clark and R. Boswell, Rule induction with CN2: Some recent improvements, In J. Siekmann, Lecture Notes in Artificial Intelligence, Springer-Verlag, pp. 151- 163,1991. 6.E.B. Hunt, J. Marin and P.J. Stone, Experiments in induction, Academic Press, Newyork, 1966. 7.W.Z. Liu and A.P. White, A Review of Inductive Learning, in I.M.Graham and R.W. Milne, Research and Development in Expert Systems VIII, Proc. of Expert Systems 91, Cambridge Univ. Press, London, pp.112-126,1991. 8.J. Ortego, G. Lee and D. Fisher, Representation and processing issues underlying machine learning from examples, proc. of the Second International Conf. on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, V.II, June 6-9, pp.845-851,1989. 9.D.T. Pham, D.T. and M.S. Aksoy, A new algorithm for inductive learning", Journal of Systems Eng., No.5 pp. 115-122, UK, 1993. 10.J.R. Quinlan, Learning efficient classification procedures and their application to chess end games, in Machine Learning, An Artificial Intelligence Approach edited by R.S. Michalski, J.G. Carbonell and T.M. Mitchell, Tioga, Palo Alto, CA, 1983, pp.463-482, 1983. 11.J.R. Quinlan, Inductive knowledge acquisition: a case study, in Applications of Expert Systems, Ed: J.R. Quinlan, Turing Institute Press, pp.157-173, 1987. 12.J.R. Quinlan, Induction, knowledge and expert systems, in Artificial Intelligence Developments and Applications, Eds J.S. Gero and R. Stanton, Amsterdam, North-Holland, pp.253-271, 1988. 13.J.R. Quinlan J.R., Learning logical definitions from relations, in Machine Learning, 5, Kluwer Publishers, Boston, pp.239-266,1990. 14.J.R. Quinlan, C4.5: Programs for Machine Learning, Morgan Kaufmann Publishers,
San Mateo, California ISBN 1-55860-238-0, 1993. 15.J.C. Schlimmer and D. Fisher, A case study of incremental concept i