A Least Square Approach to Semi-supervised Local Cluster Extraction

by   Ming-Jun Lai, et al.
University of Georgia

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.


page 14

page 16


Semi-Supervised Cluster Extraction via a Compressive Sensing Approach

We use techniques from compressive sensing to design a local clustering ...

Semi-Supervised Information-Maximization Clustering

Semi-supervised clustering aims to introduce prior knowledge in the deci...

An Effective Semi-supervised Divisive Clustering Algorithm

Nowadays, data are generated massively and rapidly from scientific field...

Semi-supervised Local Cluster Extraction by Compressive Sensing

Local clustering problem aims at extracting a small local structure insi...

Relaxed Oracles for Semi-Supervised Clustering

Pairwise "same-cluster" queries are one of the most widely used forms of...

A Computational Theory and Semi-Supervised Algorithm for Clustering

A computational theory for clustering and a semi-supervised clustering a...

Semi-supervised Learning in Network-Structured Data via Total Variation Minimization

We propose and analyze a method for semi-supervised learning from partia...

Please sign up or login with your details

Forgot password? Click here to reset