2019
DOI: 10.1142/s0218488519500090
|View full text |Cite
|
Sign up to set email alerts
|

Particle Grey Wolf Optimizer (PGWO) Algorithm and Semantic Word Processing for Automatic Text Clustering

Abstract: Text mining refers to the process of extracting the high-quality information from the text. It is broadly used in applications, like text clustering, text categorization, text classification, etc. Recently, the text clustering becomes the facilitating and challenging task used to group the text document. Due to some irrelevant terms and large dimension, the accuracy of text clustering is reduced. In this paper, the semantic word processing and novel Particle Grey Wolf Optimizer (PGWO) is proposed for automatic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 31 publications
0
2
0
Order By: Relevance
“…The accuracy of text clustering is reduced due to several unnecessary words and large dimensions. The semantic word processing and novel Particle Grey Wolf Optimizer (PGWO) for efficient text clustering are introduced in Reference [59]. First, the text documents are provided as input to the initial phase, which offers valuable keyword for clustering and feature extraction.…”
Section: Gray Wolf Optimizer (Gwo)mentioning
confidence: 99%
“…The accuracy of text clustering is reduced due to several unnecessary words and large dimensions. The semantic word processing and novel Particle Grey Wolf Optimizer (PGWO) for efficient text clustering are introduced in Reference [59]. First, the text documents are provided as input to the initial phase, which offers valuable keyword for clustering and feature extraction.…”
Section: Gray Wolf Optimizer (Gwo)mentioning
confidence: 99%
“…Innowadaysdocument clusteringisaveryactiveresearch field, andmany approaches have beenestablishedtodealwithit (DipakandMukesh,2011;OikonomakouandVazirgiannis,2009;Zamir and Etzioni, 1998;Vidyadhari et al, 2019). They are categorized into two major classes: thehierarchicalandthepartitioningbasedclustering.Thedifferencebetweenthesetwocategories ofclusteringmethodsresidesinthepropertiesofthedeliveredclusters.Inthepartitioningbased clustering,thedataaredirectlydividedintoapredefinednumberofdisjointgroups.However,inthe hierarchicalclustering,adendrogramisgeneratedinlevels'sequences,ineachone,apartitioning clusteringisrealizedwithafixednumberofclusters.Itvariesfromsingletonclusterstoonecluster containingallthedata.Itsunsupervisednaturemakesclusteringasoneofthemostdifficultproblems ofdatamining.Furthermore,itisconsideredasanNP-hardproblem (XuandWunsch,2005;Jain etal.,1999;Dubes,1993).Oneshouldnoticethatthetimecomplexityofhierarchicalclustering isquadratic,whereasitisalmostlinearinthepartitioningapproaches.Therefore,thepartitioning approachesaremoresuitableforclusteringlarge-scaledatasets.…”
Section: Introductionmentioning
confidence: 99%