Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ICALP
1992
Springer

favoriteEmaildiscussreport

114views Programming Languages» more ICALP 1992»

On Nearest-Neighbor Graphs

13 years 8 months ago

On Nearest-Neighbor Graphs

Download www.cs.ust.hk

The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in computational geometry and clustering analysis, yet surprisingly little is known about some of its basic properties. In this paper, we consider some natural questions that are motivated by geometric embedding problems. We derive bounds on the relationship between size and depth for the components of a nearest-neighbor graph and prove some probabilistic properties of the k-nearest-neighbors graph for a random set of points.

Mike Paterson, F. Frances Yao

Real-time Traffic

Geometric Embedding Problems | ICALP 1992 | K Nearest Neighbors | Nearest Neighbors | Programming Languages |

claim paper

Related Content

» Reverse Nearest Neighbors in Large Graphs

» kNearest Neighbors in Uncertain Graphs

» Fast Construction of kNearest Neighbor Graphs for Point Clouds

» Using the kNearest Neighbor Graph for Proximity Searching in Metric Spaces

» Nonlinear Dimensionality Reduction using Approximate Nearest Neighbors

» Improving the Performance of MTree Family by NearestNeighbor Graphs

» Detection of GaussMarkov Random Fields with NearestNeighbor Dependency

» Cluster Identification in NearestNeighbor Graphs

» Optimized intrinsic dimension estimator using nearest neighbor graphs

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1992
Where	ICALP
Authors	Mike Paterson, F. Frances Yao

Comments (0)