1 / 23

Visualization of OPTICS Algorithm in Databases

This presentation demonstrates the animation of the OPTICS Algorithm for knowledge discovery in databases. It showcases the steps involved in computing a cluster ordering using a 2-dimensional example database.

betteberry
Download Presentation

Visualization of OPTICS Algorithm in Databases

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. CMPUT 690 – Topics in Databases Knowledge Discovery in DatabasesAdditional Slides for Clustering II:Animation of the OPTICS Algorithm Dr. Jörg Sander Department of Computing Science University of Alberta Dr. Jörg Sander, 2002

  2. reach-dist ? e E N A I B J K L M R C F D G H S T U V P A controlList: (A, ?) Computing a Cluster Ordering - Example • Example Database (2-dimensional, 20 points) e= 44, MinPts = 3 controlList: CMPUT 690 – Topics in Databases: KDD

  3. reach-dist ? e N J K L R M F C P E G H S T U V D Computing a Cluster Ordering - Example B I A A controlList: (B,40) (I, 40) CMPUT 690 – Topics in Databases: KDD

  4. reach-dist ? e N J K L R P F M E G D H S T U V Computing a Cluster Ordering - Example C B I A A B controlList: (I, 40) (C, 40) CMPUT 690 – Topics in Databases: KDD

  5. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I R controlList: (J, 20) (K, 20) (L, 31) (C, 40) (M, 40) (R, 43) CMPUT 690 – Topics in Databases: KDD

  6. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J R controlList: (L, 19) (K, 20) (R, 21) (M, 30) (P, 31) (C, 40) CMPUT 690 – Topics in Databases: KDD

  7. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L R controlList: (M, 18) (K, 18) (R, 20) (P, 21) (N, 35) (C, 40) CMPUT 690 – Topics in Databases: KDD

  8. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M R controlList: (K, 18) (N, 19) (R, 20) (P, 21) (C, 40) CMPUT 690 – Topics in Databases: KDD

  9. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M K R controlList: (N, 19) (R, 20) (P, 21) (C, 40) CMPUT 690 – Topics in Databases: KDD

  10. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M K N R controlList: (R, 20) (P, 21) (C, 40) CMPUT 690 – Topics in Databases: KDD

  11. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M K N R R controlList: (P, 21) (C, 40) CMPUT 690 – Topics in Databases: KDD

  12. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M K N R P R controlList: (C, 40) CMPUT 690 – Topics in Databases: KDD

  13. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M K N R P C R controlList: (D, 22) (F, 22) (E, 30) (G, 35) CMPUT 690 – Topics in Databases: KDD

  14. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M K N R P C D R controlList: (F, 22) (E, 22) (G, 32) CMPUT 690 – Topics in Databases: KDD

  15. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M K N R P C D F R controlList: (G, 17) (E, 22) CMPUT 690 – Topics in Databases: KDD

  16. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M K N R P C D F G R controlList: (E, 15) (H, 43) CMPUT 690 – Topics in Databases: KDD

  17. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M K N R P C D F G E R controlList: (H, 43) CMPUT 690 – Topics in Databases: KDD

  18. reach-dist ? e controlList: (T, ?) Computing a Cluster Ordering - Example H.core-dist = ? U S E T V G D H F C B K M N I A L P J A B I J L M K N R P C D F G E H R controlList: CMPUT 690 – Topics in Databases: KDD

  19. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M K N R P C D F G E H T R controlList: (S, 18) (V, 18) (U, 25) CMPUT 690 – Topics in Databases: KDD

  20. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M K N R P C D F G E H T S R controlList: (V, 18) (U, 20) CMPUT 690 – Topics in Databases: KDD

  21. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M K N R P C D F G E H T S V R controlList: (U, 19) CMPUT 690 – Topics in Databases: KDD

  22. reach-dist ? U S E T V G D H F C e B K M N I A L P J A B I J L M K N R P C D F G E H T S V U R Computing a Cluster Ordering - Example controlList: - CMPUT 690 – Topics in Databases: KDD

  23. reach-dist ? e Computing a Cluster Ordering - Example U S E T V G D H F C B K M N I A L P J A B I J L M K N R P C D F G E H T S V U R controlList: - CMPUT 690 – Topics in Databases: KDD

More Related