Technical note: Some properties of splitting criteria

@article{Breiman1996TechnicalNS,
  title={Technical note: Some properties of splitting criteria},
  author={Leo Breiman},
  journal={Machine Learning},
  year={1996},
  volume={24},
  pages={41-47}
}
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. 
Highly Influential
This paper has highly influenced 21 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 238 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 107 extracted citations

238 Citations

0102030'97'02'08'14
Citations per Year
Semantic Scholar estimates that this publication has 238 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

" Block diagrams and splitting criteria for classification trees " Statistics and Computing

  • B. W. Silverman
  • Received April 29 , 1994 Accepted August 26…
  • 1993
1 Excerpt

" On the induction of decision trees for multiple concept learning

  • U. M. Fayyad
  • 1991

Similar Papers

Loading similar papers…