1 / 9

A general grid-clustering approach

A general grid-clustering approach. Presenter : Chun-Ping Wu Authors : Shinong Yue , Miaomiao Wei, Jeen-shing Wang, Huaxiang Wang . 國立雲林科技大學 National Yunlin University of Science and Technology. PRL 2008. Outline. Motivation Objective Methodology Experiments Conclusion

merlin
Télécharger la présentation

A general grid-clustering approach

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 general grid-clustering approach Presenter : Chun-Ping Wu Authors : ShinongYue, Miaomiao Wei, Jeen-shing Wang, Huaxiang Wang 國立雲林科技大學 National Yunlin University of Science and Technology PRL 2008

  2. Outline • Motivation • Objective • Methodology • Experiments • Conclusion • Comments

  3. Motivation • Hard c-means(HCM) need to predetermine the number of clusters. • It’s crucially influenced by the choice of initial cluster centers. • The performances of the HCM often are too slow to apply any large size of dataset.

  4. Objective • Determining an optimal grid size by a designed partitioning index. • Breaking the curse of dimensionality in high-dimensional datasets.

  5. Methodology • (1)Solve the minimal grid that encloses all data objects in M. • (2)Successively bisect GRID. • The jth round of bisecting • Solve an optimal grid size • The bisecting stops if the bisected rounds equal OPT + q, where q is a constant. • (3)Find all core grids. • (4)Merge each group of core grids. • The optimal value of q, • (5)Assign all non-core optimal grids to a cluster.

  6. Experiments • Clustering results of the five artificial datasets.

  7. Experiments • Clustering results of the three benchmark datasets.

  8. Conclusion • The GGCA integrates the advantages of both the divisible and the agglomerative clustering algorithms. • The GGCA solves two critical problems of conventional grid-clustering algorithms. • Grid size • Merging condition • The GGCA is a perfect non-parametric algorithm. 8

  9. Comments • Advantage • Improving of the iteration speed in a large dataset. • Drawback • This paper is not clear. • Application • clustering 9

More Related