484 search results - page 12 / 97 » Measuring the Quality of Approximated Clusterings |
ICMLA
2008
15 years 1 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
100
click to vote
CIDM
2009
IEEE
15 years 4 months ago
2009
IEEE
—This paper addresses two main challenges for clustering which require extensive human effort: selecting appropriate parameters for an arbitrary clustering algorithm and identify...
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...
DAWAK
2007
Springer
15 years 5 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
DEXA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. K-anonymisation is an approach to protecting private information contained within a dataset. Many k-anonymisation methods have been proposed recently and one class of suc...