Corpus Characteristics-Based Method to Centroids Number Determination for Clustering Text Documents

Clustering is fundamental for categorizing and exploring information, particularly in written texts. Traditional clustering algorithms such as K-Means generate clusters in which each document is assigned to a cluster based on a centroid or representative of the cluster. Nevertheless, it is common to find situations where a single centroid is not enough to represent a cluster. To solve this problem, some variants of the K-Means algorithm have been introduced by considering more than one centroid per cluster. However, determining the number of centroids per cluster is a challenge; the user must employ trial and error to determine a good value, which is time-consuming. This paper proposes a solution to this problem for Improved-FPAC (Fast Partitional Clustering Algorithm, one of the most recent text document cluster algorithms) by introducing a method to compute the parameter l (number of centroids per cluster) based on the characteristics of the corpus. Based on our experiments on different public standard data sets, the method proposed in this paper, allows Improved-FPAC to obtain better clustering quality than the default value suggested by Improved-FPAC’s authors.

Authors

Institutions

Publication Details

Journal
Journal of Scientometric Research
Published
2025-03-27
DOI
https://doi.org/10.5530/jscires.20251455
Citations
1
Primary Topic
Authorship Attribution and Profiling
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Corpus Characteristics-Based Method to Centroids Number Determination for Clustering Text Documents

José Fco. Martínez-Trinidad, Jesús Ariel Carrasco-Ochoa, Darnes Vilariño Ayala, Inti Sandino Magallon Juan Qui
1 citations
Journal of Scientometric Research
Authorship Attribution and Profiling
2.48
article

Corpus Characteristics-Based Method to Centroids Number Determination for Clustering Text Documents

José Fco. Martínez-Trinidad, Jesús Ariel Carrasco-Ochoa, Darnes Vilariño Ayala, Inti Sandino Magallon Juan Qui
article en
1 citations

Abstract

Clustering is fundamental for categorizing and exploring information, particularly in written texts. Traditional clustering algorithms such as K-Means generate clusters in which each document is assigned to a cluster based on a centroid or representative of the cluster. Nevertheless, it is common to find situations where a single centroid is not enough to represent a cluster. To solve this problem, some variants of the K-Means algorithm have been introduced by considering more than one centroid per cluster. However, determining the number of centroids per cluster is a challenge; the user must employ trial and error to determine a good value, which is time-consuming. This paper proposes a solution to this problem for Improved-FPAC (Fast Partitional Clustering Algorithm, one of the most recent text document cluster algorithms) by introducing a method to compute the parameter l (number of centroids per cluster) based on the characteristics of the corpus. Based on our experiments on different public standard data sets, the method proposed in this paper, allows Improved-FPAC to obtain better clustering quality than the default value suggested by Improved-FPAC’s authors.

Journal of Scientometric ResearchVol. 14(1)
National Institute of Astrophysics, Optics and Electronics (MX), Benemérita Universidad Autónoma de Puebla (MX)
Openalex Percentile: Top 11%
Authorship Attribution and Profiling
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.