赵亮

个人信息Personal Information

副教授

博士生导师

硕士生导师

主要任职:无

性别:男

毕业院校:大连理工大学

学位:博士

所在单位:软件学院、国际信息与软件学院

学科:软件工程

办公地点:软件学院综合楼417

联系方式:liangzhao@dlut.edu.cn

扫描关注

论文成果

当前位置: 中文主页 >> 科学研究 >> 论文成果

Incomplete multi-view clustering via deep semantic mapping

点击次数:

论文类型:期刊论文

发表时间:2018-01-31

发表刊物:NEUROCOMPUTING

收录刊物:SCIE、EI

卷号:275

页面范围:1053-1062

ISSN号:0925-2312

关键字:Multi-view clustering; Incomplete views; Deep semantic mapping; Graph regularization

摘要:Multi-view clustering, which explores complementary information between multiple feature sets by consensus grouping, has benefited many data analytic applications. The majority of previous multi-view clustering studies usually assume that all feature sets appear in complete. In real-world applications, however, it is often the case that some views could suffer from the missing of examples, resulting in incomplete feature sets. The incompleteness of views makes it difficult to synthesize all feature sets and achieve a comprehensive description of data samples. In this paper, we develop a novel incomplete multi-view clustering method, which projects all incomplete multi-view data to a complete and unified representation in a common subspace. Different from existing researches which exploit shallow learning to identify the common subspace, a deep incomplete multi-view clustering (DIMC) incorporating with the constraint of intrinsic geometric structure is proposed here to couple incomplete multi-view samples. To bridge the gap between each view and the common representation, the multi-view deep coupled networks are trained to map high-level semantic features. Besides, to preserve the local invariance for each view, an affinity graph based regularizer is constructed to encode geometrical information. Therefore, a new objective function is developed and the optimization processes are presented. Extensive experiments on several real-world datasets demonstrate that the proposed DIMC is superior to the state-of-the-art incomplete multi-view clustering methods. (c) 2017 Published by Elsevier B.V.