Journal
PATTERN RECOGNITION
Volume 52, Issue -, Pages 33-45Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2015.10.014
Keywords
Decision tree; Active learning; Evidential likelihood; Uncertain data; Belief functions
Ask authors/readers for more resources
Learning from uncertain data has attracted increasing attention in recent years. In this paper, we propose a decision tree learning method that can not only handle uncertain data, but also reduce epistemic uncertainty by querying the most valuable uncertain instances within the learning procedure. Specifically, we use entropy intervals extracted from the evidential likelihood to query uncertain training instances when needed, with the goal to improve the selection of the splitting attribute. Experimental results under various conditions confirm the interest of the proposed approach. (C) 2015 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available