A greedy algorithm for supervised discretization
Journal of Biomedical Informatics - Special issue: Biomedical machine learning
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Clustering with feature order preferences
Intelligent Data Analysis - Artificial Intelligence
Entropic quadtrees and mining mars craters
ICDM'10 Proceedings of the 10th industrial conference on Advances in data mining: applications and theoretical aspects
Generalized conditional entropy and a metric splitting criterion for decision trees
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Entropy Quad-Trees for High Complexity Regions Detection
International Journal of Software Science and Computational Intelligence
Edge evaluation in Bayesian network structures
AusDM '09 Proceedings of the Eighth Australasian Data Mining Conference - Volume 101
Hi-index | 754.84 |
The aim of this article is to present an axiomatization of a generalization of Shannon's entropy starting from partitions of finite sets. The proposed axiomatization defines a family of entropies depending on a real positive parameter that contains as a special case the Havrda-Charvat (1967) entropy, and thus, provides axiomatizations for the Shannon entropy, the Gini index, and for other types of entropy used in classification and data mining