Generating Data for Testing Community Detection Algorithms

These days Internet usage has increased. People of all age groups use Internet and this has led to a new research field called complex networks. Complex networks such as social networks, biological networks, technological networks, etc., have become the interest of many researchers because of their wide range of applications. These complex networks have many properties like scale-free networks, transitivity, presence of community structure in these networks. Community detection is one of the most active fields in complex networks because it has many practical applications. In this paper we have studied about community detection. We have also discussed about the techniques of generating data for comparing various community detection algorithms.

[1]  Prasant Mohapatra,et al.  The impact of topology on overlay routing service , 2004, IEEE INFOCOM 2004.

[2]  Dino Pedreschi,et al.  A classification for community discovery methods in complex networks , 2011, Stat. Anal. Data Min..

[3]  Anne-Marie Kermarrec,et al.  Exploiting semantic proximity in peer-to-peer content searching , 2004, Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004..

[4]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[5]  J. Reichardt,et al.  Statistical mechanics of community detection. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Christos Gkantsidis,et al.  Spectral analysis of Internet topologies , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  Martin Rosvall,et al.  An information-theoretic framework for resolving community structure in complex networks , 2007, Proceedings of the National Academy of Sciences.

[9]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[10]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Natali Gulbahce,et al.  The art of community detection , 2008, BioEssays : news and reviews in molecular, cellular and developmental biology.

[12]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, Knowledge and Information Systems.

[13]  Sebastiano Vigna,et al.  The webgraph framework I: compression techniques , 2004, WWW '04.

[14]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[15]  Athina Markopoulou,et al.  Measurement of online social networks , 2010 .

[16]  A. Barabasi,et al.  The human disease network , 2007, Proceedings of the National Academy of Sciences.

[17]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[19]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.