484 search results - page 17 / 97 » Measuring the Quality of Approximated Clusterings |
151
Voted
TNN
2010
14 years 8 months ago
2010
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
105
Voted
WG
2007
Springer
15 years 8 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
107
click to vote
TKDE
2008
15 years 1 months ago
2008
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
102
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
110
click to vote
IPPS
2008
IEEE
15 years 8 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...