1 / 20

Local Clustering Algorithm

Local Clustering Algorithm. DISCOVIR 9-16-2002. Current Situation. Image collection within a client is modeled as a single cluster. Proposed Improvement. Multiple clusters exist in the image collection. Group of similar local cluster A. Group of similar local cluster B.

Download Presentation

Local Clustering Algorithm

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. Local Clustering Algorithm DISCOVIR 9-16-2002

  2. Current Situation • Image collection within a client is modeled as a single cluster.

  3. Proposed Improvement • Multiple clusters exist in the image collection

  4. Group of similar local cluster A

  5. Group of similar local cluster B

  6. Group of similar local cluster C

  7. Clustering Algorithm • 3 clustering algorithms are proposed and tested • C – set of cluster center • X – dataset • Goal of clustering : minimize Error

  8. Randomly pick a point from dataset X Find closest clustercenter c and update Error change < thresholditerate a certain step? Y N Returncluster center Procedure • Randomly pick k xj from {X} and assign them as the set {C} as initial cluster center. Input datasetand cluster

  9. Shifting Mean (SM) • Suppose xj is picked and ci is the closest cluster center • Let p be number of times ci wins, initially p=1 • Update ci by

  10. Competitive Learning (CL) • Update ci by • t – the current number of iteration so far • T – total number of iteration intend to run • We choose  by 0.5, 0.3, 0.1

  11. Illustration ci xj

  12. Illustration ci xj Winner (move closer)

  13. Rival Penalized Competitive Learning (RPCL) • Suppose cl is the second closest cluster center to xj • Update ci by • Update cl by • We choose  = 0.05

  14. Illustration ci xj unchanged Rival (move away) Winner (move closer)

  15. Final Steps • For each xj ,find the closest ci and mark xj belongs to ci • Calculate error function • Carryout experiments by varying # of iteration, learning rate

  16. Results Fixed Learning rate Varying iteration Fixed Learning rate Varying iteration Fixed IterationVarying learning rate

  17. Screen Capture

  18. Screen Capture

  19. Screen Capture

  20. Others • Other variation • i – initial learning rate • f – final learning rate • Interesting link for competitive learningsome competitive learning methods

More Related