Slide 17
Slide 17 text
17
Multi-view splitting K-means algorithm
Given a (hard or fuzzy) clustering matrix = (,
) with K clusters, at each step:
Identify the cluster
that minimizes our criterion
Split this cluster in two, ሚ
1
and ሚ
2
, such that the criterion is minimized, under the
constraint that ,1
+ ,2
= ,
for all
Update per-view cluster centers
Update weight matrix = (,
) for this split for all = 1, … , and = 1, … , + 1
Godichon-Baggioni et al. (2020) AOAS
1 2 3 4
1 5
4 6
=
3
1
5