A Graph-Based Semi-Supervised k Nearest-Neighbor Method for Nonlinear Manifold Distributed Data Classification

by   Enmei Tu, et al.

k Nearest Neighbors (kNN) is one of the most widely used supervised learning algorithms to classify Gaussian distributed data, but it does not achieve good results when it is applied to nonlinear manifold distributed data, especially when a very limited amount of labeled samples are available. In this paper, we propose a new graph-based kNN algorithm which can effectively handle both Gaussian distributed data and nonlinear manifold distributed data. To achieve this goal, we first propose a constrained Tired Random Walk (TRW) by constructing an R-level nearest-neighbor strengthened tree over the graph, and then compute a TRW matrix for similarity measurement purposes. After this, the nearest neighbors are identified according to the TRW matrix and the class label of a query point is determined by the sum of all the TRW weights of its nearest neighbors. To deal with online situations, we also propose a new algorithm to handle sequential samples based a local neighborhood reconstruction. Comparison experiments are conducted on both synthetic data sets and real-world data sets to demonstrate the validity of the proposed new kNN algorithm and its improvements to other version of kNN algorithms. Given the widespread appearance of manifold structures in real-world problems and the popularity of the traditional kNN algorithm, the proposed manifold version kNN shows promising potential for classifying manifold-distributed data.


An improvement to k-nearest neighbor classifier

K-Nearest neighbor classifier (k-NNC) is simple to use and has little de...

Locally Adaptive Nearest Neighbors

When training automated systems, it has been shown to be beneficial to a...

Finding Nearest Neighbors in graphs locally

Many distributed learning techniques have been motivated by the increasi...

Adaptive Preferential Attached kNN Graph with Distribution-Awareness

Graph-based kNN algorithms have garnered widespread popularity for machi...

Penalized K-Nearest-Neighbor-Graph Based Metrics for Clustering

A difficult problem in clustering is how to handle data with a manifold ...

Azadkia-Chatterjee's correlation coefficient adapts to manifold data

In their seminal work, Azadkia and Chatterjee (2021) initiated graph-bas...

Instance-based learning using the Half-Space Proximal Graph

The primary example of instance-based learning is the k-nearest neighbor...

Please sign up or login with your details

Forgot password? Click here to reset