Survey of Nearest Neighbor Techniques

Abstract

The nearest neighbor (NN) technique is very simple, highly efficient and effective in the field of pattern recognition, text categorization, object recognition etc. Its simplicity is its main advantage, but the disadvantages can't be ignored even. The memory requirement and computation complexity also matter. Many techniques are developed to overcome these limitations. NN techniques are broadly classified into structure less and structure based techniques. In this paper, we present the survey of such techniques. Weighted kNN, Model based kNN, Condensed NN, Reduced NN, Generalized NN are structure less techniques whereas k-d tree, ball tree, Principal Axis Tree, Nearest Feature Line, Tunable NN, Orthogonal Search Tree are structure based algorithms developed on the basis of kNN. The structure less method overcome memory limitation and structure based techniques reduce the computational complexity.

4 pages, 1 table

Cited by in corpus (23)

• Distance and Similarity Measures Effect on the Performance of K-Nearest Neighbor Classifier -- A Review
• REGAL: Representation Learning-based Graph Alignment
• Solving the Problem of the K Parameter in the KNN Classifier Using an Ensemble Learning Approach
• EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph
• A Dynamic Mode Decomposition Extension for the Forecasting of Parametric Dynamical Systems
• Unsupervised K-Nearest Neighbor Regression
• On Enhancing The Performance Of Nearest Neighbour Classifiers Using Hassanat Distance Metric
• Ball*-tree: Efficient spatial indexing for constrained nearest-neighbor search in metric spaces
• The S-PLUS: a star/galaxy classification based on a Machine Learning approach
• Unit Commitment using Nearest Neighbor as a Short-Term Proxy
• A New Classification Approach for Robotic Surgical Tasks Recognition
• A Comprehensive Survey on the Ambulance Routing and Location Problems
• MosAIc: Finding Artistic Connections across Culture with Conditional Image Retrieval
• A Machine Learning Approach Towards Runtime Optimisation of Matrix Multiplication
• An Improved Simulation Model for Pedestrian Crowd Evacuation
• Learning Nearest Neighbor Graphs from Noisy Distance Samples
• Probabilistic Approach for Evaluating Metabolite Sample Integrity
• Generalized Grasping for Mechanical Grippers for Unknown Objects with Partial Point Cloud Representations
• Nearest Neighbor Search Under Uncertainty
• Cluster-and-Conquer: A Framework For Time-Series Forecasting
• Generative Interest Estimation for Document Recommendations
• Efficient Global Indoor Localization for Micro Aerial Vehicles
• Classifying Documents within Multiple Hierarchical Datasets using Multi-Task Learning