✦ LIBER ✦

Construction of the nearest neighbor embracing graph of a point set

✍ Scribed by M. Y. Chan; Danny Z. Chen; Francis Y. L. Chin; Cao An Wang

Book ID: 106407039
Publisher: Springer US
Year: 2006
Tongue: English
Weight: 282 KB
Volume: 11
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-006-8459-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast Construction of k-Nearest Neighbor

Fast Construction of k-Nearest Neighbor Graphs for Point Clouds

✍ Connor, M.; Kumar, P. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 957 KB

Chromatic distribution of k-nearest neig

Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set

✍ Partha P. Goswami; Sandip Das; Subhas C. Nandy 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 139 KB

The Invariance Principle for the Total L

The Invariance Principle for the Total Length of the Nearest-Neighbor Graph

✍ Younghoon Kim; Sungchul Lee; Zhengyan Lin; Wensheng Wang 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 149 KB

The Effective Resistance of the(N)-Cycle

The Effective Resistance of the(N)-Cycle Graph with Four Nearest Neighbors

✍ Chair, Noureddine 📂 Article 📅 2014 🏛 Springer 🌐 English ⚖ 276 KB

Connectivity of the mutual k-nearest-nei

Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection

✍ M.R. Brito; E.L. Chávez; A.J. Quiroz; J.E. Yukich 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 610 KB

For multivariate data sets, we study the relationship between the connectivity of a mutual k-nearest-neighbor graph, and the presence of clustering structure and outliers in the data. A test for detection of clustering structure and outliers is proposed and its performance is evaluated in simulated

The Law of the Iterated Logarithm for th

The Law of the Iterated Logarithm for the Total Length of the Nearest Neighbor Graph

✍ Younghoon Kim; Sungchul Lee; Zhengyan Lin 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 136 KB