Orthogonal decision trees

Abstract

This paper introduces orthogonal decision trees that offer an effective way to construct a redundancy-free, accurate, and meaningful representation of large decision-tree-ensembles often created by popular techniques such as bagging, boosting, random forests, and many distributed and data stream mining algorithms. Orthogonal decision trees are functionally… (More)
DOI: 10.1109/ICDM.2004.10072

Topics

20 Figures and Tables

Slides referencing similar topics