Analysis of a complexity-based pruning scheme for classification trees

DOI10.1109/TIT.2002.800482zbMath1062.62508MaRDI QIDQ4677553

Andrew B. Nobel

Publication date: 11 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Communication, information (94A99)

Related Items (9)

Linear Aggregation in Tree-Based Estimators ⋮ Vapnik–Chervonenkis dimension of axis-parallel cuts ⋮ Adaptive partitioning schemes for bipartite ranking ⋮ Risk bounds for CART classifiers under a margin condition ⋮ Computation of the complexity of vector quantizers by affine modeling ⋮ Information divergence estimation based on data-dependent partitions ⋮ Prequential analysis of complex data with adaptive model reselection ⋮ On signal representations within the Bayes decision framework ⋮ Learning with Deep Cascades

This page was built for publication: Analysis of a complexity-based pruning scheme for classification trees