• DocumentCode
    2986146
  • Title

    A Text Clustering Method Based on Two-Dimensional OTSU and PSO Algorithm

  • Author

    Chen He-Nian ; He, Bin ; Yan, Lili ; Li, Junqing ; Ji, Wentian

  • Author_Institution
    Dept. of Comput. Software, Hainan Coll. of Software, Qionghai, China
  • fYear
    2009
  • fDate
    18-20 Jan. 2009
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    Fast and high-quality text clustering algorithm is an important and challenging problem in effectively navigating. Such as the high-dimensional sparse text data, poor efficiency of unsupervised feature selection, and defects existing in classical clustering methods and so on. In this paper, an effective and unsupervised text clustering method (OK-PSO) is proposed. First, k-means is used to calculate the distance from each term to the cluster centers, and then the two-dimensional Otsu algorithm is included to evaluate the optimization of clustering distance threshold. The process of 2D Otsu is taken by PSO algorithm. Finally, several experiments are taken based on OK-PSO and some other methods. The experimental results illustrate the efficiency of OK-PSO method proposed in this paper.
  • Keywords
    particle swarm optimisation; pattern clustering; text analysis; 2D OTSU algorithm; PSO algorithm; clustering distance threshold; particle swarm optimization; unsupervised text clustering method; Clustering algorithms; Clustering methods; Cost function; Educational institutions; Frequency; Helium; Navigation; Neural networks; Neurons; Software algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Network and Multimedia Technology, 2009. CNMT 2009. International Symposium on
  • Conference_Location
    Wuhan
  • Print_ISBN
    978-1-4244-5272-9
  • Type

    conf

  • DOI
    10.1109/CNMT.2009.5374525
  • Filename
    5374525