ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Conference Paper Performance Measurement of Decision Tree Excluding Insignificant Leaf Nodes
Cited 3 time in scopus Share share facebook twitter linkedin kakaostory
Authors
Hae Sook Jeon, Won Don Lee
Issue Date
2014-10
Citation
International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC) 2014, pp.122-127
Language
English
Type
Conference Paper
DOI
https://dx.doi.org/10.1109/CyberC.2014.29
Abstract
Too much information exist in ubiquitous environment, and therefore it is not easy to obtain the appropriately classified information from the available data set. Decision tree algorithm is useful in the field of data mining or machine learning system, as it is fast and deduces good result on the problem of classification. Sometimes, however, a decision tree may have leaf nodes which consist of only a few or noise data. The decisions made by those weak leaves will not be effective and therefore should be excluded in the decision process. This paper proposes a method using a classifier, UChoo, for solving a classification problem, and suggests an effective method of decision process involving only the important leaves and thereby excluding the noisy leaves. The experiment shows that this method is effective and reduces the erroneous decisions and can be applied when only important decisions should be made.
KSP Keywords
Available data, Classification problems, Data mining(DM), Data sets, Decision Tree(DT), Machine learning system, Performance measurement, Ubiquitous environment, decision process, decision tree algorithm