A novel multi-view clustering method via low-rank and matrix-induced regularization.pdfVIP

下载本文档

19
0
约3.57万字
约 9页
2017-03-16 发布于天津
举报
版权申诉

A novel multi-view clustering method via low-rank and matrix-induced regularization.pdf

1、本文档共9页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

A novel multi-view clustering method via low-rank and matrix-induced regularization.pdf

Neurocomputing 216 (2016) 342–350 Contents lists available at ScienceDirect Neurocomputing journal homepage: /locate/neucom A novel multi-view clustering method via low-rank and matrix-induced regularization Yang Zhao a,b,n, Yong Dou a,b, Xinwang Liu a,b, Teng Li a,b a National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China b College of Computer, National University of Defense Technology, Changsha, China article info Article history: Received 14 March 2016 Received in revised form 18 July 2016 Accepted 3 August 2016 Communicated by Jun Yu Available online 8 August 2016 Keywords: Multi-view clustering Unsupervised clustering Robustness Diversity Matrix-induced regularization abstract Multi-view clustering algorithms have shown promising performance in various applications over the last few decades. Most of them, however, do not adequately take noises and correlation among multiple views into account, which may degrade the clustering performance. In this paper, we propose a novel multi-view clustering method to address these issues. In speci?c, we construct a low-rank consensus matrix and a sparse error matrix from each similarity matrix corresponding to each view. Furthermore, a matrix-induced regularization term is incorporated to reduce the redundancy and enhance the diversity among different views. The augmented Lagrangian multiplier algorithm is adopted to solve the resultant optimization problem. Comprehensive experiments are conducted to verify the effectiveness of the proposed algorithm. Results demonstrate that our algorithm outperforms several state-of-the-art ones on both synthetic and benchmark data sets. 2016 Elsevier B.V. All rights reserved. 1. Introduction Multi-view clustering, which aims to partition data points into groups with similar ones by applying information from different views, has shown great performance in recent years. Multi-view data are common in real-life problems. For ex