Simplify multi-valued decision trees

Chien-Liang Liu*, Chia-Hoang Lee

*此作品的通信作者

研究成果: Conference contribution同行評審

摘要

Decision tree is one of the popular data mining algorithms and it has been applied on many classification application areas. In many applications, the number of attribute values may be over hundreds and that will be difficult to analyze the result. The purpose of this paper will focus on the construction of categorical decision trees. A binary splitting decision tree algorithm is proposed to simplify the classification outcomes. It adopts the complement operation to simplify the split of interior nodes and it is suitable to apply on the decision trees where the number of outcomes is numerous. In addition, meta-attribute could be applied on some applications where the number of outcomes is numerous and the meta-attribute is meaningful. The benefit of meta-attribute representation is that it could transfer the original attributes into higher level concepts and that could reduce the number of outcomes.

原文English
主出版物標題Advances in Computation and Intelligence - Third International Symposium, ISICA 2008, Proceedings
頁面581-590
頁數10
DOIs
出版狀態Published - 19 12月 2008
事件3rd International Symposium on Intelligence Computation and Applications, ISICA 2008 - Wuhan, China
持續時間: 19 12月 200821 12月 2008

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5370 LNCS
ISSN(列印)0302-9743
ISSN(電子)1611-3349

Conference

Conference3rd International Symposium on Intelligence Computation and Applications, ISICA 2008
國家/地區China
城市Wuhan
期間19/12/0821/12/08

指紋

深入研究「Simplify multi-valued decision trees」主題。共同形成了獨特的指紋。

引用此