Sparsity-Aware Possibilistic Clustering Algorithms

In this paper, two novel possibilistic clustering algorithms are presented, which utilize the concept of sparsity. The first one, called sparse possibilistic c-means, exploits sparsity and can deal well with closely located clusters that may also be of significantly different densities. The second o...

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE transactions on fuzzy systems Ročník 24; číslo 6; s. 1611 - 1626
Hlavní autoři:	Xenaki, Spyridoula D., Koutroumbas, Konstantinos D., Rontogiannis, Athanasios A.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.12.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Adaptivity Algorithms Clustering Clustering algorithms Convergence Cost function Estimation Europe Noise measurement Phase change materials possibilistic clustering Sparsity
ISSN:	1063-6706, 1941-0034
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!