.png){kind=icon}
返回
High-order multi-view clustering for generic data
.png){kind=icon}
OA
AI
DOI：10.1016/j.inffus.2023.101947.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Graph-based multi-view clustering has achieved better performance than most non-graph approaches. However, in many real-world scenarios, the graph structure of data is not given or the quality of initial graph is poor. Additionally, existing methods largely neglect the high-order neighborhood information that characterizes complex intrinsic interactions. To tackle these problems, we introduce an approach called high-order multi view clustering (HMvC) to explore the long-distance structural information of generic data. Firstly, graph filtering is applied to encode structure information, which unifies the processing of attributed graph data and non-graph data in a single framework. Secondly, up to infinity-order intrinsic relationships are exploited to enrich the learned graph. Thirdly, to explore the consistent and complementary information of various views, an adaptive graph fusion mechanism is proposed to achieve a consensus graph. Comprehensive experimental results on both non-graph and attributed graph data show the superior performance of our method with respect to various state-of-the-art techniques, including some deep learning methods.
Keyword:
Multi-view learning
High-order information
Graph clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
15.5
论文数:
4.3K
被引数:
2.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
Insurance activity and economic performance: Fresh evidence from asymmetric panel causality testsOAAI
OAAI分享收藏Passive signal propagation and membrane properties in median photoreceptors of the giant barnacleOAAI
OAAI分享收藏Graph-regularized least squares regression for multi-view subspace clustering用于多视图子空间聚类的图正则化最小二乘回归
PREAI
分享收藏
查看更多内容