1 / 13

A Similarity-Based Robust Clustering Method

A Similarity-Based Robust Clustering Method. Author : Miin-ShenYang and Kuo-Lung Wu Reporter : Tze Ho-Lin 2006/2/8. PAMI, 2004. Outline. Motivation Objectives Methodology Evaluation Conclusion Personal Comments Appendix. Motivation.

udell
Download Presentation

A Similarity-Based Robust Clustering Method

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. A Similarity-Based Robust Clustering Method Author : Miin-ShenYang and Kuo-Lung Wu Reporter : Tze Ho-Lin 2006/2/8 PAMI, 2004

  2. Outline • Motivation • Objectives • Methodology • Evaluation • Conclusion • Personal Comments • Appendix

  3. Motivation • Most clustering methods are less to include the property of robustness.

  4. Objectives • Construct a robust clustering method that • Robust to the initialization (cluster number and initial guesses) • Robust to cluster volumes (ability to detect different volumes of clusters) • Robust to noise and outliers

  5. γ=1 5 iteration γ=10 converge Methodology

  6. Evaluation Data set FCM PCM SCM with single-link method SCM with Ward’s method SCM convergence state

  7. Evaluation For all n data points in s-dimensional space • CCA • a good estimate of γalways falls in the interval [5,20] • SCA • AHC • PCM & FCM

  8. Conclusion • CCA is used to estimate parameter γ. • SCA is used to self-organize the data • AHC is used to obtain the optimal cluster number c* and identify these c* clusters. • The robustness to different cluster shapes should be another robust clustering characteristic that will be a further research topic.

  9. Personal Comments • Application • Low-dimensional data space clustering • Advantage • SCM can achieve robust clustering results • Disadvantage • Compared with other clustering method, SCM requires more computational time.

  10. Appendix: The Robust properties to noise and outliers (20) (21) φfunction of our estimate

  11. Correlation Comparison Algorithm (CCA) γ=5 γ=10 (7)

  12. 5 iteration converge Similarity Clustering Algorithm (SCA) (10) (11) (5)

  13. Fig 5. The identified clusters Fig 4. The Hierarchical Clustering tree Agglomerative Hierarchical Clustering (AHC)

More Related