✦ LIBER ✦

Partially specified nearest neighbor searches using k-d trees

✍ Scribed by C.M. Eastman; M. Zemankova

Book ID: 113162479
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 527 KB
Volume: 15
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(82)90106-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast exact k nearest neighbors search us

Fast exact k nearest neighbors search using an orthogonal search tree

✍ Yi-Ching Liaw; Maw-Lin Leou; Chien-Min Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Optimal bucket size for nearest neighbor

Optimal bucket size for nearest neighbor searching in k-d trees

✍ C.M. Eastman 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 287 KB

Fast k-nearest neighbor classification u

Fast k-nearest neighbor classification using cluster-based trees

✍ Bin Zhang; Srihari, S.N. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 446 KB

The efficiency of using k-d trees for fi

The efficiency of using k-d trees for finding nearest neighbors in discrete space

✍ O.J. Murphy; S.M. Selkow 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 252 KB

Simultaneous feature selection and featu

Simultaneous feature selection and feature weighting using Hybrid Tabu Search/K-nearest neighbor classifier

✍ Muhammad Atif Tahir; Ahmed Bouridane; Fatih Kurugollu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 594 KB

Fast indexing method for image retrieval

Fast indexing method for image retrieval using k nearest neighbors searches by principal axis analysis

✍ Shyi-Chyi Cheng; Tian-Luu Wu 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 737 KB

This paper presents a fast indexing scheme for content-based image retrieval based on the principal axis analysis. Image databases often represent the image objects as high-dimensional feature vectors and access them via the feature vectors and similarity measure. A similarity measure similar to the