Tshikei: An Efficient One-Dimensional K-Means Clustering Algorithm

In the field of Natural Language Processing (NLP), the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{k}$</tex>-means clustering algorithm has wide applications, such as one-dimensional data, which such as frequency-based word frequency statistics or time-series text analysis. But <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{k}$</tex>-means has problem such as long iteration time consuming, low computational efficiency and sensitivity to initial center point selection. To So, we propose an optimized one-dimensional <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{k}$</tex>-means clustering algorithm named Tshikei, which makes full use of the sequential and continuous characteristics of one-dimensional data in text features, introduce an efficient indexing mechanism to speed up the search process,and significantly reduces the time complexity of the algorithm on the premise of ensuring the accuracy of clustering. Theoretical analysis shows that for a dataset of size <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$n$</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{k}$</tex> clustering centers, the new algorithm is able to converge to the optimal solution in <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{O}(\mathbf{n})$</tex> initialization time and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{O}(\mathbf{k})$</tex> iteration time, and discuss its equivalence with the standard <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k$</tex>-means algorithm in mathematics, providing strong support for the text mining task in NLP and commercial application for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{k}$</tex>-means algorithm.

Authors

Institutions

Publication Details

Published
2025-03-21
DOI
https://doi.org/10.1109/icnlp65360.2025.11108408
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tshikei: An Efficient One-Dimensional K-Means Clustering Algorithm

Jiajun Huang, Xuansen He, Xiaosheng Lin
Advanced Clustering Algorithms Research
article

Tshikei: An Efficient One-Dimensional K-Means Clustering Algorithm

Jiajun Huang, Xuansen He, Xiaosheng Lin
article en

Abstract

In the field of Natural Language Processing (NLP), the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{k}$</tex>-means clustering algorithm has wide applications, such as one-dimensional data, which such as frequency-based word frequency statistics or time-series text analysis. But <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{k}$</tex>-means has problem such as long iteration time consuming, low computational efficiency and sensitivity to initial center point selection. To So, we propose an optimized one-dimensional <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{k}$</tex>-means clustering algorithm named Tshikei, which makes full use of the sequential and continuous characteristics of one-dimensional data in text features, introduce an efficient indexing mechanism to speed up the search process,and significantly reduces the time complexity of the algorithm on the premise of ensuring the accuracy of clustering. Theoretical analysis shows that for a dataset of size <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$n$</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{k}$</tex> clustering centers, the new algorithm is able to converge to the optimal solution in <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{O}(\mathbf{n})$</tex> initialization time and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{O}(\mathbf{k})$</tex> iteration time, and discuss its equivalence with the standard <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k$</tex>-means algorithm in mathematics, providing strong support for the text mining task in NLP and commercial application for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{k}$</tex>-means algorithm.

Department of Commerce (AU)
Openalex Percentile: Top 89%
Advanced Clustering Algorithms Research
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.

Tshikei: An Efficient One-Dimensional K-Means Clustering Algorithm — Jiajun Huang, Xuansen He, et al. · (2025) | TGRS Research Map | TGRS