Skip to content
Research Article Open access CC BY 4.0

Similarity Measure Algorithm for Text Document Clustering, Using Singular Value Decomposition

Valentina Adu, Michael Donkor Adane, Kwadwo Asante

Current Journal of Applied Science and Technology · pp. 8–25 · Published 6 Sep 2021

10.9734/cjast/2021/v40i2231475

Abstract

We examined a similarity measure between text documents clustering. Data mining is a challenging field with more research and application areas. Text document clustering, which is a subset of data mining helps groups and organizes a large quantity of unstructured text documents into a small number of meaningful clusters. An algorithm which works better by calculating the degree of closeness of documents using their document matrix was used to query the terms/words in each document. We also determined whether a given set of text documents are similar/different to the other when these terms are queried. We found that, the ability to rank and approximate documents using matrix allows the use of Singular Value Decomposition (SVD) as an enhanced text data mining algorithm. Also, applying SVD to a matrix of a high dimension results in matrix of a lower dimension, to expose the relationships in the original matrix by ordering it from the most variant to the lowest.

Data mining similarity term frequency singular value decomposition clustering

Cited by 1

Comparison of Text Representation for Clustering Student Concept Maps

Reni Fatrisna Salsabila, Didik Dwi Prasetya, Triyanna Widyaningtyas · Matrik · 2025

Article metrics

Real usage data collected on this platform.

20

Page views

0

PDF downloads

2

Outbound clicks

1

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.