An effective dimension reduction algorithm for clustering Arabic text

Mohamed, A. A.

doi:10.1016/j.eij.2019.05.002

2020-03-01

Mohamed, A. A. *

DOI：10.1016/j.eij.2019.05.002

原文链接

查看原文

摘要

En 中文

Text clustering is a challenging task in natural language processing due to the very high dimensional space produced by this process (i.e. curse of dimensionality problem). Since these texts contain considerable amounts of ambiguities and redundancies, they produce different noise effects. For an efficient and accurate clustering algorithm, we need to extract the main concepts of the text by eliminating the noise and reducing the high dimensionality of the data. This paper compares among three of the famous dimension reduction algorithms for text clustering to show the pros and cons of each one, namely Principal Component Analysis (PCA), Nonnegative Matrix Factorization (NMF) and Singular Value Decomposition (SVD). It presents an effective dimension reduction algorithm for Arabic text clustering using PCA. For that purpose, a series of the experiments has been conducted using two linguistic corpora for both English and Arabic and analyzed the results from a clustering quality point of view. The experiments have shown that PCA improves the quality of the clustering process and that it gives more interpretable results with less time needed for the clustering process for both Arabic and English documents. (C) 2019 Production and hosting by Elsevier B.V. on behalf of Faculty of Computers and Information, Cairo University.

Keyword:

Clustering

Dimensionality reduction

PCA

SVD

NMF

Arabic NLP