✦ LIBER ✦

Composite Distance Transformation for Indexing andk-Nearest-Neighbor Searching in High-Dimensional Spaces

✍ Scribed by Yi Zhuang; Yue-Ting Zhuang; Fei Wu

Publisher: Springer
Year: 2007
Tongue: English
Weight: 611 KB
Volume: 22
Category: Article
ISSN: 1000-9000
DOI: 10.1007/s11390-007-9027-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient nearest neighbor search in

An efficient nearest neighbor search in high-dimensional data spaces

✍ Dong-Ho Lee; Hyoung-Joo Kim 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 240 KB

the result that basically none of the querying and indexing techniques which provide good results on lowdimensional data also performs sufficiently well on high-dimensional data. Many researchers have called this problem the "curse of dimensionality" [3], and many database-related projects have trie

Audio Fingerprinting: Nearest Neighbor S

Audio Fingerprinting: Nearest Neighbor Search in High Dimensional Binary Spaces

✍ Miller, Matthew L. ;Rodriguez, Manuel Acevedo ;Cox, Ingemar J. 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 430 KB

SR-tree: An index structure for nearest-

SR-tree: An index structure for nearest-neighbor searching of high-dimensional point data

✍ Norio Katayama; Shin'ichi Satoh 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 273 KB 👁 2 views

Similarity search methods using feature vectors are employed widely for implementation of content-based retrieval of visual data, and appropriate index structures were explored to accelerate the search. Methods proposed hitherto have used the R \* -tree and the SS-tree. This study offers a faster in

SPY-TEC: An efficient indexing method fo

SPY-TEC: An efficient indexing method for similarity search in high-dimensional data spaces

✍ Dong-Ho Lee; Hyoung-Joo Kim 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 650 KB