2600 search results - page 126 / 520 » Clustering with or without the Approximation |
153
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Detecting local clustered anomalies is an intricate problem for many existing anomaly detection methods. Distance-based and density-based methods are inherently restricted by their...
168
click to vote
ICDAR
2011
IEEE
14 years 6 months ago
2011
IEEE
—Content-based document image retrieval is a new and promising research area. Without OCR, document indexing directly based on image content is more general and convenient. Howev...
172
click to vote
CVPR
2005
IEEE
16 years 8 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...
175
click to vote
ICCV
2003
IEEE
16 years 8 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...
174
click to vote
EDBT
2004
ACM
16 years 6 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...