An effective clustering scheme for high-dimensional data

While the classical K -means algorithm has been widely used in many fields, it still has some defects. Therefore, this paper proposes a scheme to improve the clustering quality of K -means algorithm. The farthest initial center selection and the min–max rule are used to improve the random initializa...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Multimedia tools and applications Ročník 83; číslo 15; s. 45001 - 45045
Hlavní autori:	He, Xuansen, He, Fan, Fan, Yueping, Jiang, Lingmin, Liu, Runzong, Maalla, Allam
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.05.2024 Springer Nature B.V
Predmet:	Algorithms Cluster analysis Clustering Computer Communication Networks Computer Science Data Structures and Information Theory Datasets Discriminant analysis Empirical analysis Multimedia Information Systems Normal distribution Special Purpose and Application-Based Systems Linear discriminant analysis Silhouette analysis Clustering validity function Initial center selection Empirical rule means algorithm
ISSN:	1573-7721, 1380-7501, 1573-7721
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!