Ralf Gehrer
Fabian Lindenberg
Distributed
Co-Clustering
Szenario
Der Gefangene
1
1
0
0
0
Sakrileg
L.A. Crash
Minority Report
1
0
0
1
0
0
0
1
1
0
1
1
0
1
1
1
Szenario
Der Gefangene
1
0
1
0
0
L.A. Crash
Sakrileg
Minority Report
0
1
0
1
0
1
0
1
0
1
0
1
1
0
1
2
Szenario
1
1
1
2
1
1
1
2
2
1
0
1
0
0
1
0
1
1
0
1
0
0
1
0
1
0
1
0
1
3
Szenario
1
1
2
2
1
1
1
2
2
1
1
0
0
0
0
1
1
1
1
0
0
0
0
1
1
0
0
1
1
4
Szenario
1
1
2
2
1
1
2
2
2
1
1
0
0
1
1
0
0
0
0
1
1
0
0
1
1
0
0
1
1
5
Algorithmus
repeat
R
for each row i = 1..m do
for each row group label = 1..k do
if error is smaller
r(i) = p
reorganize rows according to new labels
M
R
for each column j = 1..n do
...
reorganize colums
M
until error does not decrease
6
Kostenfunktion
7
Kostenfunktion
8
Kostenfunktion
9
Distributed
Co-Clustering
Literatur
S. Papadimitriou, J. Sun
“DisCo: Distributed Co-clustering
with Map-Reduce”
11
Literatur
D. Chakrabarti, S. Papadimitriou,
D. Modha, C. Faloutsos
“Fully Automatic CrossAssociations”
12