Multi-view graph structure learning using subspace merging on Grassmann manifold
Many successful learning algorithms have been recently developed to represent graph-structured data. For example, Graph Neural Networks (GNNs) have achieved considerable successes in various tasks such as node classification, graph classification, and link prediction. However, these methods are highly dependent on the quality of the input graph structure. One used approach to alleviate this problem is to learn the graph structure instead of relying on a manually designed graph. In this paper, we introduce a new graph structure learning approach using multi-view learning, named MV-GSL (Multi-View Graph Structure Learning), in which we aggregate different graph structure learning methods using subspace merging on Grassmann manifold to improve the quality of the learned graph structures. Extensive experiments are performed to evaluate the effectiveness of the proposed method on two benchmark datasets, Cora and Citeseer. Our experiments show that the proposed method has promising performance compared to single and other combined graph structure learning methods.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph ClassificationGraph structure learningLink PredictionMULTI-VIEW LEARNINGNode ClassificationSimilar Papers 제목 키워드 기반
Multi-view Subspace Clustering Networks with Local and Global Graph Information
This study investigates the problem of multi-view subspace clustering, the goal of which is to explore the underlying grouping structure of data collected from different fields or measurements. Since data do not always c…
ClusteringMulti-view Subspace ClusteringLearning Subspace-Preserving Sparse Attention Graphs from Heterogeneous Multiview Data
The high-dimensional features extracted from large-scale unlabeled data via various pretrained models with diverse architectures are referred to as heterogeneous multiview data. Most existing unsupervised transfer learni…
Representation LearningTransfer LearningGraph LearningDouble Graphs Regularized Multi-view Subspace Clustering
Recent years have witnessed a growing academic interest in multi-view subspace clustering. In this paper, we propose a novel Double Graphs Regularized Multi-view Subspace Clustering (DGRMSC) method, which aims to harness…
ClusteringMulti-view Subspace ClusteringMerging by Matching Models in Task Parameter Subspaces
Model merging aims to cheaply combine individual task-specific models into a single multitask model. In this work, we view past merging methods as leveraging different notions of a ''task parameter subspace'' in which mo…
Fine-grained Graph Learning for Multi-view Subspace Clustering
Multi-view subspace clustering (MSC) is a popular unsupervised method by integrating heterogeneous information to reveal the intrinsic clustering structure hidden across views. Usually, MSC methods use graphs (or affinit…
ClusteringGraph LearningMulti-view Subspace Clustering