Spectral embedded generalized mean based k-nearest neighbors clustering with S-distance

The spectral clustering algorithm is extensively employed in different aspects, especially in the field of pattern recognition. However, the efficient construction of the neighborhood graph is the main reason for its promising results. Generally, the similarity matrix relies on the applied similarit...

Celý popis

Podrobná bibliografie

Vydáno v:	Expert systems with applications Ročník 169; s. 114326
Hlavní autoři:	Sharma, Krishna Kumar, Seal, Ayan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.05.2021
Témata:	Distributed computing Generalized mean S-distance Spectral clustering Symmetry favored k-nearest neighbors Spectral clustering Symmetry favored k-nearest neighbors Distributed computing Generalized mean S-distance
ISSN:	0957-4174, 1873-6793
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!