Quanyu Zhu
April 16, 1999
Introduction:
Sequential Clustering Algorithm is the simplest type of clustering algorithm,
uses straightforward greedy approach.
.
Basic approach
Required Parameter :
Start with x1 in rst cluster C1
For each remaining f.v. xi . nd clusterCk minimizing d(xi , Ck ) (maximizing s(xi ,Ck )) using desired DM/SM
If d(xi ,Ck ) , addxi to Ck ; else create new cluster for xi
Optional parameter q limits total number of clusters to conserve computational resources
1.2 Pseudocode
Input : , q (q is optional )
Initialize m = 1, Cm = xi
For i = 2 to N
- Ck = argmin
1j m d(xi ; Cj )
- If d(xi ; Ck ) > and m < q then m=m+1 and Cm = xi
S
- Else Ck = Ck xi and update representatives if necessary
If SM used, replace argmin with argmax and> with <.
f
2 Modied BSAS
2.3 Pseudocode
Input : , q (q is optional)
Phase 1.
Initialize m = 1, Ck = xi
For i = 2 to N
- Ck = argmin
1j m d(xi ; Cj )
- If d(xi ; Ck )> and m < q then m=m+1 and Cm = xi
f
Phase 2.
3.1 Introduction
3.2 Pseudocode
Input : 1, 2
Initialize m = 1, Ck = xi
while there exist unassign f.v.'s
f
Must careful to avoid innite loop, where some xi alwyas has d(xi ; Ck )
[1; 2 ]
3
4 Example
x1
x2
0
17
17 0
13
2
3
20
18 5
5
5
5
10
2
17
MBSAS, = 2.5
TTSAS, 1 =2.2, 2=4
p
p
13
2
0
10
17
1
2
3
x3
p
p
p
p
x4
3
20
10
0
5
3
2
1
p
p
x5
2
5
17
5
0
20
5
2
p
p
x6
5
5
1
3
20
0
5
10
p
p
x7
5
10
2
2
5
5
0
1
p
p
p
x8
2
17
3
1
2
10
1
0
p
p
5 Clusters Rening
5.1 Mergering Clusters
If, after running clustering algorithm, two clusters are very close, can
merge them togather
Input: Parameter M and clusters C1 ; ; Cm
Find closest pair of clusters:
argmin
(Ck ; Cr ) = 1k;r
m;k6=r d(Ck ; Cr )
f
Even MBSAS and TTSAS can end up assigning f.v.'s to clusters that are
(utimately) farther away than other clusters
Possible because as clusters grow, representatives change, so distances to
clusters change
Hence might allow reassignment of f.v.'s after algorithm and merging completed
4