Multilayer Graph Approach to Deep Subspace Clustering

• URL: http://arxiv.org/abs/2401.17033v1
• Date: Tue, 30 Jan 2024 14:09:41 GMT
• Title: Multilayer Graph Approach to Deep Subspace Clustering
• Authors: Lovro Sindi\v{c}i\'c, Ivica Kopriva
• Abstract summary: Deep subspace clustering (DSC) networks based on self-expressive model learn representation matrix, often implemented in terms of fully connected network. Here, we apply selected linear subspace clustering algorithm to learn representation from representations learned by all layers of encoder network including the input data. We validate proposed approach on four well-known datasets with two DSC networks as baseline models.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Deep subspace clustering (DSC) networks based on self-expressive model learn representation matrix, often implemented in terms of fully connected network, in the embedded space. After the learning is finished, representation matrix is used by spectral clustering module to assign labels to clusters. However, such approach ignores complementary information that exist in other layers of the encoder (including the input data themselves). Herein, we apply selected linear subspace clustering algorithm to learn representation matrices from representations learned by all layers of encoder network including the input data. Afterward, we learn a multilayer graph that in a multi-view like manner integrates information from graph Laplacians of all used layers. That improves further performance of selected DSC network. Furthermore, we also provide formulation of our approach to cluster out-of-sample/test data points. We validate proposed approach on four well-known datasets with two DSC networks as baseline models. In almost all the cases, proposed approach achieved statistically significant improvement in three performance metrics. MATLAB code of proposed algorithm is posted on https://github.com/lovro-sinda/MLG-DSC.

Related papers

• Clustering based Point Cloud Representation Learning for 3D Analysis [80.88995099442374]
  We propose a clustering based supervised learning scheme for point cloud analysis. Unlike current de-facto, scene-wise training paradigm, our algorithm conducts within-class clustering on the point embedding space. Our algorithm shows notable improvements on famous point cloud segmentation datasets.
  arXiv  Detail & Related papers  (2023-07-27T03:42:12Z)
• A network community detection method with integration of data from multiple layers and node attributes [0.0]
  We suggest a simple way of representing network data in a data matrix where rows correspond to the nodes, and columns correspond to the data items. For compressing a data matrix, we suggest to extend so called regular decomposition method for non-square matrices. We illustrate our method with synthetic power-law graphs and two real networks: an Internet autonomous systems graph and a world airline graph.
  arXiv  Detail & Related papers  (2023-05-22T13:15:36Z)
• Deep Multi-View Subspace Clustering with Anchor Graph [11.291831842959926]
  We propose a novel deep multi-view subspace clustering method with anchor graph (DMCAG) DMCAG learns the embedded features for each view independently, which are used to obtain the subspace representations. Our method achieves superior clustering performance over other state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-05-11T16:17:43Z)
• DeepCluE: Enhanced Image Clustering via Multi-layer Ensembles in Deep Neural Networks [53.88811980967342]
  This paper presents a Deep Clustering via Ensembles (DeepCluE) approach. It bridges the gap between deep clustering and ensemble clustering by harnessing the power of multiple layers in deep neural networks. Experimental results on six image datasets confirm the advantages of DeepCluE over the state-of-the-art deep clustering approaches.
  arXiv  Detail & Related papers  (2022-06-01T09:51:38Z)
• DRBM-ClustNet: A Deep Restricted Boltzmann-Kohonen Architecture for Data Clustering [0.0]
  A Bayesian Deep Restricted Boltzmann-Kohonen architecture for data clustering termed as DRBM-ClustNet is proposed. The processing of unlabeled data is done in three stages for efficient clustering of the non-linearly separable datasets. The framework is evaluated based on clustering accuracy and ranked against other state-of-the-art clustering methods.
  arXiv  Detail & Related papers  (2022-05-13T15:12:18Z)
• Attention-driven Graph Clustering Network [49.040136530379094]
  We propose a novel deep clustering method named Attention-driven Graph Clustering Network (AGCN) AGCN exploits a heterogeneous-wise fusion module to dynamically fuse the node attribute feature and the topological graph feature. AGCN can jointly perform feature learning and cluster assignment in an unsupervised fashion.
  arXiv  Detail & Related papers  (2021-08-12T02:30:38Z)
• Learning Hierarchical Graph Neural Networks for Image Clustering [81.5841862489509]
  We propose a hierarchical graph neural network (GNN) model that learns how to cluster a set of images into an unknown number of identities. Our hierarchical GNN uses a novel approach to merge connected components predicted at each level of the hierarchy to form a new graph at the next level.
  arXiv  Detail & Related papers  (2021-07-03T01:28:42Z)
• Overcomplete Deep Subspace Clustering Networks [80.16644725886968]
  Experimental results on four benchmark datasets show the effectiveness of the proposed method over DSC and other clustering methods in terms of clustering error. Our method is also not as dependent as DSC is on where pre-training should be stopped to get the best performance and is also more robust to noise.
  arXiv  Detail & Related papers  (2020-11-16T22:07:18Z)
• Multi-view Subspace Clustering Networks with Local and Global Graph Information [19.64977233324484]
  The goal of this study is to explore the underlying grouping structure of data collected from different fields or measurements. We propose the novel multi-view subspace clustering networks with local and global graph information, termed MSCNLG. As an end-to-end trainable framework, the proposed method fully investigates the valuable information of multiple views.
  arXiv  Detail & Related papers  (2020-10-19T09:00:19Z)
• AutoEmbedder: A semi-supervised DNN embedding system for clustering [0.0]
  This paper introduces a novel embedding system named AutoEmbedder, that downsamples higher dimensional data to clusterable embedding points. The training process is semi-supervised and uses Siamese network architecture to compute pairwise constraint loss in the feature learning phase.
  arXiv  Detail & Related papers  (2020-07-11T19:00:45Z)
• Multi-view Deep Subspace Clustering Networks [64.29227045376359]
  Multi-view subspace clustering aims to discover the inherent structure of data by fusing multiple views of complementary information. We propose the Multi-view Deep Subspace Clustering Networks (MvDSCN), which learns a multi-view self-representation matrix in an end-to-end manner. The MvDSCN unifies multiple backbones to boost clustering performance and avoid the need for model selection.
  arXiv  Detail & Related papers  (2019-08-06T06:44:43Z)

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.