Sciweavers

259 search results - page 9 / 52
» Clustering for Approximate Similarity Search in High-Dimensi...
Sort
View
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
15 years 10 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
BTW
2009
Springer
133views Database» more  BTW 2009»
15 years 28 days ago
High-Dimensional Indexing for Multimedia Features
Abstract: Efficient content-based similarity search in large multimedia databases requires efficient query processing algorithms for many practical applications. Especially in hi...
Ira Assent, Stephan Günnemann, Hardy Kremer, ...
ICIP
2002
IEEE
15 years 11 months ago
Efficient video similarity measurement with video signature
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. In this paper, we propose a numbe...
Sen-Ching S. Cheung, Avideh Zakhor
EDBT
2000
ACM
15 years 2 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 2 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...