Query-Based Learning Decision Tree and its Applications in Data Mining

DOI

10.2991/jcis.2006.49How to use a DOI?

Keywords

Query-Based Learning, Decision Tree, Data Mining

Abstract

Decision tree is one of the most significant classification methods applied in data mining. By its graphic output, users could have an easy way to interpret the decision flow and the mining outcome. However, decision tree is known to be time consuming. It will spend a high computation cost when mining the large scale dataset in the real world. This drawback causes decision tree to be ineligible in processing the time critical applications. In these years, we have introduced the query-based learning (QBL) method to different neural networks for providing a more effective way to learn the large dataset. These neural networks have achieved good clustering and classification results. In this paper, a novel mining scheme called QBLDT (query-based learning decision tree) is proposed to apply the QBL concept in decision tree construction. Experimental results show our proposed method is better than the traditional decision tree in different performance metrics. It makes learning quicker and can achieve better prediction results.

Copyright

© 2006, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Rayi Chang
AU  - Chia-Yen Lo
AU  - Wen-De Su
AU  - Jen-Chieh Wang
PY  - 2006/10
DA  - 2006/10
TI  - Query-Based Learning Decision Tree and its Applications in Data Mining
BT  - Proceedings of the 9th Joint International Conference on Information Sciences (JCIS-06)
PB  - Atlantis Press
SP  - 203
EP  - 206
SN  - 1951-6851
UR  - https://doi.org/10.2991/jcis.2006.49
DO  - 10.2991/jcis.2006.49
ID  - Chang2006/10
ER  -