259 search results - page 3 / 52 » Clustering for Approximate Similarity Search in High-Dimensi... |
130
click to vote
TKDE
2011
14 years 6 months ago
2011
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
108
click to vote
ECML
2006
Springer
15 years 3 months ago
2006
Springer
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...
115
click to vote
DSMML
2004
Springer
15 years 5 months ago
2004
Springer
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
VLDB
1998
ACM
15 years 3 months ago
1998
ACM
77
Voted
PR
2007
14 years 11 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...