Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries

Given a set R of red points and a set B of blue points, the nearest-neighbour decision rule classifies a new point q as red (respectively, blue) if the closest point to q in R ∪ B comes from R (respectively, B). This rule implicitly partitions space into a red set and a blue set that are separated by a red-blue decision boundary. In this paper we develop output-sensitive algorithms for computing this decision boundary for point sets on the line and in ℝ2. Both algorithms run in time O(n log k), where k is the number of points that contribute to the decision boundary. This running time is the best possible when parameterizing with respect to n and k.

[1]  Michael Ian Shamos,et al.  Geometric complexity , 1975, STOC.

[2]  Luc Devroye,et al.  On the Inequality of Cover and Hart in Nearest Neighbor Discrimination , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  David G. Kirkpatrick,et al.  The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..

[4]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[5]  R. Wenger,et al.  Randomized Quick Hull , 1995 .

[6]  David G. Kirkpatrick,et al.  A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.

[7]  M. Chial,et al.  in simple , 2003 .

[8]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[9]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[10]  Michael Ben-Or,et al.  Lower bounds for algebraic computation trees , 1983, STOC.

[11]  Timothy M. Chan.  Optimal output-sensitive convex hull algorithms in two and three dimensions , 1996, Discret. Comput. Geom..

[12]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..

[13]  C. A. R. Hoare,et al.  Algorithm 64: Quicksort , 1961, Commun. ACM.

[14]  Lee J. White,et al.  A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them , 1978, Pattern Recognit..

[15]  Timothy M. Chan,et al.  Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams , 1997, Discret. Comput. Geom..

[16]  Binay K. Bhattacharya,et al.  On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm , 1997, J. Algorithms.

[17]  Peter E. Hart,et al.  Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.

[18]  C. J. Stone,et al.  Optimal Rates of Convergence for Nonparametric Estimators , 1980 .

[19]  C. J. Stone,et al.  Consistent Nonparametric Regression , 1977 .