Fast Randomized Semi-Supervised Clustering

DOI10.1088/1742-6596/1036/1/012015MaRDI QIDQ6273735zbMATH OpenWikidataFDO

Authors Alaa Saade, Florent Krzakala, Marc Lelarge, Lenka Zdeborová

Publication date 20 May 2016

Full work available at URL https://doi.org/10.1088/1742-6596/1036/1/012015

Abstract: We consider the problem of clustering partially labeled data from a minimal number of randomly chosen pairwise comparisons between the items. We introduce an efficient local algorithm based on a power iteration of the non-backtracking operator and study its performance on a simple model. For the case of two clusters, we give bounds on the classification error and show that a small error can be achieved from $O(n)$ randomly chosen measurements, where $n$ is the number of items in the dataset. Our algorithm is therefore efficient both in terms of time and space complexities. We also investigate numerically the performance of the algorithm on synthetic and real world data.

This page was built for publication: Fast Randomized Semi-Supervised Clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6273735)