✦ LIBER ✦

An efficient branch-and-bound nearest neighbour classifier

✍ Scribed by H. Niemann; R. Goppert

Book ID: 107919820
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 425 KB
Volume: 7
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(88)90120-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast branch & bound nearest neighbour

A fast branch & bound nearest neighbour classifier in metric spaces

✍ Luisa Micó; Jose Oncina; Rafael C. Carrasco 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Efficient pattern synthesis for nearest

Efficient pattern synthesis for nearest neighbour classifier

✍ Monu Agrawal; Neha Gupta; R. Shreelekshmi; M. Narasimha Murty 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 276 KB

Overlap pattern synthesis with an effici

Overlap pattern synthesis with an efficient nearest neighbor classifier

✍ P. Viswanath; Narasimha Murty; Shalabh Bhatnagar 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 226 KB

An improved branch and bound algorithm f

An improved branch and bound algorithm for computing k-nearest neighbors

✍ Behrooz Kamgar-Parsi; Laveen N Kanal 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 350 KB

An efficient design of a nearest neighbo

An efficient design of a nearest neighbor classifier for various-scale problems

✍ Heesung Lee; Sungjun Hong; Imran Fareed Nizami; Euntai Kim 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 615 KB

By appropriate editing of the reference set and judicious selection of features, we can obtain an optimal nearest neighbor (NN) classifier that maximizes the accuracy of classification and saves computational time and memory resources. In this paper, we propose a new method for simultaneous referenc

Analysis of k-nearest neighbor branch an

Analysis of k-nearest neighbor branch and bound rules

✍ Soren Larsen; Laveen N Kanal 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 364 KB