Sciweavers

259 search results - page 7 / 52
» Clustering for Approximate Similarity Search in High-Dimensi...
Sort
View
TASLP
2008
176views more  TASLP 2008»
14 years 9 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
94
Voted
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
15 years 6 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...
CCGRID
2006
IEEE
15 years 1 months ago
Density-Based Clustering for Similarity Search in a P2P Network
P2P systems represent a large portion of the Internet traffic which makes the data discovery of great importance to the user and the broad Internet community. Hence, the power of ...
Mouna Kacimi, Kokou Yétongnon
CEC
2007
IEEE
15 years 1 months ago
Virtual reality high dimensional objective spaces for multi-objective optimization: An improved representation
This paper presents an approach for constructing improved visual representations of high dimensional objective spaces using virtual reality. These spaces arise from the solution of...
Julio J. Valdés, Alan J. Barton, Robert Orc...
175
Voted
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
15 years 9 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis