Semi-Supervised Selective Affinity Propagation Ensemble Clustering With Active Constraints
The semi-supervised selective affinity propagation ensemble clustering with active constraints (SSAPEC) method combines affinity propagation (AP) clustering algorithm with ensemble clustering and incorporates prior knowledge (almost a pairwise constraint) to improve the clustering performance. In th...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9024039/ |
id |
doaj-cfe7ea4991ae41c1b4c90158c5df084e |
---|---|
record_format |
Article |
spelling |
doaj-cfe7ea4991ae41c1b4c90158c5df084e2021-03-30T02:50:13ZengIEEEIEEE Access2169-35362020-01-018462554626610.1109/ACCESS.2020.29784049024039Semi-Supervised Selective Affinity Propagation Ensemble Clustering With Active ConstraintsQi Lei0https://orcid.org/0000-0001-7517-5313Ting Li1https://orcid.org/0000-0002-9593-7650School of Automation, Central South University, Changsha, ChinaSchool of Automation, Central South University, Changsha, ChinaThe semi-supervised selective affinity propagation ensemble clustering with active constraints (SSAPEC) method combines affinity propagation (AP) clustering algorithm with ensemble clustering and incorporates prior knowledge (almost a pairwise constraint) to improve the clustering performance. In this paper, the evaluation criterion coverage ratio, which is based on the structure of clustering result, is employed to judge the homogeneity of the component clusters without the assistance of ground-truth during the component cluster selection. And to solve the problem of random selection of pairwise constraints, an active learning strategy is applied to find most informative constraints based on the ensemble clustering result; these pairwise constraints selected by active learning strategy lead to a similarity matrix adjustment. Then, the final result is obtained by running the Average-link algorithm on the adjusted similarity matrix. The experimental results on fourteen datasets demonstrate that the SSAPEC method proposed in this paper outperforms other state-of-the-art ensemble clustering schemes.https://ieeexplore.ieee.org/document/9024039/Semi-supervised learningensemble clusteringensemble clustering selectionactive learning strategy |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Qi Lei Ting Li |
spellingShingle |
Qi Lei Ting Li Semi-Supervised Selective Affinity Propagation Ensemble Clustering With Active Constraints IEEE Access Semi-supervised learning ensemble clustering ensemble clustering selection active learning strategy |
author_facet |
Qi Lei Ting Li |
author_sort |
Qi Lei |
title |
Semi-Supervised Selective Affinity Propagation Ensemble Clustering With Active Constraints |
title_short |
Semi-Supervised Selective Affinity Propagation Ensemble Clustering With Active Constraints |
title_full |
Semi-Supervised Selective Affinity Propagation Ensemble Clustering With Active Constraints |
title_fullStr |
Semi-Supervised Selective Affinity Propagation Ensemble Clustering With Active Constraints |
title_full_unstemmed |
Semi-Supervised Selective Affinity Propagation Ensemble Clustering With Active Constraints |
title_sort |
semi-supervised selective affinity propagation ensemble clustering with active constraints |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2020-01-01 |
description |
The semi-supervised selective affinity propagation ensemble clustering with active constraints (SSAPEC) method combines affinity propagation (AP) clustering algorithm with ensemble clustering and incorporates prior knowledge (almost a pairwise constraint) to improve the clustering performance. In this paper, the evaluation criterion coverage ratio, which is based on the structure of clustering result, is employed to judge the homogeneity of the component clusters without the assistance of ground-truth during the component cluster selection. And to solve the problem of random selection of pairwise constraints, an active learning strategy is applied to find most informative constraints based on the ensemble clustering result; these pairwise constraints selected by active learning strategy lead to a similarity matrix adjustment. Then, the final result is obtained by running the Average-link algorithm on the adjusted similarity matrix. The experimental results on fourteen datasets demonstrate that the SSAPEC method proposed in this paper outperforms other state-of-the-art ensemble clustering schemes. |
topic |
Semi-supervised learning ensemble clustering ensemble clustering selection active learning strategy |
url |
https://ieeexplore.ieee.org/document/9024039/ |
work_keys_str_mv |
AT qilei semisupervisedselectiveaffinitypropagationensembleclusteringwithactiveconstraints AT tingli semisupervisedselectiveaffinitypropagationensembleclusteringwithactiveconstraints |
_version_ |
1724184494120894464 |