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.

The Birch Algorithm

  • Cluster Diameter


  • For each point in the input
    • Find closest leaf entry
    • Add point to leaf entry and update CF
    • If entry diameter > max_diameter, then split leaf, and possibly parents
  • Algorithm is O(n)
  • Concerns
    • Sensitive to insertion order of data points
    • Since we fix the size of leaf nodes, so clusters may not be so natural
    • Clusters tend to be spherical given the radius and diameter measures

Speaker notes:

Content Tools


There are currently no sources for this slide.