• DocumentCode
    3241654
  • Title

    Semi-Supervised Clustering Algorithm for Multi-Density and Complex Shape Dataset

  • Author

    Yu, Yang-qiang ; Huang, Tian-qiang ; Guo, Gong-de ; Li, Kai

  • Author_Institution
    Dept. of Comput. Sci., Fujian Normal Univ., Fuzhou
  • fYear
    2008
  • fDate
    22-24 Oct. 2008
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    There are many complicated data in real world, clustering analysis should be able to find the clusters of different shapes and densities. The existing typical clustering algorithms do not perform well on multi-density data. A semi-supervised clustering algorithm for multi-density dataset SCMD is proposed. The pairwise constraints: must-link and cannot-link that reflect the distribution of multi-density dataset are used. Experimental results show the algorithm can identify the clusters of varying shapes, sizes, and densities, even in the presence of noise and outliers. It is more efficient than SNN and DBSCAN.
  • Keywords
    data analysis; learning (artificial intelligence); pattern clustering; DBSCAN; SCMD; SNN; clustering analysis; complex shape dataset; multidensity data; multidensity shape dataset; pairwise constraints; semi-supervised clustering algorithm; Algorithm design and analysis; Clustering algorithms; Clustering methods; Computer science; Mathematics; Multi-stage noise shaping; Nearest neighbor searches; Partitioning algorithms; Semisupervised learning; Shape;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pattern Recognition, 2008. CCPR '08. Chinese Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-2316-3
  • Type

    conf

  • DOI
    10.1109/CCPR.2008.15
  • Filename
    4662968