...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE transactions on big data >Multi-View Clustering With Self-Representation and Structural Constraint
【24h】

Multi-View Clustering With Self-Representation and Structural Constraint

机译：

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Multi-view data effectively model and characterize the underlying complex systems, and multi-view clustering is of great significance for revealing the mechanisms of systems, which groups objects into different clusters with high intra-cluster and low inter-cluster similarity for all views. Current algorithms are criticized for undesirable performance because they solely focus on either the shared features or correlation of objects, failing to address the heterogeneity and structural constraint of various views. To overcome these problems, a novel Multi-view Clustering with Self-representation and Structural Constraint (MCSSC) is proposed, which is a network-based method by fusing matrix factorization and low-rank representation of various views. Specifically, to remove heterogeneity of multi-view data, a network is constructed for each view, which casts the multi-view clustering into the multi-layer networks clustering problem. To extract the shared features of multiple views, MCSSC factorizes matrices associated with networks by projecting them into a common space and jointly learns an affinity graph for objects in multiple views with self-representation. To facilitate the clustering, the structural constraint is imposed on the affinity graph, where the clusters are identified. Extensive experiments demonstrate that MCSSC significantly outperforms the state-of-the-art in terms of accuracy, implying that the superiority of the proposed method.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号