Sciweavers

48 search results - page 3 / 10
» Earth mover distance over high-dimensional spaces
Sort
View
VLDB
2000
ACM
229views Database» more  VLDB 2000»
13 years 8 months ago
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
Many emerging application domains require database systems to support efficient access over highly multidimensional datasets. The current state-of-the-art technique to indexing hi...
Kaushik Chakrabarti, Sharad Mehrotra
SISAP
2008
IEEE
188views Data Mining» more  SISAP 2008»
13 years 11 months ago
High-Dimensional Similarity Retrieval Using Dimensional Choice
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
Dave Tahmoush, Hanan Samet
PR
2007
100views more  PR 2007»
13 years 4 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
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...
Robert M. Haralick, Rave Harpaz
ICCV
1999
IEEE
14 years 7 months ago
Texture-based Image Retrieval without Segmentation
Image segmentation is not only hard and unnecessary for texture-based image retrieval, but can even be harmful. Images of either individual or multiple textures are best described...
Yossi Rubner, Carlo Tomasi
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
14 years 5 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...