A review: The effects of imperfect data on incremental decision tree Online publication date: Thu, 04-Jan-2018
by Hang Yang; Peng Li; Xiaobin Guo; Huajun Chen; Zhiqiang Lin
International Journal of Information and Communication Technology (IJICT), Vol. 12, No. 1/2, 2018
Abstract: Decision tree, as one of the most widely used methods in data mining, has been used in many realistic applications. Incremental decision tree handles streaming data scenario that is applicable for big data analysis. However, imperfect data are unavoidable in real-world applications. Studying the state-of-art incremental decision tree induction using Hoeffding bound, we investigated the influence of imperfect data on decision tree model. Additionally, we found the imperfect data worsen the performance of decision tree learning, resulting in worse accuracy and more consumed resource. This paper would be good reference for the future research. When thinking of a new generation of incremental decision tree, we should try to overcome the negative effects of imperfect data.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com