1105 search results - page 134 / 221 » Approximate Spectral Clustering. |
99
Voted
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
102
click to vote
WCRE
2008
IEEE
15 years 7 months ago
2008
IEEE
During software maintenance tasks, developers often spend an important amount of effort investigating source code. This effort can be reduced if tools are available to help develo...
106
click to vote
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known k-nearest neighbor method. In this paper, we combine th...
111
click to vote
ICCV
2003
IEEE
16 years 3 months ago
2003
IEEE
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
108
click to vote
EDBT
2004
ACM
16 years 1 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...