1. CMPUT 690 – Topics in Databases Knowledge Discovery in Databases Additional 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. CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 2 A I B J K L R M P N C F D E G H S T U V Computing a Cluster Ordering - Example Example Database (2-dimensional, 20 points)  = 44, MinPts = 3 controlList: (A, ?) controlList:  ? reach-dist A

3. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 3 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V A controlList: (B,40) (I, 40)  ? reach-dist

4. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 4 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V AB controlList: (I, 40) (C, 40)  ? reach-dist

5. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 5 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABI controlList: (J, 20) (K, 20) (L, 31) (C, 40) (M, 40) (R, 43)  ? reach-dist

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

7. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 7 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJL controlList: (M, 18) (K, 18) (R, 20) (P, 21) (N, 35) (C, 40)  ? reach-dist

8. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 8 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLM controlList: (K, 18) (N, 19) (R, 20) (P, 21) (C, 40)  ? reach-dist

9. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 9 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMK controlList: (N, 19) (R, 20) (P, 21) (C, 40)  ? reach-dist

10. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 10 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMKN controlList: (R, 20) (P, 21) (C, 40)  ? reach-dist

11. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 11 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMKNR controlList: (P, 21) (C, 40)  ? reach-dist

12. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 12 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMKNRP controlList: (C, 40)  ? reach-dist

13. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 13 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMKNRPC controlList: (D, 22) (F, 22) (E, 30) (G, 35)  ? reach-dist

14. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 14 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMKNRPCD controlList: (F, 22) (E, 22) (G, 32)  ? reach-dist

15. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 15 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMKNRPCDF controlList: (G, 17) (E, 22)  ? reach-dist

16. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 16 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMKNRPCDFG controlList: (E, 15) (H, 43)  ? reach-dist

17. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 17 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMKNRPCDFGE controlList: (H, 43)  ? reach-dist

18. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 18 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMKNRPCDFGEH H.core-dist = ? controlList: controlList: (T, ?)  ? reach-dist

19. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 19 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMKNRPCDFGEHT controlList: (S, 18) (V, 18) (U, 25)  ? reach-dist

20. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 20 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMKNRPCDFGEHTS controlList: (V, 18) (U, 20)  ? reach-dist

21. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 21 Computing a Cluster Ordering - Example ABIJLMKNRPCDFGEHTSV A I B J K L R M P N C F D E G H S T U V controlList: (U, 19)  ? reach-dist

22. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 22 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMKNRPCDFGEHTSVU controlList: -  ? reach-dist

23. Dr. Jörg Sander, 2002CMPUT 690 – Topics in Databases: KDDUniversity of Alberta 23 Computing a Cluster Ordering - Example A I B J K L R M P N C F D E G H S T U V ABIJLMKNRPCDFGEHTSVU controlList: -  ? reach-dist