Sciweavers

310 search results - page 5 / 62
» High-Dimensional Similarity Joins
Sort
View
VLDB
2000
ACM
114views Database» more  VLDB 2000»
14 years 5 days ago
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uem...
TASLP
2008
176views more  TASLP 2008»
13 years 8 months ago
Analysis of Minimum Distances in High-Dimensional Musical Spaces
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...
Michael Casey, Christophe Rhodes, Malcolm Slaney
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
14 years 2 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 10 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
ICDE
2003
IEEE
160views Database» more  ICDE 2003»
14 years 10 months ago
HD-Eye - Visual Clustering of High dimensional Data
Clustering of large data bases is an important research area with a large variety of applications in the data base context. Missing in most of the research efforts are means for g...
Alexander Hinneburg, Daniel A. Keim, Markus Wawryn...