Study and improvement of ordinal decision trees based on rank entropy

Jiankai CHEN, Junhai ZHAI*, Xizhao WANG

*Corresponding author for this work

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

2 Citations (Scopus)

Abstract

Decision tree is one of the most commonly used methods of machine learning, and ordinal decision tree is an important way to deal with ordinal classification problems. Through researches and analyses on ordinal decision trees based on rank entropy, the rank mutual information for every cut of each continuous- valued attribute is necessary to determine during the selection of expanded attributes for constructing decision trees based on rank entropy in ordinal classification. Then we need to compare these values of rank mutual information to get the maximum which corresponds to the expanded attribute. As the computational complexity is high, an improved algorithm which establishes a mathematical model is proposed. The improved algorithm is theoretically proved that it only traverses the unstable cut-points without computing the values of stable cut-points. Therefore, the computational efficiency of constructing decision trees is greatly improved. Experiments also confirm that the computational time of the improved algorithm can be reduced greatly.

Original languageEnglish
Title of host publicationMachine Learning and Cybernetics : 13th International Conference, Proceedings
EditorsXizhao WANG, Qiang HE, Patrick P.K. CHAN, Witold PEDRYCZ
PublisherSpringer Berlin
Pages207-218
Number of pages12
ISBN (Electronic)9783662456521
ISBN (Print)9783662456514
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event13th International Conference on Machine Learning and Cybernetics, ICMLC 2014 - Lanzhou, China
Duration: 13 Jul 201416 Jul 2014

Publication series

NameCommunications in Computer and Information Science
Volume481
ISSN (Print)1865-0929

Conference

Conference13th International Conference on Machine Learning and Cybernetics, ICMLC 2014
Country/TerritoryChina
CityLanzhou
Period13/07/1416/07/14

Bibliographical note

This research is supported by the National Natural Science Foundation of China (61170040), by the Natural Science Foundation of Hebei Province (F2012201023, F2013201110 and F2013201220), by the Key Scientific Research Foundation of Education Department of Hebei Province (ZD2010139), by the natural science foundation of Hebei University (2011-228) , by the research projects on reform of education and teaching of Hebei University (JX07-Y-27), and by Soft science research project of Hebei Province (12457662).

Keywords

  • Ordinal decision tree
  • Rank entropy
  • Unstable cut-point

Fingerprint

Dive into the research topics of 'Study and improvement of ordinal decision trees based on rank entropy'. Together they form a unique fingerprint.

Cite this