Semi-supervised discriminative clustering with graph regularization

Marek Śmieja

doi:10.1016/j.knosys.2018.03.019

Return

Semi-supervised discriminative clustering with graph regularization

2018-07-01

PRE

Marek Śmieja *

Oleksandr Myronov

Jacek Tabor

DOI：10.1016/j.knosys.2018.03.019

Original

Original request for help

Save

Abstract

En 中文

Pairwise constraints are a typical form of class information used in semi-supervised clustering. Although various methods were proposed to combine unlabeled data with pairwise constraints, most of them rely on adapting existing clustering frameworks, such as GMM or k-means, to semi-supervised setting. In consequence, pairwise relations have to be transferred into particular clustering model, which is often contradictory with expert knowledge. In this paper we propose a novel semi-supervised method, d-graph, which does not assume any pre-defined structure of clusters. We follow a discriminative approach and use logistic function to directly model posterior probabilities p(k/x) that point x belongs to kth cluster. Making use of these posterior probabilities we maximize the expected probability that pairwise constraints are preserved. To include unlabeled data in our clustering objective function, we introduce additional pairwise constraints so that nearby points are more likely to appear in the same cluster. The proposed model can be easily optimized with the use of gradient techniques and kernelized, which allows to discover arbitrary shapes and structures in data. The experimental results performed on various types of data demonstrate that d-graph obtains better clustering results than comparative state-of-the-art methods. (C) 2018 Elsevier B.V. All rights reserved.

Keywords:

Semi-supervised clustering

Discriminative model

Pairwise constraints

Graph clustering

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.