Embed Size (px)
DESCRIPTION
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. reach-dist. ?. e. E. N. A. I. B. J. K. L. M. R. - PowerPoint PPT Presentation
Citation preview
CMPUT 690 – Topics in Databases Knowledge Discovery in Databases
Additional Slides for Clustering II:Animation of the OPTICS Algorithm
Dr. Jörg SanderDepartment of Computing Science
University of Alberta
Dr. Jörg Sander, 2002
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 2
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
Computing a Cluster Ordering - ExampleExample Database (2-dimensional, 20 points)
= 44, MinPts = 3
controlList: (A, ?)controlList:
? reach-dist
A
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 3
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A
controlList: (B,40) (I, 40)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 4
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B
controlList: (I, 40) (C, 40)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 5
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I
controlList: (J, 20) (K, 20) (L, 31) (C, 40) (M, 40) (R, 43)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 6
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J
controlList: (L, 19) (K, 20) (R, 21) (M, 30) (P, 31) (C, 40)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 7
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L
controlList: (M, 18) (K, 18) (R, 20) (P, 21) (N, 35) (C, 40)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 8
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M
controlList: (K, 18) (N, 19) (R, 20) (P, 21) (C, 40)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 9
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K
controlList: (N, 19) (R, 20) (P, 21) (C, 40)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 10
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K N
controlList: (R, 20) (P, 21) (C, 40)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 11
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K N R
controlList: (P, 21) (C, 40)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 12
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K N R P
controlList: (C, 40)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 13
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K N R P C
controlList: (D, 22) (F, 22) (E, 30) (G, 35)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 14
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K N R P C D
controlList: (F, 22) (E, 22) (G, 32)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 15
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K N R P C D F
controlList: (G, 17) (E, 22)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 16
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K N R P C D F G
controlList: (E, 15) (H, 43)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 17
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K N R P C D F G E
controlList: (H, 43)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 18
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K N R P C D F G E H
H.core-dist = ?
controlList:controlList: (T, ?)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 19
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K N R P C D F G E H T
controlList: (S, 18) (V, 18) (U, 25)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 20
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K N R P C D F G E H T S
controlList: (V, 18) (U, 20)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 21
Computing a Cluster Ordering - Example
A B I J L M K N R P C D F G E H T S VA I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
controlList: (U, 19)
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 22
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K N R P C D F G E H T S V U
controlList: -
? reach-dist
Dr. Jörg Sander, 2002 CMPUT 690 – Topics in Databases: KDD University of Alberta 23
Computing a Cluster Ordering - Example
A I
B
J
K
L
R
M
P
N
CF
DE G H
S
T
U
V
A B I J L M K N R P C D F G E H T S V U
controlList: -
? reach-dist
