ML Anthology

Technical Note: Some Properties of Splitting Criteria

Leo Breiman
MLJ 1996 pp. 41-47
doi:10.1007/BF00117831 /mlj/1996/breiman1996mlj-technical/

Abstract

Various criteria have been proposed for deciding which split is best at a given node of a binary classification tree. Consider the question: given a goodness-of-split criterion and the class populations of the instances at a node, what distribution of the instances between the two children nodes maximizes the goodness-of-split criterion? The answers reveal an interesting distinction between the gini and entropy criterion.

PDF MLJ Semantic Scholar

Cite

Text

Breiman. "Technical Note: Some Properties of Splitting Criteria." Machine Learning, 1996. doi:10.1007/BF00117831

Markdown

[Breiman. "Technical Note: Some Properties of Splitting Criteria." Machine Learning, 1996.](https://mlanthology.org/mlj/1996/breiman1996mlj-technical/) doi:10.1007/BF00117831

BibTeX

@article{breiman1996mlj-technical,
  title     = {{Technical Note: Some Properties of Splitting Criteria}},
  author    = {Breiman, Leo},
  journal   = {Machine Learning},
  year      = {1996},
  pages     = {41-47},
  doi       = {10.1007/BF00117831},
  volume    = {24},
  url       = {https://mlanthology.org/mlj/1996/breiman1996mlj-technical/}
}