Constructing binary classification trees with high intelligibility

Ruan Jian Xue Bao/Journal of Software

Volumn 14, Issue 12, 2003, Pages 1996-2005

  Jiang, Yan Huang ^a   Yang, Xue Jun ^a   Zhao, Qiang Li ^b  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^b Dascom Technology Ltd   (China)

Author keywords

Binary classification tree; Information gain; Machine learning; Pruning; Range splitting based on continuous attributes transform (RCAT) algorithm

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; OPTIMIZATION; PROBABILITY; TREES (MATHEMATICS);

BINARY CLASSIFICATION THREES; COMBINATION PRUNING; CONTINUOUS ATTRIBUTES; HIGH INTELLIGIBILITY; INFORMATION GAIN; PESSIMISTIC PRUNING; PROBABILITY ATTRIBUTES; RANGE SPLITTING;

LEARNING SYSTEMS;

EID: 1642618578     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. Domingos P. The role of Occam's razor in knowledge discovery. Data Mining and Knowledge Discovery, 1999, 3(4): 409-425.
2. Zhou Z H, Chen S F. Rule extraction from neural networks. Journal of Computer Research and Development, 2002, 39(4): 398-405 (in Chinese with English abstract)
3. Setiono R, Liu H. Extracting rules from neural networks by pruning and hidden-unit splitting. Neural Computation, 1997, 9(1): 205-225.
4. Boz O. Converting a trained neural network to a decision tree: DECTEXT-decision tree extractor[Ph.D. Thesis]. Pennsylvania: University of Lehigh, 2000.
5. Windeatt T, Ardeshir G. An empirical comparison of pruning methods for ensemble classifiers. In: Hoffmann F, Hand D J, eds. Proceedings of the 4th International Conference on Intelligent Data Analysis. Lisbon: Springer-Verlag, 2001, 208-217.
6. Fournier D, Cremilleux B. A quality index for decision tree pruning. Knowledge-Based System, 2002, 15(1): 37-43.
7. Subramani M, William R S, Malcolm B D, Michael J P. Two-Stage machine learning model for guideline development. Artificial Intelligence in Medicine, 1999, 16(1): 51-72.
8. Auer P, Holte R C, Maass W. Theory and application of agnostic PAC-learning with small decision trees. In: Prieditis A, Russell S, eds. Proceedings of the 12th International Conference on Machine Learning. San Francisco: Morgan Kaufmann Publishers, Inc., 1995, 21-29.
9. Langley P. Induction of condensed determinations. In: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining. Portland: AAAI Press, 1996, 327-330.
10. Quinlan J R. C4.5: Programs for Machine Learning. San Mateo: Morgan Kaufmann Publishers, Inc., 1993.
11. Elomaa T, Rousu J. General and efficient multisplitting of numerical attributes. Machine Learning, 1999, 36(3): 201-244.
12. Dougherty J, Kohavi R, Sahami M. Supervised and unsupervised discretization of continuous feature. In: Prieditis A, Russell S, eds. Proceedings of the 12th International Conference on Machine Learning. San Francisco: Morgan Kaufmann Publishers, Inc., 1995, 194-202.
13. Liu H, Hussain F, Tan C L, Dash M. Discretization: An enabling technique. Data Mining and Knowledge Discovery, 2002, 6(4): 393-423.
14. Quinlan J R. Simplifying decision tree. International Journal of Man-Machine Studies, 1987, 27: 221-234.
15. Bay S D. UCI KDD Archive. 1999. http://kdd.ics.uci.edu.