1 / 22

A Strategy for Manifold Clustering with Sample Algorithms

A Strategy for Manifold Clustering with Sample Algorithms. Sheng Yu UM Statistics. Outline. Motivation Strategy Sample Algorithms. Motivation (pattern). Most current clustering methods are only able to detect agglomerated patterns.

raphael-powell
Download Presentation

A Strategy for Manifold Clustering with Sample Algorithms

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. A Strategy for Manifold Clustering with Sample Algorithms Sheng Yu UM Statistics

  2. Outline • Motivation • Strategy • Sample Algorithms

  3. Motivation (pattern) • Most current clustering methods are only able to detect agglomerated patterns. • New generation methods, such as normalized cut, have more flexibility, but are still not able to detect twisted, perhaps also entangled manifolds. • Such manifold patterns are not rare.

  4. This is a manifold...

  5. Example:Try to cluster a pair of symmetric double spiral.

  6. Example:result fromk-means

  7. Example:result from normalized cut

  8. Motivation (noise) • Theoretically, hierarchical clustering method using “single linkage” as the merging criterion is able to cluster twisted patterns. However, since “single linkage” is extremely sensitive to noisy, it is not actually a usable method.

  9. Motivation • To design a new method that is not only able to accomplish traditional “easy” tasks, but also handles twisted, entangled patterns as well. • Also, this new method should not be ruined by noise (moderate level, in terms of signal-noise ratio).

  10. Outline • Motivation • Strategy • Sample Algorithms

  11. Strategy (rationale)

  12. Strategy (design) • Engine: Searches paths between each pair of points. More powerful engine provides faster speed. • Filter: Tells the engine which neighboring points can be connected from a specific start point. Controls the quality.

  13. Example (easy one)

  14. Example (not so easy one)

  15. Example (not so easy one)

  16. Example (hard one)

  17. Outline • Motivation • Strategy • Sample Algorithms

  18. Algorithms (filter) • The filter I currently use is still primitive. • But it does a lot of jobs, such as the above examples. • The strategy is an open framework. We can build better filters to detect even more difficult patterns and have more resistance to noise.

  19. Algorithmsthe importance of the engine

  20. Strategy (rationale)

  21. Algorithms • The true benefit of a super fast engine is that it allows us to do iteration. • We need to set up a range of acceptable number of clusters. • We do not need our initial parameters to be precise. The algorithm will do heuristic search for us.

  22. a demo of visual aids for choosing parameters

More Related