• Home
  • Search
  • Large-Scale Subspace Clustering by Independent Distributed and Parallel Coding.
  • Cite Icon19
  • https://doi.org/10.1109/tcyb.2021.3052056Copy DOI Icon

Large-Scale Subspace Clustering by Independent Distributed and Parallel Coding.

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Subspace clustering is a popular method to discover underlying low-dimensional structures of high-dimensional multimedia data (e.g., images, videos, and texts). In this article, we consider a large-scale subspace clustering (LS2C) problem, that is, partitioning million data points with a millon dimensions. To address this, we explore an independent distributed and parallel framework by dividing big data/variable matrices and regularization by both columns and rows. Specifically, LS2C is independently decomposed into many subproblems by distributing those matrices into different machines by columns since the regularization of the code matrix is equal to a sum of that of its submatrices (e.g., square-of-Frobenius/ l1 -norm). Consensus optimization is designed to solve these subproblems in a parallel way for saving communication costs. Moreover, we provide theoretical guarantees that LS2C can recover consensus subspace representations of high-dimensional data points under broad conditions. Compared with the state-of-the-art LS2C methods, our approach achieves better clustering results in public datasets, including a million images and videos.

Similar Papers
  • Conference Article
  • Citations63

Robust Subspace Clustering via Half-Quadratic Minimization

  • Dec 01, 2013
  • Yingya Zhang +3
  • Research Article
  • Citations45

Subspace clustering based on latent low rank representation with Frobenius norm minimization

  • Nov 16, 2017
  • Neurocomputing
  • Song Yu +1
  • Conference Article

An Efficient Approach to Higher Dimensional Data Clustering

  • Dec 01, 2007
  • C Palanisamy +1
  • Research Article
  • Citations13

Fusion of evolvable genome structure and multi-objective optimization for subspace clustering

  • May 31, 2019
  • Pattern Recognition
  • Dipanjyoti Paul +2
  • Research Article
  • Citations31

Self-organizing subspace clustering for high-dimensional and multi-view data

  • Jul 03, 2020
  • Neural Networks
  • Aluizio F.R Araújo +2
  • Conference Article
  • Citations25

Overcomplete Deep Subspace Clustering Networks

  • Jan 01, 2021
  • Jeya Maria Jose Valanarasu +1
  • Conference Article

Sparse-Dense Subspace Clustering

  • Jan 10, 2021
  • Shuai Yang +2
  • Conference Article
  • Citations1

Local Convex Representation with Pruning for Manifold Clustering

  • Dec 01, 2019
  • Tao Yang +1
  • Book Chapter

Soft Subspace Clustering for High-Dimensional Data

  • Jan 01, 2009
  • Liping Jing +2
  • Conference Article
  • Citations2

SSSC-AM: A unified framework for video co-segmentation by structured sparse subspace clustering with appearance and motion features

  • Sep 01, 2016
  • Junlin Yao +1
  • Conference Article
  • Citations10

VAGA: Towards Accurate and Interpretable Outlier Detection Based on Variational Auto-Encoder and Genetic Algorithm for High-Dimensional Data

  • Dec 15, 2021
  • Jiamu Li +6
  • Book Chapter
  • Citations2

Clustering of High Dimensional Handwritten Data by an Improved Hypergraph Partition Method

  • Jan 01, 2017
  • Tian Wang +2
  • Research Article
  • Citations64

Sequential projection pursuit using genetic algorithms for data mining of analytical data.

  • May 23, 2000
  • Analytical Chemistry
  • Q Guo +5
  • Research Article
  • Citations1144

Clustering high-dimensional data

  • Mar 01, 2009
  • ACM Transactions on Knowledge Discovery from Data
  • Hans-Peter Kriegel +2
  • Book Chapter
  • Citations2

Data Complexity in Clustering Analysis of Gene Microarray Expression Profiles

  • Jan 01, 2006
  • Feng Luo +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.