Fine-grained Graph Learning for Multi-view Subspace Clustering
- URL: http://arxiv.org/abs/2201.04604v4
- Date: Sun, 13 Aug 2023 14:29:00 GMT
- Title: Fine-grained Graph Learning for Multi-view Subspace Clustering
- Authors: Yidi Wang, Xiaobing Pei, Haoxi Zhan
- Abstract summary: We propose a fine-grained graph learning framework for multi-view subspace clustering (FGL-MSC)
The main challenge is how to optimize the fine-grained fusion weights while generating the learned graph that fits the clustering task.
Experiments on eight real-world datasets show that the proposed framework has comparable performance to the state-of-the-art methods.
- Score: 2.4094285826152593
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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 affinity
matrices) fusion to learn a common structure, and further apply graph-based
approaches to clustering. Despite progress, most of the methods do not
establish the connection between graph learning and clustering. Meanwhile,
conventional graph fusion strategies assign coarse-grained weights to combine
multi-graph, ignoring the importance of local structure. In this paper, we
propose a fine-grained graph learning framework for multi-view subspace
clustering (FGL-MSC) to address these issues. To utilize the multi-view
information sufficiently, we design a specific graph learning method by
introducing graph regularization and a local structure fusion pattern. The main
challenge is how to optimize the fine-grained fusion weights while generating
the learned graph that fits the clustering task, thus making the clustering
representation meaningful and competitive. Accordingly, an iterative algorithm
is proposed to solve the above joint optimization problem, which obtains the
learned graph, the clustering representation, and the fusion weights
simultaneously. Extensive experiments on eight real-world datasets show that
the proposed framework has comparable performance to the state-of-the-art
methods. The source code of the proposed method is available at
https://github.com/siriuslay/FGL-MSC.
Related papers
- Efficient Multi-View Graph Clustering with Local and Global Structure
Preservation [59.49018175496533]
We propose a novel anchor-based multi-view graph clustering framework termed Efficient Multi-View Graph Clustering with Local and Global Structure Preservation (EMVGC-LG)
Specifically, EMVGC-LG jointly optimize anchor construction and graph learning to enhance the clustering quality.
In addition, EMVGC-LG inherits the linear complexity of existing AMVGC methods respecting the sample number.
arXiv Detail & Related papers (2023-08-31T12:12:30Z) - Reinforcement Graph Clustering with Unknown Cluster Number [91.4861135742095]
We propose a new deep graph clustering method termed Reinforcement Graph Clustering.
In our proposed method, cluster number determination and unsupervised representation learning are unified into a uniform framework.
In order to conduct feedback actions, the clustering-oriented reward function is proposed to enhance the cohesion of the same clusters and separate the different clusters.
arXiv Detail & Related papers (2023-08-13T18:12:28Z) - Deep Temporal Graph Clustering [77.02070768950145]
We propose a general framework for deep Temporal Graph Clustering (GC)
GC introduces deep clustering techniques to suit the interaction sequence-based batch-processing pattern of temporal graphs.
Our framework can effectively improve the performance of existing temporal graph learning methods.
arXiv Detail & Related papers (2023-05-18T06:17:50Z) - ClusterFuG: Clustering Fully connected Graphs by Multicut [20.254912065749956]
In dense multicut, the clustering objective is given in a factorized form as inner products of node feature vectors.
We show how to rewrite classical greedy algorithms for multicut in our dense setting and how to modify them for greater efficiency and solution quality.
arXiv Detail & Related papers (2023-01-28T11:10:50Z) - Effective and Efficient Graph Learning for Multi-view Clustering [173.8313827799077]
We propose an effective and efficient graph learning model for multi-view clustering.
Our method exploits the view-similar between graphs of different views by the minimization of tensor Schatten p-norm.
Our proposed algorithm is time-economical and obtains the stable results and scales well with the data size.
arXiv Detail & Related papers (2021-08-15T13:14:28Z) - Multiple Graph Learning for Scalable Multi-view Clustering [26.846642220480863]
We propose an efficient multiple graph learning model via a small number of anchor points and tensor Schatten p-norm minimization.
Specifically, we construct a hidden and tractable large graph by anchor graph for each view.
We develop an efficient algorithm, which scales linearly with the data size, to solve our proposed model.
arXiv Detail & Related papers (2021-06-29T13:10:56Z) - Spatial-Spectral Clustering with Anchor Graph for Hyperspectral Image [88.60285937702304]
This paper proposes a novel unsupervised approach called spatial-spectral clustering with anchor graph (SSCAG) for HSI data clustering.
The proposed SSCAG is competitive against the state-of-the-art approaches.
arXiv Detail & Related papers (2021-04-24T08:09:27Z) - Structured Graph Learning for Scalable Subspace Clustering: From
Single-view to Multi-view [28.779909990410978]
Graph-based subspace clustering methods have exhibited promising performance.
They still suffer some of these drawbacks: encounter the expensive time overhead, fail in exploring the explicit clusters, and cannot generalize to unseen data points.
We propose a scalable graph learning framework, seeking to address the above three challenges simultaneously.
arXiv Detail & Related papers (2021-02-16T03:46:11Z) - Learning Multi-layer Graphs and a Common Representation for Clustering [13.90938823562779]
We focus on graph learning from multi-view data of shared entities for spectral clustering.
We propose an efficient solver based on alternating minimization to solve the problem.
Numerical experiments on synthetic and real datasets demonstrate that the proposed algorithm outperforms state-of-the-art multi-view clustering techniques.
arXiv Detail & Related papers (2020-10-23T11:12:43Z) - Structured Graph Learning for Clustering and Semi-supervised
Classification [74.35376212789132]
We propose a graph learning framework to preserve both the local and global structure of data.
Our method uses the self-expressiveness of samples to capture the global structure and adaptive neighbor approach to respect the local structure.
Our model is equivalent to a combination of kernel k-means and k-means methods under certain condition.
arXiv Detail & Related papers (2020-08-31T08:41:20Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.