Skip to main content

Table 5 Relation between network sizes and running times for IUPHAR and benchmark data sets for spectral partitioning and the Louvain algorithm as a community detection method in LPbyCD

From: LPbyCD: a new scalable and interpretable approach for Link Prediction via Community Detection in bipartite networks

Data set

Quotient IUPHAR/benchmark set

Network size

Running times

 

Spectral partitioning

Louvain algorithm

\(|V|^2\)

|E|

JC\(_{CC}\)

JC\(_{NC}\)

JC\(_{CC}\)

JC\(_{NC}\)

Enzyme

92.03

82.98

59.27

34.58

419.11

219.37

GPCR

1119.3

894.61

871.62

528.70

6926.28

3256.17

IC

660.39

605.22

492.60

253.56

5599.97

2525.81

NR

17685.67

14467.41

23185.33

9939.64

131599.25

67565.50

Kinase

435.17

263.73

349.88

204.35

1949.62

1185.36