• DocumentCode
    492140
  • Title

    A Modified Spectral Clustering Algorithm Based on NJW

  • Author

    Huang, Biao ; Yang, Peng

  • Author_Institution
    Chongqing Univ. of Arts & Sci., Chongqing
  • fYear
    2008
  • fDate
    21-22 Dec. 2008
  • Firstpage
    381
  • Lastpage
    384
  • Abstract
    Spectral clustering has become one of the most popular modern clustering algorithms because it has "global" optimal solution compared with traditional clustering methods. In this paper, we propose a modified NJW algorithm which is based on matrix perturbation theory and can be easily implemented. In addition, the algorithm can estimate the parameter k and in turn achieve appropriate clusters. The experimental results on a number of challenging clustering problems show that it has good performance.
  • Keywords
    matrix algebra; parameter estimation; pattern clustering; perturbation theory; global optimal solution; matrix perturbation theory; modified NJW algorithm; modified spectral clustering algorithm; parameter estimation; Art; Clustering algorithms; Clustering methods; Graph theory; Image segmentation; Laplace equations; Machine learning; Machine learning algorithms; Parameter estimation; Shape; Adjacent matrix; NJW; Spectral clustering;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Knowledge Acquisition and Modeling Workshop, 2008. KAM Workshop 2008. IEEE International Symposium on
  • Conference_Location
    Wuhan
  • Print_ISBN
    978-1-4244-3530-2
  • Electronic_ISBN
    978-1-4244-3531-9
  • Type

    conf

  • DOI
    10.1109/KAMW.2008.4810503
  • Filename
    4810503