Multi-View Spectral Clustering for Graphs with Multiple View Structures

• URL: http://arxiv.org/abs/2501.11422v2
• Date: Tue, 28 Jan 2025 14:43:45 GMT
• Title: Multi-View Spectral Clustering for Graphs with Multiple View Structures
• Authors: Yorgos Tsitsikas, Evangelos E. Papalexakis,
• Abstract summary: We present a general clustering framework that subsumes a series of seemingly disparate clustering methods. In turn, we propose GenClus: a method that is simultaneously an instance of this framework and a generalization of spectral clustering.
• Score: 3.7478782183628634
• License:
• Abstract: Despite the fundamental importance of clustering, to this day, much of the relevant research is still based on ambiguous foundations, leading to an unclear understanding of whether or how the various clustering methods are connected with each other. In this work, we provide an additional stepping stone towards resolving such ambiguities by presenting a general clustering framework that subsumes a series of seemingly disparate clustering methods, including various methods belonging to the widely popular spectral clustering framework. In fact, the generality of the proposed framework is additionally capable of shedding light to the largely unexplored area of multi-view graphs where each view may have differently clustered nodes. In turn, we propose GenClus: a method that is simultaneously an instance of this framework and a generalization of spectral clustering, while also being closely related to k-means as well. This results in a principled alternative to the few existing methods studying this special type of multi-view graphs. Then, we conduct in-depth experiments, which demonstrate that GenClus is more computationally efficient than existing methods, while also attaining similar or better clustering performance. Lastly, a qualitative real-world case-study further demonstrates the ability of GenClus to produce meaningful clusterings.

Related papers

• A Comprehensive Survey on Spectral Clustering with Graph Structure Learning [10.579153358536372]
  Spectral clustering is a powerful technique for clustering high-dimensional data. We explore various graph clustering techniques, including pairwise, anchor, and hypergraph-based methods. We discuss multi-view clustering frameworks, examining their applications within one-step and two-step clustering processes.
  arXiv  Detail & Related papers  (2025-01-23T12:06:32Z)
• Revisiting Self-Supervised Heterogeneous Graph Learning from Spectral Clustering Perspective [52.662463893268225]
  Self-supervised heterogeneous graph learning (SHGL) has shown promising potential in diverse scenarios. Existing SHGL methods encounter two significant limitations. We introduce a novel framework enhanced by rank and dual consistency constraints.
  arXiv  Detail & Related papers  (2024-12-01T09:33:20Z)
• Interpretable Multi-View Clustering [8.221659822719817]
  In this paper, we introduce an interpretable multi-view clustering framework. Experimental results on real datasets demonstrate that our method delivers performance comparable to state-of-the-art clustering methods.
  arXiv  Detail & Related papers  (2024-05-04T11:56:24Z)
• Spectral Clustering in Convex and Constrained Settings [0.0]
  We introduce a novel framework for seamlessly integrating pairwise constraints into semidefinite spectral clustering. Our methodology systematically extends the capabilities of semidefinite spectral clustering to capture complex data structures.
  arXiv  Detail & Related papers  (2024-04-03T18:50:14Z)
• CDIMC-net: Cognitive Deep Incomplete Multi-view Clustering Network [53.72046586512026]
  We propose a novel incomplete multi-view clustering network, called Cognitive Deep Incomplete Multi-view Clustering Network (CDIMC-net) It captures the high-level features and local structure of each view by incorporating the view-specific deep encoders and graph embedding strategy into a framework. Based on the human cognition, i.e., learning from easy to hard, it introduces a self-paced strategy to select the most confident samples for model training.
  arXiv  Detail & Related papers  (2024-03-28T15:45:03Z)
• Deep Clustering With Consensus Representations [10.058084837348366]
  We introduce the idea of learning consensus representations for heterogeneous clusterings, a novel notion to approach consensus clustering. We propose DECCS, the first deep clustering method that jointly improves the representation and clustering results of multiple heterogeneous clustering algorithms.
  arXiv  Detail & Related papers  (2022-10-13T14:40:48Z)
• Deep Clustering: A Comprehensive Survey [53.387957674512585]
  Clustering analysis plays an indispensable role in machine learning and data mining. Deep clustering, which can learn clustering-friendly representations using deep neural networks, has been broadly applied in a wide range of clustering tasks. Existing surveys for deep clustering mainly focus on the single-view fields and the network architectures, ignoring the complex application scenarios of clustering.
  arXiv  Detail & Related papers  (2022-10-09T02:31:32Z)
• Graph Contrastive Clustering [131.67881457114316]
  We propose a novel graph contrastive learning framework, which is then applied to the clustering task and we come up with the Graph Constrastive Clustering(GCC) method. Specifically, on the one hand, the graph Laplacian based contrastive loss is proposed to learn more discriminative and clustering-friendly features. On the other hand, a novel graph-based contrastive learning strategy is proposed to learn more compact clustering assignments.
  arXiv  Detail & Related papers  (2021-04-03T15:32:49Z)
• Scalable Hierarchical Agglomerative Clustering [65.66407726145619]
  Existing scalable hierarchical clustering methods sacrifice quality for speed. We present a scalable, agglomerative method for hierarchical clustering that does not sacrifice quality and scales to billions of data points.
  arXiv  Detail & Related papers  (2020-10-22T15:58:35Z)
• Unsupervised Multi-view Clustering by Squeezing Hybrid Knowledge from Cross View and Each View [68.88732535086338]
  This paper proposes a new multi-view clustering method, low-rank subspace multi-view clustering based on adaptive graph regularization. Experimental results for five widely used multi-view benchmarks show that our proposed algorithm surpasses other state-of-the-art methods by a clear margin.
  arXiv  Detail & Related papers  (2020-08-23T08:25:06Z)
• Toward Generalized Clustering through an One-Dimensional Approach [0.8122270502556374]
  An approach for detecting patches of separation between clusters is developed based on an agglomerative clustering, more specifically the single-linkage. The potential of this method is illustrated with respect to the analyses of clusterless uniform and normal distributions of points, as well as a one-dimensional clustering model characterized by two intervals with high density of points separated by a less dense interstice.
  arXiv  Detail & Related papers  (2020-01-01T16:52:05Z)

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.