Ji Duo, Liu Yunzhao, Peng Ruxiang, Kong Huafeng. K-MEANS TEXT CLUSTERING ALGORITHM BASED ON THE CENTER POINT OF SUBJECT WORD VECTORJ. Computer Applications and Software, 2024, 41(10): 282-286,318. DOI: 10.3969/j.issn.1000-386x.2024.10.042
Citation: Ji Duo, Liu Yunzhao, Peng Ruxiang, Kong Huafeng. K-MEANS TEXT CLUSTERING ALGORITHM BASED ON THE CENTER POINT OF SUBJECT WORD VECTORJ. Computer Applications and Software, 2024, 41(10): 282-286,318. DOI: 10.3969/j.issn.1000-386x.2024.10.042

K-MEANS TEXT CLUSTERING ALGORITHM BASED ON THE CENTER POINT OF SUBJECT WORD VECTOR

  • K-means is one of the most popular clustering algorithms because of its low time complexity and fast running speed. However, K-means algorithm needs to give the number of clusters and the initial center points in advance when clustering, and its selection will directly affect the final clustering effect. In this paper, a lot of research has been done on the selection of initial class center and iterative class center. The initial cluster center was selected according to the decision diagram, and the subject word vector of each cluster was used instead of the mean value as the iterative cluster center. Experiments show that the initial point selection method in this paper can accurately select the initial point, and using the subject word vector as the iterative class center can well avoid the influence of noise points and noise features, and greatly improve the k-means clustering performance.
  • loading

Catalog

    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return