1 / 15

Iterative shrinking method for generating clustering

Iterative shrinking method for generating clustering. Olli Virmajoki , Pasi Fränti and Timo Kaukoranta. UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE FINLAND. TURKU CENTRE FOR COMPUTER SCIENCE UNIVERSITY OF TURKU FINLAND. Problem setup.

yorick
Download Presentation

Iterative shrinking method for generating clustering

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. Iterative shrinking method for generating clustering Olli Virmajoki, Pasi Fränti andTimo Kaukoranta UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE FINLAND TURKU CENTRE FOR COMPUTER SCIENCE UNIVERSITY OF TURKU FINLAND

  2. Problem setup Given N data vectors X={x1, x2, …, xN}, partition the data set into M clusters 1. Goal of clustering: find the location of the clusters. 2. Goal of VQ: approximate the original data by the codebook.

  3. Algorithms for solving the clustering PNN: Pairwise Nearest Neigbor method • Existing method • Merges clusters IS: Iterative shrinking method • New method • Removes clusters

  4. Pseudo code of the PNN

  5. Local optimization of the PNN Merge cost: Find minimum cost pair to be merged:

  6. Merging process of the PNN

  7. Iterative Shrinking algorithm (IS)

  8. Local optimization of the IS Finding secondary cluster: Removal cost of single vector:

  9. Cluster removal process of the Iterative Shrinking

  10. Affected neighbor clusters

  11. Different update strategies Time complexities: O(N2) .. O(N2 log2N)

  12. Comparison of run times (Extensive update)

  13. Number of distance calculations Approximately the same >2 times slower No much difference

  14. Comparison of MSE-values • Additional result (M=256): • Genetic Algorithm with IS as crossover: 160.77

  15. Conclusions • Slower but better clustering algorithm. • Local optimization applied in every step. • Preliminary results: BEST known clustering algorithm (in minimizing MSE) when used as crossover in Genetic Algorithm !!!

More Related