Mining the evolution of networks using Local-Cross-Communities-Paradigm

Mining how network evolves is a crucial topic in extracting underlying information from networks. Among all the mechanisms, Common Neighbor (CN) and Preferential Attachment (PA) are basic and efficient. Recently, a new framework named Local-Community-Paradigm (LCP) provides a self-organized mechanism about the evolution of networks. Via using community mechanism instead, we propose a variant named Local-Cross-Communities-Paradigm (LCCP). We compare the four mechanisms and test them on link prediction problems. Empirical analysis on twelve real networks show that LCCP performs better than CN, PA and LCP.

[1]  M. Newman Clustering and preferential attachment in growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Tao Zhou,et al.  Evaluating network models: A likelihood analysis , 2011, ArXiv.

[3]  Donald E. Knuth,et al.  The Stanford GraphBase - a platform for combinatorial computing , 1993 .

[4]  Zhou Tao,et al.  Detecting Overlapping Communities Based on Community Cores in Complex Networks , 2010 .

[5]  António Pedro Souto,et al.  Application of nanotechnology in antimicrobial finishing of biomedical textiles , 2014 .

[6]  Linyuan Lü,et al.  Similarity index based on local paths for link prediction of complex networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  M. Newman,et al.  Vertex similarity in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.