Learning Decision Trees from Histogram Data Using Multiple Subsets of Bins
2016 (English)In: Twenty-Ninth International Florida Artificial Intelligence Research Society Conference, AAAI Press , 2016Conference paper (Refereed)
The standard approach of learning decision trees from histogram data is to treat the bins as independent variables. However, as the underlying dependencies among the bins might not be completely exploited by this approach, an algorithm has been proposed for learning decision trees from histogram data by considering all bins simultaneously while partitioning examples at each node of the tree. Although the algorithm has been demonstrated to improve predictive performance, its computational complexity has turned out to be a major bottleneck, in particular for histograms with a large number of bins. In this paper, we propose instead a sliding window approach to select subsets of the bins to be considered simultaneously while partitioning examples. This significantly reduces the number of possible splits to consider, allowing for substantially larger histograms to be handled. We also propose to evaluate the original bins independently, in addition to evaluating the subsets of bins when performing splits. This ensures that the information obtained by treating bins simultaneously is an additional gain compared to what is considered by the standard approach. Results of experiments on applying the new algorithm to both synthetic and real world datasets demonstrate positive results in terms of predictive performance without excessive computational cost.
Place, publisher, year, edition, pages
AAAI Press , 2016.
histogram variables; histogram tree; histogram classifier
Research subject Computer and Systems Sciences
IdentifiersURN: urn:nbn:se:su:diva-135432ISBN: 978-1-57735-756-8OAI: oai:DiVA.org:su-135432DiVA: diva2:1045216