5 4 134 95 2560 14.2 78 3 "toyota corona" "158" 15 8 350 145 4440 14 75 1 "chevrolet bel air" "339" 27.2 4 135 84 2490 15.7 81 1 "plymouth reliant" "278" 16.2 6 163 133 3410 15.8 78 2 "peugeot 604sl" "10" [...] "322" 32.2 4 108 75 2265 15.2 80 3 "toyota corolla" "213" 16.5 8 350 180 4380 12.1 76 1 "cadillac seville" "67" 17 8 304 150 3672 11.5 72 1 "amc ambassador sst" "23" 25 4 104 95 2375 17.5 70 2 "saab 99e" [...] ambassador dpl" "326" 44.3 4 90 48 2085 21.7 80 2 "vw rabbit c (diesel)" "232" 15.5 8 400 190 4325 12.2 77 1 "chrysler cordoba" "377" 37 4 91 68 2025 18.2 82 3 "mazda glc custom l" "25" 21 6 199 90 2648 …

05_2_moschitti_214.pdf

〈n1, n2〉 such that (p(n1) = p(n2)) ∈ L1∩L2. Step (iii) may require only O(|NT1 |+ |NT2 |) time, but, if p(n1) appears r1 times in T1 and p(n2) is repeated r2 times in T2, we need to consider r1 × r2 pairs [...] and*/ n2 = extract(L2); /*remove it from the list*/ while (n1 and n2 are not NULL) if (production of(n1) > production of(n2)) then n2 = extract(L2); else if (production of(n1) < production of(n2)) then [...] s at n1 and n2 are different then ∆(n1, n2) = 0; 2. if the productions at n1 and n2 are the same, and n1 and n2 have only leaf children (i.e. they are pre-terminals symbols) then ∆(n1, n2) = 1; 3. if the …

05_2_moschitti_214.pdf

〈n1, n2〉 such that (p(n1) = p(n2)) ∈ L1∩L2. Step (iii) may require only O(|NT1 |+ |NT2 |) time, but, if p(n1) appears r1 times in T1 and p(n2) is repeated r2 times in T2, we need to consider r1 × r2 pairs [...] and*/ n2 = extract(L2); /*remove it from the list*/ while (n1 and n2 are not NULL) if (production of(n1) > production of(n2)) then n2 = extract(L2); else if (production of(n1) < production of(n2)) then [...] s at n1 and n2 are different then ∆(n1, n2) = 0; 2. if the productions at n1 and n2 are the same, and n1 and n2 have only leaf children (i.e. they are pre-terminals symbols) then ∆(n1, n2) = 1; 3. if the …

LNAI 5211 - A Fast Algorithm to Find Overlapping Communities in Networks

because these contain very few communities. 0 0.2 0.4 0.6 0.8 1 1.2 1.5 1.8 2.1 2.4 2.7 3 3.3 3.6 Average number of communities per vertex (r) CONGO: h=2 h=3 CONGA CFinder: k=3 k=4 k=5 k=6 Fig. 5. F-measure [...] pass through; see Figs. 1(c) and 2(c). 2.3 The CONGO Algorithm The CONGO algorithm is the same as CONGA (Section 2.1) but using local be- tweenness, explained in Section 2.2. The complete CONGO algorithm [...] set Vv,h = {w : d(v,w) ! h} (2) For example, Fig. 1(a) shows a small network with the 2-region of edge {h,i} shown shaded. Fig. 2(a) shows another network, highlighting the 2-region of vertex u. A Fast Algorithm …