Analysis of a complexity-based pruning scheme for classification trees
From MaRDI portal
Publication:4677553
DOI10.1109/TIT.2002.800482zbMath1062.62508MaRDI QIDQ4677553
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
62H30: Classification and discrimination; cluster analysis (statistical aspects)
94A99: Communication, information
Related Items
Vapnik–Chervonenkis dimension of axis-parallel cuts, Prequential analysis of complex data with adaptive model reselection, Linear Aggregation in Tree-Based Estimators, 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, On signal representations within the Bayes decision framework, Information divergence estimation based on data-dependent partitions, Learning with Deep Cascades