Jointly sparse neighborhood graph for multi-view manifold clustering.pdfVIP

下载本文档

6
0
约5.55万字
约 11页
2017-03-16 发布于天津
举报
版权申诉

Jointly sparse neighborhood graph for multi-view manifold clustering.pdf

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

Jointly sparse neighborhood graph for multi-view manifold clustering.pdf

Neurocomputing 216 (2016) 28–38 Contents lists available at ScienceDirect Neurocomputing journal homepage: /locate/neucom Jointly sparse neighborhood graph for multi-view manifold clustering Zhenyue Zhang n, Jiayun Mao Department of Mathematics and State Key Laboratory of CADCG, Zhejiang University, Yuquan Campus, Hangzhou 310027, China article info Article history: Received 24 November 2015 Received in revised form 4 May 2016 Accepted 4 July 2016 Communicated by Feiping Nie Available online 21 July 2016 Keywords: Multi-view learning Manifold clustering Jointly sparse method Neighborhood selection abstract View-speci?c neighborhoods commonly contain class-inconsistent neighbors in graph-based multi-view learning. A key problem is to handle class-inconsistent neighbors under each view. This paper employs jointly sparse learning to ?lter unreliable neighbors in the union of view-speci?c neighborhoods, via representing each entity in a weighted sum of its neighbors under each view. The proposed jointly sparse model can be easily solved by an ADMM method. The learned jointly sparse weights can be used to construct a similarity neighborhood graph, and the new graph can be further utilized for multi-view clustering and view-speci?c graph preconditioning. A fast algorithm for multi-view manifold clustering is then proposed, and two preconditioning approaches are discussed for improving conformability of view-speci?c graphs and eventually increasing the ef?ciency of graph-based algorithms for multi-view learning. Numerical experiments are reported, which provide good supports to the proposed methods. 2016 Elsevier B.V. All rights reserved. 1. Introduction Graphs have been widely used in diverse application areas such as machine learning, computer vision, speech processing, social networks, web search, bioinformatics among many others. For example, low-dimensional embedding of a manifold can be retrieved by its geodesic graph [25]. In many application tasks such as dimensio