142 search results - page 8 / 29 » Clustering Large Datasets in Arbitrary Metric Spaces |
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
SISAP
2010
IEEE
13 years 5 months ago
2010
IEEE
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
RIAO
2007
13 years 8 months ago
2007
One of the keys issues to content-based image retrieval is the similarity measurement of images. Images are represented as points in the space of low-level visual features and mos...
TKDE
2012
11 years 9 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...