New label propagation algorithm with pairwise constraints

doi:10.1016/j.patcog.2020.107411

Return

New label propagation algorithm with pairwise constraints

2020-10-01

PRE

Liang Bai *

Jiye Liang

Hangyuan Du

DOI：10.1016/j.patcog.2020.107411

Original

Original request for help

Save

Abstract

En 中文

The label propagation algorithm is a well-known semi-supervised clustering method, which uses pre-given partial labels as constraints to predict the labels of unlabeled data. However, the algorithm has the following limitations: (1) it does not fully consider the misalignment between the pre-given labels and clustering labels, and (2) it only uses label information as clustering constraints. Real applications not only contain partial label information but pairwise constraints on a dataset. To overcome these deficiencies, a new version of the label propagation algorithm is proposed, which makes use of pairwise relations of labels as constraints to construct an optimization model for spreading labels. Experimental analysis was used to compare the proposed algorithm with 8 other semi-supervised clustering algorithms on 11 benchmark datasets. The experimental results demonstrated that the proposed algorithm is more effective than other algorithms. (C) 2020 Elsevier Ltd. All rights reserved.

Keywords:

Cluster analysis

Semi-supervised clustering

Label propagation algorithm

Pairwise constraint

Spectral clustering

AI Summary

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