Metraipolis › archive › dc_c082c3ad7a4e

A Generalized Sparse Fuzzy Clustering Framework with Automated Cluster Cardinality Estimation Ability — arXiv:2611.00159

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00159
License (as archived)
CC0-1.0
Archived
2026-11-03T18:11:47.399Z
SHA-256 of the archived text
0d7e85094245d0c0a7b5a50591fe3cebf6b365641006e923b614f3cee8162a4b
Stable URL of this page
https://metraipolis.com/documento/dc_c082c3ad7a4e

How to cite

A Generalized Sparse Fuzzy Clustering Framework with Automated Cluster Cardinality Estimation Ability — arXiv:2611.00159 — arXiv (en), https://arxiv.org/abs/2611.00159 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c082c3ad7a4e (Metraipolis archive dc_c082c3ad7a4e, sha256 0d7e85094245d0c0a7b5a50591fe3cebf6b365641006e923b614f3cee8162a4b)
BibTeX
@misc{dcc082c3ad7a4e,
  title = {A Generalized Sparse Fuzzy Clustering Framework with Automated Cluster Cardinality Estimation Ability — arXiv:2611.00159},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00159},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c082c3ad7a4e; sha256 0d7e85094245d0c0a7b5a50591fe3cebf6b365641006e923b614f3cee8162a4b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00159. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Fuzzy clustering provides a robust framework for handling ambiguous and overlapping data boundaries, yet its traditional formulation generates entirely dense membership assignments that limit noise resilience and prevent estimating the true number of clusters, when it is unknown. To address these limitations, we introduce in this paper the Generalized Sparse Fuzzy Clustering (GSFC) framework, which incorporates a continuous sparsity penalty into the fuzzy objective function. Because closed-form solutions are precluded by the simultaneous presence of fuzzifier and sparsity exponents, we propose an efficient primal-dual bisection search coupled with specialized analytic pathways to rigorously enforce the partition constraint while organically driving trace memberships to exact zero. This mathematically enforced sparsity empowers the algorithm to autonomously estimate the true number of clusters by dynamically pruning redundant clusters, provided that it is initialized by a larger than the true number of clusters. Furthermore, we integrate a virtual noise sink to insulate outliers from the rest of the data points. The usage of the proposed framework is also extended to line segment detection. Extensive empirical evaluations across synthetic toy datasets, high-noise geometric stress tests, and real-world benchmarks (UCI wine dataset and hyperspectral images) demonstrate that GSFC effectively exceeds conventional fuzzy benchmarks while autonomously resolving cluster cardinality. Additionally, it significantly outperforms existing sparse possibilistic and probabilistic soft-clustering alternatives in line detection tasks.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2611.00159 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:09:53.256Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).