• Cite Icon1144
  • https://doi.org/10.1145/1497577.1497578Copy DOI Icon

Clustering high-dimensional data

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

As a prolific research area in data mining, subspace clustering and related problems induced a vast quantity of proposed solutions. However, many publications compare a new proposition—if at all—with one or two competitors, or even with a so-called “naïve” ad hoc solution, but fail to clarify the exact problem definition. As a consequence, even if two solutions are thoroughly compared experimentally, it will often remain unclear whether both solutions tackle the same problem or, if they do, whether they agree in certain tacit assumptions and how such assumptions may influence the outcome of an algorithm. In this survey, we try to clarify: (i) the different problem definitions related to subspace clustering in general; (ii) the specific difficulties encountered in this field of research; (iii) the varying assumptions, heuristics, and intuitions forming the basis of different approaches; and (iv) how several prominent solutions tackle different problems.

Similar Papers
  • 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
  • Research Article
  • Citations45

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

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

Frequent patterns-based subspace clustering

  • Aug 01, 2010
  • Yue Jiang +2
  • Conference Article
  • Citations2

Clustering High-Dimensional Stock Data using Data Mining Approach

  • Jul 01, 2019
  • Dhea Indriyanti +1
  • Research Article
  • Citations687

Automatic subspace clustering of high dimensional data for data mining applications

  • Jun 01, 1998
  • ACM SIGMOD Record
  • Rakesh Agrawal +3
  • Book Chapter
  • Citations2

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

  • Jan 01, 2017
  • Tian Wang +2
  • Conference Article
  • Citations25

Overcomplete Deep Subspace Clustering Networks

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

An Improved Algorithm for Subspace Clustering Applied to Image Segmentation

  • Jul 01, 2012
  • Amel Boulemnadjel +1
  • Conference Article
  • Citations169

Density Connected Clustering with Local Subspace Preferences

  • Nov 01, 2004
  • C Bohm +3
  • Research Article
  • Citations19

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

  • Sep 01, 2022
  • IEEE Transactions on Cybernetics
  • Jun Li +4
  • Research Article
  • Citations13

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

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

An Efficient Approach to Higher Dimensional Data Clustering

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

MVTLR-HCFS: Density Peak Algorithm Based on Multi-View and Tensor Low Rank Expression

  • Jan 01, 2021
  • IEEE Access
  • Wei Yang +5
  • 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
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.