Optimization Algorithms for Detection of Social Interactions

Community detection is one of the most challenging and interesting problems in many research areas. Being able to detect highly linked communities in a network can lead to many benefits, such as understanding relationships between entities or interactions between biological genes, for instance. Two different immunological algorithms have been designed for this problem, called Opt-IA and Hybrid-IA, respectively. The main difference between the two algorithms is the search strategy and related immunological operators developed: the first carries out a random search together with purely stochastic operators; the last one is instead based on a deterministic Local Search that tries to refine and improve the current solutions discovered. The robustness of Opt-IA and Hybrid-IA has been assessed on several real social networks. These same networks have also been considered for comparing both algorithms with other seven different metaheuristics and the well-known greedy optimization Louvain algorithm. The experimental analysis conducted proves that Opt-IA and Hybrid-IA are reliable optimization methods for community detection, outperforming all compared algorithms.

[1]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[2]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[3]  V. Cutello,et al.  An Immune Metaheuristics for Large Instances of the Weighted Feedback Vertex Set Problem , 2019, 2019 IEEE Symposium Series on Computational Intelligence (SSCI).

[4]  Mario Pavone,et al.  DENSA: An effective negative selection algorithm with flexible boundaries for self-space and dynamic number of detectors , 2017, Eng. Appl. Artif. Intell..

[5]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

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

[7]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[9]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

[10]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[11]  Bo Xing,et al.  Gravitational Search Algorithm , 2014 .

[12]  Halife Kodaz,et al.  Community detection from biological and social networks: A comparative analysis of metaheuristic algorithms , 2017, Appl. Soft Comput..

[13]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[14]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[15]  Regina Berretta,et al.  MA-Net: A reliable memetic algorithm for community detection by modularity optimization , 2015 .

[16]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[17]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[18]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  KodazHalife,et al.  Community detection from biological and social networks , 2017 .

[20]  Ibrahim Eksin,et al.  A new optimization method: Big Bang-Big Crunch , 2006, Adv. Eng. Softw..

[21]  Walter Didimo,et al.  Fast layout computation of clustered networks: Algorithmic advances and experimental analysis , 2014, Inf. Sci..

[22]  Giuseppe Nicosia,et al.  Clonal selection: an immunological algorithm for global optimization over continuous spaces , 2012, J. Glob. Optim..

[23]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[24]  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.

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

[26]  Ilya R. Fischhoff,et al.  Network metrics reveal differences in social organization between two fission–fusion species, Grevy’s zebra and onager , 2007, Oecologia.

[27]  Xin-She Yang,et al.  A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.

[28]  Vincenzo Cutello,et al.  An Immunological Algorithm for Graph Modularity Optimization , 2019, UKCI.

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

[30]  Vincenzo Cutello,et al.  How long should offspring lifespan be in order to obtain a proper exploration? , 2016, 2016 IEEE Symposium Series on Computational Intelligence (SSCI).

[31]  Hossein Nezamabadi-pour,et al.  GSA: A Gravitational Search Algorithm , 2009, Inf. Sci..

[32]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[33]  Ulrik Brandes,et al.  On Modularity Clustering , 2008, IEEE Transactions on Knowledge and Data Engineering.

[34]  Pinar Civicioglu,et al.  Transforming geocentric cartesian coordinates to geodetic coordinates by using differential search algorithm , 2012, Comput. Geosci..

[35]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[36]  Fred W. Glover,et al.  Principles of scatter search , 2006, Eur. J. Oper. Res..