• Home
  • Search
  • Density Connected Clustering with Local Subspace Preferences
  • Open Access IconOpen Access
  • Cite Icon169
  • https://doi.org/10.1109/icdm.2004.10087Copy DOI Icon

Density Connected Clustering with Local Subspace Preferences

  • Nov 1, 2004
  • C Bohm +3 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Many clustering algorithms tend to break down in high-dimensional feature spaces, because the clusters often exist only in specific subspaces (attribute subsets) of the original feature space. Therefore, the task of projected clustering (or subspace clustering) has been defined recently. As a solution to tackle this problem, we propose the concept of local subspace preferences, which captures the main directions of high point density. Using this concept, we adopt density-based clustering to cope with high-dimensional data. In particular, we achieve the following advantages over existing approaches: Our proposed method has a determinate result, does not depend on the order of processing, is robust against noise, performs only one single scan over the database, and is linear in the number of dimensions. A broad experimental evaluation shows that our approach yields results of significantly better quality than recent work on clustering high-dimensional data.

Similar Papers
  • Book Chapter
  • Citations2

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

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

Clustering High-Dimensional Stock Data using Data Mining Approach

  • Jul 01, 2019
  • Dhea Indriyanti +1
  • Book Chapter

Kernel Oblique Subspace Projection Approach for Target Detection in Hyperspectral Imagery

  • Jan 01, 2010
  • Liaoying Zhao +2
  • Conference Article

Frequent patterns-based subspace clustering

  • Aug 01, 2010
  • Yue Jiang +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
  • Book Chapter
  • Citations9

Pairwise Constrained Clustering for Sparse and High Dimensional Feature Spaces

  • Jan 01, 2009
  • Su Yan +3
  • Conference Article
  • Citations20

A Kernel-Based Fuzzy Clustering Algorithm

  • Aug 30, 2006
  • Jiun-Hau Wang +2
  • Conference Article

Direct Orthogonal Discriminant Analysis

  • Oct 01, 2008
  • Yue Lin +3
  • Conference Article

Boundary Compactness for Data of 3D or Higher Dimensions

  • Nov 01, 2012
  • Yuqing Song +1
  • Research Article
  • Citations1

Adversarial Example Generation Based on Particle Swarm Optimization

  • Jul 01, 2019
  • 电子与信息学报
  • Qian Yaguan +7
  • Conference Article
  • Citations1

Retracted: Urban Vegetation Type Analysis Method Based on High Resolution Satellite Images

  • Nov 01, 2016
  • Zhilin Pan
  • Book Chapter

Mining Subspace Clusters from Distributed Data

  • Jan 01, 2009
  • Haiyun Bian +1
  • Conference Article
  • Citations13

A kernel-based compressed sensing approach to dynamic MRI from highly undersampled data

  • Apr 01, 2013
  • Yihang Zhou +2
  • Research Article
  • Citations9

Projection subspace clustering

  • May 02, 2017
  • Journal of Algorithms & Computational Technology
  • Xiaoyun Chen +2
  • Research Article

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

  • Jan 01, 2021
  • IEEE Access
  • Wei Yang +5
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.