Sciweavers

1105 search results - page 70 / 221
» Approximate Spectral Clustering.
Sort
View
KAIS
2011
129views more  KAIS 2011»
13 years 5 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
13 years 11 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 10 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...
COLT
2006
Springer
14 years 1 months ago
A Sober Look at Clustering Stability
Stability is a common tool to verify the validity of sample based algorithms. In clustering it is widely used to tune the parameters of the algorithm, such as the number k of clust...
Shai Ben-David, Ulrike von Luxburg, Dávid P...
DAS
2008
Springer
13 years 11 months ago
A Comparison of Clustering Methods for Word Image Indexing
In this paper we explore the effectiveness of three clustering methods used to perform word image indexing. The three methods are: the Self-Organazing Map (SOM), the Growing Hiera...
Simone Marinai, Emanuele Marino, Giovanni Soda