• Home
  • Search
  • Impact Parameter Analysis of Subspace Clustering
  • Open Access IconOpen Access
  • Cite Icon4
  • https://doi.org/10.1155/2015/398452Copy DOI Icon

Impact Parameter Analysis of Subspace Clustering

Show More
  • Abstract
  • Highlights & Summary
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Subspace clustering, which detects all clusters in affine subspaces of a given high dimensional vector space, is used in various applications, including e-business. The performance and result of a subspace clustering algorithm highly depend on the parameter values the algorithm is tuned to execute. It may not be clear if the resultant clusters are indeed meaningful ones in a given dataset or if the result is just an artifact of the given parameter values. Although choosing the proper parameter values is crucial for both clustering quality and performance of the algorithm, there has been little research or discussion on this topic. In this paper, we propose a methodology for determining proper values of parameters in subspace clustering. Along with it, we validate our approach through experimental analysis, using various real-world datasets. The study can serve as a reference model for any subspace clustering experiment in which parameter setting is required to output clusters of quality.

Loading PDF

Similar Papers
  • Research Article
  • Citations1

Summarisation of subspace clusters based on similarity connectedness

  • Jan 01, 2018
  • International Journal of Data Science
  • B Jaya Lakshmi +2
  • Research Article
  • Citations3

Self-Adaptive and Adaptive Parameter Control in Improved Artificial Bee Colony Algorithm

  • Jan 01, 2017
  • Informatica
  • Bekir Afşar +3
  • Research Article
  • Citations9

Projection subspace clustering

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

Nonlinear subspace clustering by functional link neural networks

  • Oct 05, 2024
  • Applied Soft Computing
  • Long Shi +4
  • Research Article
  • Citations13

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

  • May 31, 2019
  • Pattern Recognition
  • Dipanjyoti Paul +2
  • Book Chapter

Mining Subspace Clusters from Distributed Data

  • Jan 01, 2009
  • Haiyun Bian +1
  • Research Article
  • Citations129

An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem

  • Oct 27, 2009
  • Applied Mathematics and Computation
  • M Fatih Tasgetiren +2
  • Research Article
  • Citations24

Autoencoder-Based Latent Block-Diagonal Representation for Subspace Clustering.

  • Jun 01, 2022
  • IEEE Transactions on Cybernetics
  • Yesong Xu +4
  • Conference Article

Effective dimensionality reduction in multimedia applications

  • Mar 01, 2009
  • Seungdo Jeong +3
  • Conference Article

Multi-view Subspace Clustering with Complex Noise Modeling

  • Jan 06, 2023
  • Xiangyu Lu +2
  • Research Article
  • Citations45

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

  • Nov 16, 2017
  • Neurocomputing
  • Song Yu +1
  • Book Chapter

Kernel-induced vector spaces

  • Jan 01, 2009
  • Sun Yuan Kung
  • Research Article
  • Citations74

Graph Regularized Residual Subspace Clustering Network for hyperspectral image clustering

  • Jul 10, 2021
  • Information Sciences
  • Yaoming Cai +4
  • Research Article
  • Citations7

What's wrong with high-dimensional similarity search?

  • Aug 01, 2008
  • Proceedings of the VLDB Endowment
  • Stephen Blott +1
  • Conference Article
  • Citations32

Finding Clusters in subspaces of very large, multi-dimensional datasets

  • Jan 01, 2010
  • Robson L F Cordeiro +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.