1 / 18

Topology-Based Hierarchical Clustering of Self-Organizing Maps

Topology-Based Hierarchical Clustering of Self-Organizing Maps. Presenter : Wu, Min-Cong Authors : Kadim Ta¸sdemir , Pavel Milenov , and Brooke Tapsall 2011,IEEE. Outlines. Motivation Objectives Methodology Experiments Conclusions Comments. Motivation.

ronni
Télécharger la présentation

Topology-Based Hierarchical Clustering of Self-Organizing Maps

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. Topology-Based Hierarchical Clustering of Self-Organizing Maps Presenter : Wu, Min-Cong Authors : KadimTa¸sdemir, Pavel Milenov, and Brooke Tapsall2011,IEEE

  2. Outlines • Motivation • Objectives • Methodology • Experiments • Conclusions • Comments

  3. Motivation • Hierarchical clustering various distance-based similarity measures that have some flaw . • 1. sensitivity to inhomogeneous within-cluster density distributions, noise or outliers. • 2. depend on the cluster centroids and dispersion around these centroids.

  4. Objectives • we employ average linkage for hierarchical clustering of prototypes based on CONN so that at each agglomeration step we merge the pair with maximum average between cluster connectivity that method CONN linkage, and add a new similarity criteria CONN_Index.

  5. Methodology-SOMs • Adapted BMU • Updating BMU • RFi and RFij

  6. Methodology-Connectivity Martix from CONN CONN CADJ CONN(P1,P2) = 3 CONN(P1,P3) = 5 CONN(P2,P3) = 2 CONN(P3,P2) = 2 CONN(P3,P1) = 5 CONN(P2,P1) = 3 CONN=CADJ(p1,p2)+CADJ(p2,p1) =1+2 =3

  7. Methodology-CONN Linkage Similary matrix Delete Add

  8. Methodology-Number of cluster

  9. Methodology-Applicability and Complexity of the Algorithm represent the data topology occasionally Delaunay graph is to have dense enough prototypes. CONN Linkage’s time complexity = O(p^2*d) Average Linkage’s time complexity = O(p^3*d)

  10. Experiment

  11. Experiment

  12. Experiment

  13. Experiment

  14. Experiment

  15. Experiment

  16. Experiment

  17. Conclusions • CONN linkage produces partitionings better than the ones obtained by distance-based linkages. • Conn_Index based on CONN graph provided better decisions than other indices in the study reported in this paper.

  18. Comments • Advantages • CONN_Index provides the best partitioning for the preset number of clusters. • CONN linkage is mainly proposed for accurate clustering of remote sensing imagery • Applications • hierarchical clustering.

More Related