• DocumentCode
    174000
  • Title

    Automatic elastic net clustering algorithm

  • Author

    Chun-Wei Tsai ; Tsung-Hsien Lin ; Ming-Chao Chiang

  • Author_Institution
    Dept. of Comput. Sci. & Inf. Eng., Nat. Ilan Univ., Yilan, Taiwan
  • fYear
    2014
  • fDate
    5-8 Oct. 2014
  • Firstpage
    2768
  • Lastpage
    2773
  • Abstract
    Clustering has always been playing a vital role in many different disciplines because it is an important tool for analyzing a set of unknown input patterns. However, some important issues related to clustering, such as automatically determining the number of clusters and partitioning non-linearly separable data, are never fully solved even though many researchers work on this subject for a long time. As such, a novel method based on the so called elastic net clustering algorithm is presented in this paper to deal with exactly the two issues: partitioning non-linearly separable data and automatically determining the number of clusters. To evaluate the performance of the proposed algorithm, several well-known datasets are used. The experimental results show that not only can the proposed algorithm find the appropriate number of clusters, but it can also provide a higher accuracy rate than all the other methods compared in this study for most datasets.
  • Keywords
    optimisation; pattern clustering; automatic elastic net clustering algorithm; nonlinearly separable data partitioning; Accuracy; Algorithm design and analysis; Approximation algorithms; Classification algorithms; Clustering algorithms; Indexes; Traveling salesman problems; Elastic net algorithm; cluster validity index; clustering algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems, Man and Cybernetics (SMC), 2014 IEEE International Conference on
  • Conference_Location
    San Diego, CA
  • Type

    conf

  • DOI
    10.1109/SMC.2014.6974347
  • Filename
    6974347