Minimum impurity partitions

DOI10.1214/AOS/1176348789zbMath0781.62094OpenAlexW2082896932MaRDI QIDQ1206733

Arthur Nádas, David Burshtein, Dimitri Kanevsky, Vincent Della Pietra

Publication date: 1 April 1993

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1176348789

zbMATH Keywords

classificationconvex hullinformation theorydiscriminationconcave functionclassification treesCARToptimal partitionsseparating hyperplanemeasurable \(k\) way partitionmultidimensional regression trees

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Linear inference, regression (62J99) Statistical decision theory (62C99)

Related Items (1)

Minimization of Gini impurity: NP-completeness and approximation algorithm via connections with the \(k\)-means problem

This page was built for publication: Minimum impurity partitions