A Least Square Approach to Semi-supervised Local Cluster Extraction

02/07/2022
by   Ming-Jun Lai, et al.
7

A least square semi-supervised local clustering algorithm based on the idea of compressed sensing are proposed to extract clusters from a graph with known adjacency matrix. The algorithm is based on a two stage approaches similar to the one in <cit.>. However, under a weaker assumption and with less computational complexity than the one in <cit.>, the algorithm is shown to be able to find a desired cluster with high probability. Several numerical experiments including the synthetic data and real data such as MNIST, AT&T and YaleB human faces data sets are conducted to demonstrate the performance of our algorithm.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset