Sciweavers

115 search results - page 6 / 23
» Cluster Validity Methods: Part I
Sort
View
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
14 years 10 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
ATAL
2006
Springer
14 years 1 months ago
Efficient agent-based cluster ensembles
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
Adrian K. Agogino, Kagan Tumer
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
14 years 1 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
CIKM
2007
Springer
14 years 4 months ago
Randomized metric induction and evolutionary conceptual clustering for semantic knowledge bases
We present an evolutionary clustering method which can be applied to multi-relational knowledge bases storing resource annotations expressed in the standard languages for the Sema...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
12 years 6 days ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri