Sciweavers

5215 search results - page 341 / 1043
» Quantum clustering algorithms
Sort
View
COMPGEOM
2006
ACM
16 years 18 days ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
COMAD
2009
15 years 7 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan
ECCV
2002
Springer
16 years 8 months ago
On Affine Invariant Clustering and Automatic Cast Listing in Movies
Abstract We develop a distance metric for clustering and classification algorithms which is invariant to affine transformations and includes priors on the transformation parameters...
Andrew W. Fitzgibbon, Andrew Zisserman
ICASSP
2009
IEEE
16 years 1 months ago
Exploring functional connectivity in fMRI via clustering
In this paper we investigate the use of data driven clustering methods for functional connectivity analysis in fMRI. In particular, we consider the K-Means and Spectral Clustering...
Archana Venkataraman, Koene R. A. Van Dijk, Randy ...
ICPR
2008
IEEE
16 years 1 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel