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.

Speeding Up Constrained Clustering

  • It is costly to compute some constrained clustering
  • Ex. Clustering with obstacle objects: Tung, Hou, and Han. Spatial clustering in the presence of obstacles, ICDE'01
  • K-medoids is more preferable since k-means may locate the ATM center in the middle of a lake
  • Visibility graph and shortest path
  • Triangulation and micro-clustering
  • Two kinds of join indices (shortest-paths) worth pre-computation
    • VV index: indices for any pair of obstacle vertices
    • MV index: indices for any pair of micro-cluster and obstacle indices

Speaker notes:

Content Tools


There are currently no sources for this slide.