4084 search results - page 74 / 817 » The Method of Quantum Clustering |
132
click to vote
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
141
click to vote
TKDE
2012
13 years 3 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
113
click to vote
GFKL
2004
Springer
15 years 6 months ago
2004
Springer
Cluster ensembles are collections of individual solutions to a given clustering problem which are useful or necessary to consider in a wide range of applications. The R package˜c...
ICCS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This paper presents an innovative, adaptive variant of Kohonen’s selforganizing maps called ASOM, which is an unsupervised clustering method that adaptively decides on ...
116
click to vote
KES
2005
Springer
15 years 7 months ago
2005
Springer
Clustering for the analysis of the gene expression profiles has been used for identifying the functions of the genes and of unknown genes. Since the genes usually belong to multipl...