𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition

✍ Scribed by Kim, Baek S.; Park, Song B.

Book ID
117930853
Publisher
IEEE
Year
1986
Tongue
English
Weight
854 KB
Volume
PAMI-8
Category
Article
ISSN
0162-8828

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Finding polynomial roots: A fast algorit
Finding polynomial roots: A fast algorithm convergent on the complex plane
✍ Ivanisov, Andrey V. ;Polishchuk, Vadim K. πŸ“‚ Article πŸ“… 1985 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 351 KB πŸ‘ 1 views

An algorithm is suggested which performs fast calculations of all the roots of a polynomial with maximal computer accuracy using, as the only primary information, the coefficients and the degree of the polynomial. The algorithm combines global as well as local convergences, i.e. it ensures a rapid h

A clustering procedure based on the comp
A clustering procedure based on the comparison between the k nearest neighbors graph and the minimal spanning tree
✍ JosΓ© Marı́a GonzΓ‘lez-Barrios; Adolfo J. Quiroz πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 250 KB

We present a procedure for the identiΓΏcation of clusters in multivariate data sets, based on the comparison between the k nearest neighbors graph, G k , and the minimal spanning tree, MST. Our key statistic is the random quantity k := the smallest k such that G k contains the MST. Under regularity a