An Approximation Algorithm for a Semi-supervised Graph Clustering Problem

Abstract

Listen

Translate article

Clustering problems form an important section of data analysis. In machine learning clustering problems are usually classified as unsupervised learning. Semi-supervised clustering problems are also considered. In these problems relatively few objects are labeled (i.e., are assigned to clusters), whereas a large number of objects are unlabeled.