Decision trees using class hierarchy

Authors:
Tomoya Takamitsu;Takao Miura;Isamu Shioya
Affiliations:
Dept. of Elect. & Elect. Engr., HOSEI University, 3-7-2 KajinoCho, Koganei, Tokyo, 184-8584 Japan;Dept. of Elect. & Elect. Engr., HOSEI University, 3-7-2 KajinoCho, Koganei, Tokyo, 184-8584 Japan;Dept. of Management and Informatics, SANNO University, 1573 Kamikasuya, Isehara, Kanagawa 259-1197 Japan
Venue:
Design and application of hybrid intelligent systems
Year:
2003

Citing 8
Cited 0

C4.5: programs for machine learning

C4.5: programs for machine learning
Overfitting and undercomputing in machine learning

ACM Computing Surveys (CSUR)
Advances in knowledge discovery and data mining

Advances in knowledge discovery and data mining
Data mining: concepts and techniques

Data mining: concepts and techniques
Knowledge Discovery in Databases

Knowledge Discovery in Databases
Induction of Decision Trees

Machine Learning
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Knowledge pruning in decision trees

ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we propose Disjunctive Decision Trees to obtain simple, reliable and interesting decision trees. To do that we introduce domain knowledge in a form of class hierarchy and we relax class membership. Eventually we lose small amount of entropy. This is why we define path entropy to evaluate interests of decision trees. We discuss some experimental results and show how useful these trees are.