www-ai.cs.tu-dortmund.de/LEHRE/SEMINARE/SS09/AKTARBEITENDESDM/LITERATUR/CommunityDiscovery.pdf
LNAI 5212 - Hierarchical, Parameter-Free Community Discovery
Let A2 := {0, · · · , 0, 1, · · · , 1} with all similar values contiguous. We have again C(A2|M (1)
2 ) = 16 and C(M (1) 2 ) = 15. But, for M (2)
2 the best choice is n1 = n2 = 8 so that C(A2|M (2)
2 ) = [...] first-level decomposition of Figures 2a and 3 follows such a structure, consisting of G1 = (I1, J1, A1,1), G2 = (I1, J2, A1,2), G3 = (I2, J1, A2,1), and G4 = (I2, J2, A2,2), where I1 is the set of “computer [...] Pathology
(b) Second level
Fig. 2. Adjacency matrix view (cf. Figure 1)
edge code
1
I1
I2
J2J1
G3 G4
G2
G5 G7 G8
G6 G9
G16
G14 G15
G13
G11 G12
G10
{ , }I1 I2 { , }J1 J2
Level 2
G
A2,1!( )
G
Level 0
Level 1
Fig …