.png){kind=icon}
返回
Bare-Bones Based Salp Swarm Algorithm for Text Document Clustering
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3314589.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Text Document Clustering (TDC) is a challenging optimization problem in unsupervised machine learning and text mining. The Salp Swarm Algorithm (SSA) has been found to be effective in solving complex optimization problems. However, the SSA's exploitation phase requires improvement to solve the TDC problem effectively. In this paper, we propose a new approach, known as the Bare-Bones Salp Swarm Algorithm (BBSSA), which leverages Gaussian search equations, inverse hyperbolic cosine control strategies, and greedy selection techniques to create new individuals and guide the population towards solving the TDC problem. We evaluated the performance of the BBSSA on six benchmark datasets from the text clustering domain and six scientific papers datasets extracted from the top eight UAE universities. The experimental results demonstrate that the BBSSA algorithm outperforms traditional SSA and nine other optimization algorithms. Furthermore, the BBSSA algorithm achieves better results than the five traditional clustering techniques.
Keyword:
Global optimization
salp swarm algorithm
bare bones
greedy selection strategy
text document clustering
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm蛾焰优化算法: 一种新的自然启发启发式范式
PREAI
分享收藏分享收藏
查看更多内容