Sciweavers

70 search results - page 2 / 14
» An axiomatization of partition entropy
Sort
View
ICML
2005
IEEE
16 years 16 days ago
Comparing clusterings: an axiomatic view
This paper views clusterings as elements of a lattice. Distances between clusterings are analyzed in their relationship to the lattice. From this vantage point, we first give an a...
Marina Meila
98
Voted
JUCS
2002
131views more  JUCS 2002»
14 years 11 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
INFOCOM
2010
IEEE
14 years 9 months ago
An Axiomatic Theory of Fairness in Network Resource Allocation
We present a set of five axioms for fairness measures in resource allocation. A family of fairness measures satisfying the axioms is constructed. Well-known notions such as -fairne...
Tian Lan, David Kao, Mung Chiang, Ashutosh Sabharw...
CORR
2011
Springer
144views Education» more  CORR 2011»
14 years 6 months ago
On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
Mehdi Molkaraie, Payam Pakzad
87
Voted
FUIN
2007
85views more  FUIN 2007»
14 years 11 months ago
Entropies and Co-Entropies of Coverings with Application to Incomplete Information Systems
Different generalizations to the case of coverings of the standard approach to entropy applied to partitions of a finite universe X are explored. In the first approach any cover...
Daniela Bianucci, Gianpiero Cattaneo, Davide Ciucc...