Sciweavers

52 search results - page 8 / 11
» Querying high-dimensional data in single-dimensional space
Sort
View
113
Voted
HPDC
2010
IEEE
14 years 11 months ago
Browsing large scale cheminformatics data with dimension reduction
Visualization of large-scale high dimensional data tool is highly valuable for scientific discovery in many fields. We present PubChemBrowse, a customized visualization tool for c...
Jong Youl Choi, Seung-Hee Bae, Judy Qiu, Geoffrey ...
91
Voted
SSDBM
2005
IEEE
184views Database» more  SSDBM 2005»
15 years 3 months ago
Optimizing Multiple Top-K Queries over Joins
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
Dirk Habich, Wolfgang Lehner, Alexander Hinneburg
76
Voted
SAC
2004
ACM
15 years 3 months ago
Similarity between Euclidean and cosine angle distance for nearest neighbor queries
Understanding the relationship among different distance measures is helpful in choosing a proper one for a particular application. In this paper, we compare two commonly used dis...
Gang Qian, Shamik Sural, Yuelong Gu, Sakti Pramani...
193
Voted
ICDE
2004
IEEE
138views Database» more  ICDE 2004»
15 years 11 months ago
Making the Pyramid Technique Robust to Query Types and Workloads
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
Rui Zhang 0003, Beng Chin Ooi, Kian-Lee Tan
EDBT
2009
ACM
184views Database» more  EDBT 2009»
15 years 5 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer