Skip to main content
SpringerLink
Log in

Design of Japanese Tree Frog Algorithm for Community Finding Problems

  • Conference paper
  • First Online:
Intelligent Data Engineering and Automated Learning – IDEAL 2018 (IDEAL 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11315))

  • 1090 Accesses

Abstract

Community Finding Problems (CFPs) have become very popular in the last years, due to the high number of users that connect everyday to Social Networks (SNs). The goal of these problems is to group the users that compose the SN in several communities, or circles, in such a way similar users belong to the same community, whereas different users are assigned to different communities. Due to the high complexity of this problem, it is common that researchers use heuristic algorithms to perform this task in a reasonable computational time. This paper is focused on the applicability of a novel bio-inspired algorithm to solve CFPs. The selected algorithm is based on the real behaviour of the Japanese Tree Frog, that has been successfully used to colour maps and extract the Maximal Independent Set of a graph.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Stanford Network Analysis Project (SNAP): http://snap.stanford.edu/index.html.

References

  1. Aihara, I.: Modeling synchronized calling behavior of Japanese tree frogs. Phys. Rev. E 80, 011918 (2009)

    Article  Google Scholar 

  2. Airoldi, E.M., Blei, D.M., Fienberg, S.E., Xing, E.P.: Mixed membership stochastic blockmodels. J. Mach. Learn. Res. 9, 1981–2014 (2008)

    MATH  Google Scholar 

  3. Bakshy, E., Rosenn, I., Marlow, C., Adamic, L.: The role of social networks in information diffusion. In: Proceedings of the 21st International Conference on World Wide Web, pp. 519–528. ACM (2012)

    Google Scholar 

  4. Blum, C., Calvo, B., Blesa, M.J.: FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs. Swarm Intell. 9(2), 205–227 (2015)

    Article  Google Scholar 

  5. Cai, Q., Gong, M., Ma, L., Ruan, S., Yuan, F., Jiao, L.: Greedy discrete particle swarm optimization for large-scale social network clustering. Inf. Sci. 316, 503–516 (2015)

    Article  Google Scholar 

  6. Chang, J., Blei, D.M.: Hierarchical relational models for document networks. Ann. Appl. Stat. 4(1), 124–150 (2010)

    Article  MathSciNet  Google Scholar 

  7. Fernandez, M., Asif, M., Alani, H.: Understanding the roots of radicalisation on Twitter. In: Proceedings of the 10th ACM Conference on Web Science, pp. 1–10 (2018)

    Google Scholar 

  8. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99(12), 7821–7826 (2002)

    Article  MathSciNet  Google Scholar 

  9. Gonzalez-Pardo, A., Jung, J.J., Camacho, D.: ACO-based clustering for ego network analysis. Future Gener. Comput. Syst. 66, 160–170 (2017)

    Article  Google Scholar 

  10. Hernández, H., Blum, C.: Distributed graph coloring: an approach based on the calling behavior of Japanese tree frogs. Swarm Intell. 6(2), 117–150 (2012)

    Article  Google Scholar 

  11. Lara-Cabrera, R., Gonzalez-Pardo, A., Benouaret, K., Faci, N., Benslimane, D., Camacho, D.: Measuring the radicalisation risk in social networks. IEEE Access 5, 10892–10900 (2017)

    Article  Google Scholar 

  12. Lara-Cabrera, R., Gonzalez-Pardo, A., Camacho, D.: Statistical analysis of risk assessment factors and metrics to evaluate radicalisation in Twitter. Future Gener. Comput. Syst. (2017). https://doi.org/10.1016/j.future.2017.10.046. ISSN 0167-739X

  13. Lozano, M., García-Martnez, C., Rodríguez, F.J., Trujillo, H.M.: Optimizing network attacks by artificial bee colony. Inf. Sci. 377, 30–50 (2017)

    Article  Google Scholar 

  14. Mutazono, A., Sugano, M., Murata, M.: Frog call-inspired self-organizing anti-phase synchronization for wireless sensor networks. In: 2009 2nd International Workshop on Nonlinear Dynamics and Synchronization, pp. 81–88 (2009)

    Google Scholar 

  15. Pizzuti, C.: GA-net: a genetic algorithm for community detection in social networks. In: Rudolph, G., Jansen, T., Beume, N., Lucas, S., Poloni, C. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 1081–1090. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87700-4_107

    Chapter  Google Scholar 

  16. Sánchez-Oro, J., Duarte, A.: Iterated Greedy algorithm for performing community detection in social networks. Future Gener. Comput. Syst. 88, 785–791 (2018). https://doi.org/10.1016/j.future.2018.06.010. ISSN 0167-739X

    Article  Google Scholar 

  17. Wells, K.D.: The social behaviour of anuran amphibians. Anim. Behav. 25, 666–693 (1977)

    Article  Google Scholar 

  18. Xie, J., Kelley, S., Szymanski, B.K.: Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput. Surv. 45(4), 43:1–43:35 (2013)

    Article  Google Scholar 

  19. Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, WSDM 3, pp. 587–596. ACM (2013)

    Google Scholar 

Download references

Acknowledgements

This work has been co-funded by the following research projects: DeepBio (TIN2017-85727-C4-3-P) Spanish Ministry of Economy and Competitivity; CIBERDINE S2013/ICE-3095, under the European Regional Development Fund FEDER; and Justice Programme of the European Union (2014–2020) 723180 – RiskTrack – JUST-2015-JCOO-AG/JUST-2015-JCOO-AG-1. The contents of this publication are the sole responsibility of their authors and can in no way be taken to reflect the views of the European Commission.

Author information

Authors and Affiliations

  1. Computer Science Department, Universidad Autonoma de Madrid, Madrid, Spain

    Antonio Gonzalez-Pardo & David Camacho

Authors
  1. Antonio Gonzalez-Pardo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Camacho
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antonio Gonzalez-Pardo .

Editor information

Editors and Affiliations

  1. University of Manchester, Manchester, UK

    Hujun Yin

  2. Rm 209, Building B, Autonomous University of Madrid, Madrid, Spain

    David Camacho

  3. Campus of Gualtar, University of Minho, Braga, Portugal

    Paulo Novais

  4. University of Seville, Seville, Spain

    Antonio J. Tallón-Ballesteros

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gonzalez-Pardo, A., Camacho, D. (2018). Design of Japanese Tree Frog Algorithm for Community Finding Problems. In: Yin, H., Camacho, D., Novais, P., Tallón-Ballesteros, A. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2018. IDEAL 2018. Lecture Notes in Computer Science(), vol 11315. Springer, Cham. https://doi.org/10.1007/978-3-030-03496-2_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-03496-2_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-03495-5

  • Online ISBN: 978-3-030-03496-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation