Auto-Weighted Incomplete Multi-View Clustering

Nowadays, multi-view clustering has attracted more and more attention, which provides a way to partition multi-view data into their corresponding clusters. Previous studies assume that each data instance appears in all views. However, in real-world applications, it is common that each view may conta...

Full description

Bibliographic Details
Main Authors: Wanyu Deng, Lixia Liu, Jianqiang Li, Yijun Lin
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9151164/
id doaj-bc6320fd72c648ddbe3ae27f3db6c732
record_format Article
spelling doaj-bc6320fd72c648ddbe3ae27f3db6c7322021-03-30T04:21:32ZengIEEEIEEE Access2169-35362020-01-01813875213876210.1109/ACCESS.2020.30125009151164Auto-Weighted Incomplete Multi-View ClusteringWanyu Deng0https://orcid.org/0000-0002-9818-5562Lixia Liu1https://orcid.org/0000-0001-8053-531XJianqiang Li2https://orcid.org/0000-0001-5210-2234Yijun Lin3https://orcid.org/0000-0001-8219-7545School of Computer Science and Technology, Xi’an University of Posts and Telecommunications, Xi’an, ChinaSchool of Computer Science and Technology, Xi’an University of Posts and Telecommunications, Xi’an, ChinaSchool of Computer Science and Technology, Xi’an University of Posts and Telecommunications, Xi’an, ChinaSchool of Computer Science and Technology, Xi’an University of Posts and Telecommunications, Xi’an, ChinaNowadays, multi-view clustering has attracted more and more attention, which provides a way to partition multi-view data into their corresponding clusters. Previous studies assume that each data instance appears in all views. However, in real-world applications, it is common that each view may contain some missing data instances, resulting in incomplete multi-view data. To address the incomplete multi-view clustering problem, we will propose an auto-weighted incomplete multi-view clustering method in this paper, which learns a common representation of the instances and an affinity matrix of the learned representation simultaneously in a unified framework. Learning the affinity matrix of the representation guides to learn a more discriminative and compact consensus representation for clustering. Moreover, by considering the impact of the significance of different views, an adaptive weighting strategy is designed to measure the importance of each view. An efficient iterative algorithm is proposed to optimize the objective function. Experimental results on various real-world datasets show that the proposed method can improve the clustering performance in comparison with the state-of-the-art methods in most cases.https://ieeexplore.ieee.org/document/9151164/Adaptive weighting strategyaffinity matrixcommon representationincomplete multi-view clustering
collection DOAJ
language English
format Article
sources DOAJ
author Wanyu Deng
Lixia Liu
Jianqiang Li
Yijun Lin
spellingShingle Wanyu Deng
Lixia Liu
Jianqiang Li
Yijun Lin
Auto-Weighted Incomplete Multi-View Clustering
IEEE Access
Adaptive weighting strategy
affinity matrix
common representation
incomplete multi-view clustering
author_facet Wanyu Deng
Lixia Liu
Jianqiang Li
Yijun Lin
author_sort Wanyu Deng
title Auto-Weighted Incomplete Multi-View Clustering
title_short Auto-Weighted Incomplete Multi-View Clustering
title_full Auto-Weighted Incomplete Multi-View Clustering
title_fullStr Auto-Weighted Incomplete Multi-View Clustering
title_full_unstemmed Auto-Weighted Incomplete Multi-View Clustering
title_sort auto-weighted incomplete multi-view clustering
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2020-01-01
description Nowadays, multi-view clustering has attracted more and more attention, which provides a way to partition multi-view data into their corresponding clusters. Previous studies assume that each data instance appears in all views. However, in real-world applications, it is common that each view may contain some missing data instances, resulting in incomplete multi-view data. To address the incomplete multi-view clustering problem, we will propose an auto-weighted incomplete multi-view clustering method in this paper, which learns a common representation of the instances and an affinity matrix of the learned representation simultaneously in a unified framework. Learning the affinity matrix of the representation guides to learn a more discriminative and compact consensus representation for clustering. Moreover, by considering the impact of the significance of different views, an adaptive weighting strategy is designed to measure the importance of each view. An efficient iterative algorithm is proposed to optimize the objective function. Experimental results on various real-world datasets show that the proposed method can improve the clustering performance in comparison with the state-of-the-art methods in most cases.
topic Adaptive weighting strategy
affinity matrix
common representation
incomplete multi-view clustering
url https://ieeexplore.ieee.org/document/9151164/
work_keys_str_mv AT wanyudeng autoweightedincompletemultiviewclustering
AT lixialiu autoweightedincompletemultiviewclustering
AT jianqiangli autoweightedincompletemultiviewclustering
AT yijunlin autoweightedincompletemultiviewclustering
_version_ 1724182014943297536