PulseExploreJournal ClubResearchersJournals
Instagram
HomeJournal ClubExplore
Synapse
⌘+K
Synapse
September 30, 2025Journal of Computing and Electronic Information ManagementOpen Access

Entropy-Constrained and Sparse Relation-Constrained Subspace Clustering

View Full Paper
Ask AI
Bookmark
Share

Authors

YWYangmeng WangHCHaoming ChenPZPeng Zhang

Discussion

Loading...

Member takes

Overview

Novel entropy-weighted clustering enhances accuracy and robustness in high-dimensional datasets, indicating its potential in noisy environments.

Key Points

  • The proposed method enhances clustering accuracy and robustness by integrating information entropy and sparse representation.
  • Key improvements include an entropy weight matrix and Frobenius norm constraints for better computational efficiency.
  • Experiments showed that ECSSC outperforms traditional methods with significant gains in accuracy metrics like NMI and ARI.
  • Ablation studies confirm the entropy-weighting module enhances performance by 10%–18% across various datasets.

Cite This Study

Wang et al. (2025) studied this question.

synapsesocial.com/papers/68dc26268a7d58c25ebb3213https://doi.org/10.54097/54czr459
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Sparse subspace clustering2009 · 1,292 citations
  2. 2Subspace Clustering via Structured Sparse Relation Representation2021 · 44 citations
  3. 3Structured Sparse Subspace Clustering: A unified optimization framework2015 · 195 citations
  4. 4Spectral Curvature Clustering (SCC)2008 · 376 citations