Entropy-based Splitting
Entropy-Based Splitting is a decision tree partitioning method that belongs to the class of impurity-based splitting criteria, distinguished by its use of Shannon entropy to quantify node heterogeneity and guide recursive data segmentation.
16
Publications
587
Citations
44
Authors
26
Institutions
Publications per year
2017–2026
6
Parents
16
On entropy approximation for Gaussian mixture random vectors
Marco F. Huber, Tim Bailey, Hugh Durrant‐Whyte et al. · 2008 · 242 citations · Full text
Entropy splitting for antiblocking corners and perfect graphs
Imre Csiszár, János Körner, László Lovász et al. · COMBINATORICA · 1990 · 95 citations
1–5 of 16
44
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 44
26

University of Milan
Milan, Italy
2 h-index
4 publications
68 citations
Government of Himachal Pradesh
Shimla, India
1 h-index
1 publications
48 citations
Instituto de Telecomunicações
Lisbon, Portugal
1 h-index
1 publications
19 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
1 h-index
2 publications
484 citations
Himachal Pradesh University
Shimla, India
1 h-index
2 publications
96 citations
Dalian University of Technology
Dalian, China
1 h-index
6 publications
174 citations

University of Beira Interior
Covilha, Portugal
1 h-index
1 publications
19 citations

Ames Research Center
Mountain View, United States
1 h-index
1 publications
19 citations
1–8 of 26
1 publications · 29 citations
1
h-index
1 publications · 15 citations
1
h-index
Repository · 1 publications · 10 citations
1
h-index
1 publications · 95 citations
1
h-index
1 publications · 15 citations
1
h-index
1–5