Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

CLARANS (“Randomized” CLARA) (1994)

  • CLARANS (A Clustering Algorithm based on Randomized Search) (Ng and Han’94)
    • Draws sample of neighbors dynamically
    • The clustering process can be presented as searching a graph where every node is a potential solution, that is, a set of k medoids
    • If the local optimum is found, it starts with new randomly selected node in search for a new local optimum
  • Advantages: More efficient and scalable than both PAM and CLARA
  • Further improvement: Focusing techniques and spatial access structures (Ester et al.’95)

Speaker notes:

Content Tools


There are currently no sources for this slide.