Skip to main content

Advertisement

Springer Nature Link
Log in

A decomposition-based ant colony optimization algorithm for the multi-objective community detection

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

Community structure is an important feature of complex network and detecting community can help us understand the function of networks very well. Community detection can be considered as a multi-objective optimization problem and the heuristic operators have shown promising results in dealing with this problem. In this paper, a multi-objective community detection algorithm named MOCD-ACO is proposed by combining the heuristic operator of ant colony optimization (ACO) and the multi-objective evolutionary algorithmbased on decomposition (MOEA/D). MOCD-ACO can simultaneously decompose two objective functions, i.e., Negative Ratio Association and Ratio Cut, into a number of single-objective optimization problems. Each ant is responsible for searching for a solution to a sub-problem. All ants are divided into some groups, each group sharing a pheromone matrix. The ants use pseudo-random probability selection models to construct solutions. An ant updates its current solution if it has found a better one in terms of its own objective. To make the algorithm not easy to fall into the local optimal solution, the weighted simulated annealing local search operator is integrated into the framework to expand the search range. In the experiments, synthetic network datasets and real network datasets are used to evaluate the performance of MOCD-ACO. Compared with five state-of-the-art methods, our algorithm proves to be effective in terms of normalized mutual information and modularity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Angelini L, Boccaletti S, Marinazzo D, Pellicoro M, Stramaglia S (2007) Identification of network modules by optimization of ratio association. Chaos Interdiscip J Nonlinear Sci 17(2):175

    MATH  Google Scholar 

  • Atzmueller M, Doerfel S, Mitzlaff F (2016) Description-oriented community detection using exhaustive subgroup discovery. Inf Sci 329(C):965–984

    Google Scholar 

  • Bandyopadhyay S, Saha S, Maulik U, Deb K (2008) A simulated annealing-based multiobjective optimization algorithm: Amosa. IEEE Trans Evol Comput 12(3):269–283

    Google Scholar 

  • Bilal S, Abdelouahab M (2017) Evolutionary algorithm and modularity for detecting communities in networks. Phys A Stati Mech Appl 473

  • Chang H, Feng Z, Ren Z (2013) Community detection using ant colony optimization. In: Evolutionary computation, pp 3072–3078

  • Chen D, Zou F, Lu R, Yu L, Li Z, Wang J (2016) Multi-objective optimization of community detection using discrete teaching-learning-based optimization with decomposition. Inf Sci 369(C):402–418

    MathSciNet  Google Scholar 

  • Coello CAC, Veldhuizen DAV, Lamont GB (2007) Evolutionary algorithms for solving multi-objective problems. Springer, New York

    MATH  Google Scholar 

  • Danon L, Diazguilera A, Duch J, Arenas A (2005) Comparing community structure identification. J Stat Mech 2005(09):09008

    MATH  Google Scholar 

  • Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evol Comput 6(2):182–197

    Google Scholar 

  • Dorigo M, Stützle T (2010) Ant colony optimization: overview and recent advances. Springer, New York

    MATH  Google Scholar 

  • Fortunato S, Barthélemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci USA 104(1):36–41

    Google Scholar 

  • Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821–7826

    MathSciNet  MATH  Google Scholar 

  • Gmati H, Mouakher A, Gonzalez-Pardo A, Camacho D (2018) A new algorithm for communities detection in social networks with node attributes. J Ambient Intell Hum Comput 2018:1–13

    Google Scholar 

  • Gong M, Ma L, Zhang Q, Jiao L (2012) Community detection in networks by using multiobjective evolutionary algorithm with decomposition. Phys A Stat Mech Appl 391(15):4050–4060

    Google Scholar 

  • Gong M, Cai Q, Chen X, Ma L (2014) Complex network clustering by multiobjective discrete particle swarm optimization based on decomposition. IEEE Trans Evol Comput 18(1):82–97

    Google Scholar 

  • Guo B, Zhang D, Yu Z, Calabrese F (2014) Extracting social and community intelligence from digital footprints. J Ambient Intell Hum Comput 5(1):1–2

    Google Scholar 

  • Handl J, Knowles J (2007) An evolutionary approach to multiobjective clustering. IEEE Trans Evol Comput 11(1):56–76

    Google Scholar 

  • Hu B, Wang H, Yu X, Yuan W, He T (2017) Sparse network embedding for community detection and sign prediction in signed social networks. J Ambient Intell Hum Comput 2017:1–12

    Google Scholar 

  • Ke L, Zhang Q, Battiti R (2013) Moea/d-aco: a multiobjective evolutionary algorithm using decomposition and antcolony. IEEE Trans Cybern 43(6):1845–1859

    Google Scholar 

  • Khousa EA, Atif Y (2017) Social network analysis to influence career development. J Ambient Intell Hum Comput 9(3):1–16

    Google Scholar 

  • Kim M, Hiroyasu T, Miki M, Watanabe S (2004) Spea2+: Improving the performance of the strength pareto evolutionary algorithm 2. In: Parallel problem solving from nature-PPSN VIII 3242, vol 4, pp 742–751

    Google Scholar 

  • Knowles JD, Corne DW (2014) Approximating the nondominated front using the pareto archived evolution strategy. Evol Comput 8(2):149–172

    Google Scholar 

  • Li L, Jiao L, Zhao J, Shang R, Gong M (2017) Quantum-behaved discrete multi-objective particle swarm optimization for complex network clustering. Pattern Recogn 63:1–14

    Google Scholar 

  • Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54(4):396–405

    Google Scholar 

  • Moradi P, Ahmadian S, Akhlaghian F (2015) An effective trust-based recommendation method using a novel graph clustering algorithm. Phys A Stat Mech Appl 436:462–481

    Google Scholar 

  • Mu C, Zhang J, Jiao L (2014) An intelligent ant colony optimization for community detection in complex networks. In: Evolutionary computation, pp 700–706

  • Newman ME (2006) Modularity and community structure in networks. In: APS March Meeting, pp 8577–8582

    Google Scholar 

  • Pan WF, Jiang B, Li B (2013) Refactoring software packages via community detection in complex software networks. Int J Autom Comput 10(2):157–166

    Google Scholar 

  • Pizzuti C (2008) Ga-net: a genetic algorithm for community detection in social networks. In: International conference on parallel problem solving from nature: PPSN X, pp 1081–1090

    Google Scholar 

  • Pizzuti C (2012) A multiobjective genetic algorithm to find communities in complex networks. IEEE Trans Evol Comput 16(3):418–430

    Google Scholar 

  • Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifying communities in networks. Proc Natl Acad Sci USA 101(9):2658–2663

    Google Scholar 

  • Remy C, Rym B, Matthieu L (2017) Tracking bitcoin users activity using community detection on a network of weak signals. In: International conference on complex networks and their applications, pp 166–177

    Google Scholar 

  • Shahabi Sani N, Manthouri M, Farivar F (2018) A multi-objective ant colony optimization algorithm for community detection in complex networks. J Ambient Intell Hum Comput 2018:1–17

    Google Scholar 

  • Shi C, Yan Z, Cai Y, Wu B (2012) Multi-objective community detection in complex networks. Appl Soft Comput J 12(2):850–859

    Google Scholar 

  • Shim VA, Tan KC, Cheong CY (2012) A hybrid estimation of distribution algorithm with decomposition for solving the multiobjective multiple traveling salesman problem. IEEE Trans Syst Man Cybern Part C 42(5):682–691

    Google Scholar 

  • Tzle T, Hoos HH (2000) MAX-MIN Ant system, vol 16. Elsevier Science Publishers B. V, Oxford

    Google Scholar 

  • Wang B, Xu H, Yuan Y (2015) Scale adaptive reproduction operator for decomposition based estimation of distribution algorithm. In: Evolutionary computation, pp 2042–2049

  • Wang S, Zhan Z, Huang Q, Zhong Z, Li P, Huang M, Liu J (2018) Study on logistics network of yangtze river delta city groups: based on the method of social network analysis. J Ambient Intell Hum Comput 2018:1–7

    Google Scholar 

  • Wang Z, Wu Y, Li Q, Jin F, Xiong W (2016) Link prediction based on hyperbolic mapping with community structure for complex networks. Phys A Stat Mech Appl 450:609–623

    Google Scholar 

  • Wei YC, Cheng CK (1991) Ratio cut partitioning for hierarchical designs. IEEE Trans Comput Aided Des Integrat Circ Syst 10(7):911–921

    Google Scholar 

  • Xiao YS, Li BY, Wu QD (2004) Parallel model-learning ant colony optimization algorithm for TSP. Control Decis 19(8):885–888

    MathSciNet  Google Scholar 

  • You T, Cheng HM, Ning YZ, Shia BC, Zhang ZY (2016) Community detection in complex networks using density-based clustering algorithm and manifold learning. Phys A Stat Mech Appl 464:221–230

    Google Scholar 

  • Yu F, Chen M, Deng K, Xia X, Yu B, Gao H, He F, Ma L, Cai ZQ (2017) Community detection in the textile-related trade network using a biased estimation of distribution algorithm. J Ambient Intell Hum Comput 56(4):1–10

    Google Scholar 

  • Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452–473

    Google Scholar 

  • Zhang Q, Li H (2007) Moea/d: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731

    Google Scholar 

  • Zhang ZY, Wang Y, Ahn YY (2013) Overlapping community detection in complex networks using symmetric binary matrix factorization. Phys Rev E 87(6–1):062803

    Google Scholar 

  • Zhou X, Zhao X, Liu Y (2018) A multiobjective discrete bat algorithm for community detection in dynamic networks. Appl Intell 78(1):1–13

    Google Scholar 

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China (Grant no. 61802153).

Author information

Authors and Affiliations

  1. School of Internet of Things Engineering, Jiangnan University, Wuxi, 214122, China

    Ping Ji, Shanxin Zhang & ZhiPing Zhou

  2. Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Jiangnan University, Wuxi, 214122, China

    Shanxin Zhang & ZhiPing Zhou

Authors
  1. Ping Ji
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Shanxin Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. ZhiPing Zhou
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Shanxin Zhang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ji, P., Zhang, S. & Zhou, Z. A decomposition-based ant colony optimization algorithm for the multi-objective community detection. J Ambient Intell Human Comput 11, 173–188 (2020). https://doi.org/10.1007/s12652-019-01241-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-019-01241-1

Keywords