A hybrid approach for text clustering

This paper deals with automatic clustering algorithm, which partitions a many of objects to get smaller sets (clusters). Where objects of the one set are related to each other rather than to those in the other sets. The number of clusters in automatic clustering don’t given priori, they determinates...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Materials today : proceedings Ročník 80; s. 2584 - 2589
Hlavní autoři:	Ajmi Al-Shuwaili, Saad O., Obied Redywi, Sadiq, Naser, Mustafa A.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 2023
Témata:	Clustering CURE clustering algorithm Hierarchical clustering algorithm K-means algorithm Partitioning clustering algorithm Proposed clustering algorithm CURE clustering algorithm Partitioning clustering algorithm K-means algorithm Clustering Proposed clustering algorithm Hierarchical clustering algorithm
ISSN:	2214-7853, 2214-7853
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!

Popis
Shrnutí:	This paper deals with automatic clustering algorithm, which partitions a many of objects to get smaller sets (clusters). Where objects of the one set are related to each other rather than to those in the other sets. The number of clusters in automatic clustering don’t given priori, they determinates automatically, the number resulted of clusters exact closed to the numbers of the real dataset structure. This paper represents a stimulus for the current study to introduce an algorithm that automatically finds the number of clusters based on distance among vertices. The study is based on the hypothesis that the proposed algorithm is able to efficiently find the clustering partitions for the whole dataset.
ISSN:	2214-7853 2214-7853
DOI:	10.1016/j.matpr.2021.06.415