International Journal of Computational Intelligence Systems

Volume 14, Issue 1, 2021, Pages 140 - 147

Semi-Supervised Density Peaks Clustering Based on Constraint Projection

Authors
Shan Yan, Hongjun Wang*, Tianrui Li, Jielei Chu, Jin Guo
School of Information Science and Technology, Southwest Jiaotong University, Chengdu, Sichuan, China
*Corresponding author. Email: wanghongjun@swjtu.edu.cn
Corresponding Author
Hongjun Wang
Received 15 July 2020, Accepted 22 October 2020, Available Online 9 November 2020.
DOI
10.2991/ijcis.d.201102.002How to use a DOI?
Keywords
Semi-supervised learning; Density peaks clustering; Pairwise constraint; Constraint projection
Abstract

Clustering by fast searching and finding density peaks (DPC) method can rapidly identify the centers of clusters which have relatively high densities and high distances according to a decision graph. Various methods have been introduced to extend the DPC model over the past five years. DPC was originally presented as an unsupervised learning algorithm, and the thought of adding some prior information to DPC emerges as an alternative approach for improving its performance. It is extravagant to collect labeled data in real applications, and annotation of class labels is a nontrivial work, while pairwise constraint information is easier to get. Furthermore, the class label information can be converted into pairwise constraint information. Thus, we can take full advantage of pairwise constraints (or prior information) as much as possible. So this paper presents a new semi-supervised density peaks clustering algorithm (SSDPC) that uses constraint projection, which is flexible in loosening a few constraints over the learning stage. In the first stage, instances involving instance-level constraints and the remaining instances are concurrently projected to a lower dimensional data space led by the pairwise constraints, where viewing the distribution of data instances more clearly is available. Subsequently, traditional DPC is executed on the new lower dimensional dataset. Lastly, a few datasets from the Microsoft Research Asia Multimedia (MSRA-MM) image and UCI machine learning repository datasets are adopted in the experimental validation. The experimental results demonstrate that the proposed SSDPC achieves better performance than other three semi-supervised clustering algorithms.

Copyright
© 2021 The Authors. Published by Atlantis Press B.V.
Open Access
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)
View full text (HTML)

Journal
International Journal of Computational Intelligence Systems
Volume-Issue
14 - 1
Pages
140 - 147
Publication Date
2020/11/09
ISSN (Online)
1875-6883
ISSN (Print)
1875-6891
DOI
10.2991/ijcis.d.201102.002How to use a DOI?
Copyright
© 2021 The Authors. Published by Atlantis Press B.V.
Open Access
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - JOUR
AU  - Shan Yan
AU  - Hongjun Wang
AU  - Tianrui Li
AU  - Jielei Chu
AU  - Jin Guo
PY  - 2020
DA  - 2020/11/09
TI  - Semi-Supervised Density Peaks Clustering Based on Constraint Projection
JO  - International Journal of Computational Intelligence Systems
SP  - 140
EP  - 147
VL  - 14
IS  - 1
SN  - 1875-6883
UR  - https://doi.org/10.2991/ijcis.d.201102.002
DO  - 10.2991/ijcis.d.201102.002
ID  - Yan2020
ER  -