Skip to main content
SpringerLink
Log in

Using the ACO algorithm for path searches in social networks

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

One of the most important types of applications currently being used to share knowledge across the Internet are social networks. In addition to their use in social, professional and organizational spheres, social networks are also frequently utilized by researchers in the social sciences, particularly in anthropology and social psychology. In order to obtain information related to a particular social network, analytical techniques are employed to represent the network as a graph, where each node is a distinct member of the network and each edge is a particular type of relationship between members including, for example, kinship or friendship. This article presents a proposal for the efficient solution to one of the most frequently requested services on social networks; namely, taking different types of relationships into account in order to locate a particular member of the network. The solution is based on a biologically-inspired modification of the ant colony optimization algorithm.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adamic L, Adar E (2005) How to search a social network. Soc Netw 27(3):187–203

    Article  Google Scholar 

  2. Alba E, Chicano F (2007) ACOhg: dealing with huge graph. In: Proceedings of the genetic and evolutionary computation conference of 2007, pp 10–17

    Chapter  Google Scholar 

  3. Angus D, Hendtlass T (2005) Dynamic ant colony optimisation. Appl Intell 23(1):33–38

    Article  MATH  Google Scholar 

  4. Bast H, Funke S, Matijevic D, Sanders P, Schultes D (2007) In transit to constant shortest-path queries in road networks. In: Proceedings of workshop on algorithm engineering and experiments of 2007

    Google Scholar 

  5. Chan EPF, Lim H (2007) Optimization and evaluation of shortest path queries. VLDB J 16(3):343–369

    Article  Google Scholar 

  6. Chan EPF, Zhang J (2007) A fast unified optimal route query evaluation algorithm. In: Proceedings of the 16th ACM conference on conference on information and knowledge management, pp 371–380

    Chapter  Google Scholar 

  7. Chang R-S, Chang J-S, Lin P-S (2009) An ant algorithm for balanced job scheduling in grids. Future Gener Comput Syst 25(1):20–27

    Article  Google Scholar 

  8. De Oliveira SM (2009) A study of pheromone modification strategies for using ACO on the dynamic vehicle routing problem. In: Doctoral symposium on engineering stochastic local search algorithms of 2009, pp 6–10

    Google Scholar 

  9. Delling D, Sanders P, Schultes D, Wagner D (2006) Highway hierarchies star. In: The shortest path problem: 9th DIMACS implementation challenge. DIMACS book, vol 74, pp 141–174

    Google Scholar 

  10. Delling D, Holzer M, Müller K, Schulz F, Wagner D (2009) High-performance multi-level routing. Ser Discrete Math Theor Comput Sci 74:73–92

    Google Scholar 

  11. Di Caro G, Ducatelle F, Gambardella LM (2005) AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks. Eur Trans Telecommun 16(5):443–455. Special Issue on Self Organ Mob Netw

    Article  Google Scholar 

  12. Dorigo M (1992) Optimization, learning and natural algorithms. Doctoral Thesis, Dipartamento di Elettronica, Politecnico di Milano, Italy

  13. Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344:243–278

    Article  MathSciNet  MATH  Google Scholar 

  14. Dorigo M, Stützle T (2004) Ant colony optimization. MIT Press, Cambridge

    Book  MATH  Google Scholar 

  15. Favuzza S, Graditi G, Sanseverino E (2006) Adaptive and dynamic ant colony search algorithm for optimal distribution systems reinforcement strategy. Appl Intell 24(1):31–42

    Article  Google Scholar 

  16. Feng G, Li C, Gu Q, Lu S, Chen D (2006) SWS: small world based search in structured peer-to-peer systems. In: Proceedings on the international conference on grid and cooperative computing workshops of 2006, pp 341–348

    Chapter  Google Scholar 

  17. Ippolito MG, Morana G, Riva Sanseverino E, Vuinovich F (2005) Ant colony search algorithm for optimal strategical planning of electrical distribution systems expansion. Appl Intell 23(3):139–152

    Article  Google Scholar 

  18. Jaén J, Mocholí JA, Catalá A, Navarro E (2011) Digital ants as the best cicerones for museum visitors. Appl Soft Comput 11(1):111–119

    Article  Google Scholar 

  19. Kautz H, Selman B, Shah M (1997) Referral Web: combining social networks and collaborative filtering. Commun ACM 40(3):63–65

    Article  Google Scholar 

  20. Lee C-Y, Lee Z-J, Lin S-W, Ying K-C (2010) An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem. Appl Intell 32(1):88–95

    Article  Google Scholar 

  21. Leskovec J (2010) SNAP: network datasets: epinions social network. Stanford University. http://snap.stanford.edu/data/soc-sign-epinions.html. Accessed 09 November 2010

  22. Leskovec J (2010) SNAP: network datasets: slashdot social network. Stanford University. http://snap.stanford.edu/data/soc-Slashdot0902.html. Accessed 09 November 2010

  23. Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45(2):167–256

    Article  MathSciNet  MATH  Google Scholar 

  24. Ramos GN, Hatakeyama Y, Dong F, Hirota K (2009) Hyperbox clustering with ant colony optimization (HACO) method and its application to medical risk profile recognition. Appl Soft Comput 9(2):632–640

    Article  Google Scholar 

  25. Rivero J (2009) Fast search of paths through huge networks. In: Doctoral symposium on engineering stochastic local search algorithms of 2009, pp 46–50

    Google Scholar 

  26. Sandberg O (2006) Distributed routing in small-world networks. In: Proceedings of the 8th workshop on algorithm engineering and experiments, pp 144–155

    Google Scholar 

  27. Sankaranarayanan J, Samet H (2009) Distance oracles for spatial networks. In: Proceedings of the 25th IEEE international conference on data engineering, pp 652–663

    Chapter  Google Scholar 

  28. Sankaranarayanan J, Samet H, Alborzi H (2009) Path oracles for spatial networks. In: Proceedings of the 35th international conference on very large data bases, pp 1210–1221

    Google Scholar 

  29. Supratid S, Kim H (2009) Modified fuzzy ants clustering approach. Appl Intell 31(2):122–134

    Article  Google Scholar 

  30. Tang L, Liu H (2010) Graph mining applications to social network análisis. In: Aggarwal C, Wang H (eds) Managing and mining graph data. Advances in DataBase systems, vol 40, pp 487–514

    Chapter  Google Scholar 

  31. Yu JX, Cheng J (2010) Graph reachability queries: a survey. In: Aggarwal C, Wang H (eds) Managing and mining graph data. Advances in DataBase systems, vol 40, pp 181–215

    Chapter  Google Scholar 

  32. Yuan W, Guan D, Lee Y-K, Lee S (2010) The small-world trust network. Appl Intell 1–12. ISSN 0924-669X

  33. Zhang N, Feng Z-R, Ke L-J (2010) Guidance-solution based ant colony optimization for satellite control resource scheduling problem. Appl Intell 1–9. ISSN 0924-669X

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Carlos III University of Madrid, Avd. Universidad, 30, 28911, Leganés, Madrid, Spain

    Jessica Rivero, Dolores Cuadra, Javier Calle & Pedro Isasi

Authors
  1. Jessica Rivero
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dolores Cuadra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Javier Calle
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pedro Isasi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jessica Rivero.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rivero, J., Cuadra, D., Calle, J. et al. Using the ACO algorithm for path searches in social networks. Appl Intell 36, 899–917 (2012). https://doi.org/10.1007/s10489-011-0304-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-011-0304-1

Keywords

Search

Navigation