Skip to main content

An Ant Colony Optimization Approach to Expert Identification in Social Networks

  • Conference paper
Book cover Social Computing, Behavioral Modeling, and Prediction

Abstract

In a social network there may be people who are experts on a subject. Identifying such people and routing queries to such experts is an important problem. While the degree of separation between any node and an expert node may be small, assuming that social networks are small world networks, not all nodes may be willing to route the query because flooding the network with queries may result in the nodes becoming less likely to route queries in the future. Given this constraint and that there may be time constraints it is imperative to have an efficient way to identify experts in a network and route queries to these experts. In this paper we present an Ant Colony Optimization (ACO) based approach for expert identification and query routing in social networks. Also, even after one has identified the experts in the network, there may be new emerging topics for which there are not identifiable experts in the network. For such cases we extend the basic ACO model and introduce the notion of composibility of pheromones, where trails of different pheromones can be combined to for routing purposes.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balog, K., Azzopardi, L., Rijke, M., Formal models for expert finding in enterprise corpora. SIGIR 2006: 43-50

    Google Scholar 

  2. Campbell. C.S., Magio, P.P., Cozzi, A. Dom, Byron. (2003) Expertise Identification using email communications. CIKM 2003: 528-531.

    Google Scholar 

  3. Cohen. E., Fiat, A., and Kaplan, H. (2003) A Case for Associateive Peer to Peer Overlays. ACM SIGCOMM Computer Communications Review, 33(1):95-100, January 2003.

    Article  Google Scholar 

  4. Dorigo, M., Blum, C., (2005) Ant Colony Optimization Theory: A Survey, Theoretical Computer Science 344 243-278.

    Article  MATH  MathSciNet  Google Scholar 

  5. Kleinberg, J. and Raghavan, P. Query Incentive Networks. (2005) In FOCS ’05: 46th Annual IEEE Symposium on Foundations of Computer Science. Pittsburgh, PA, 132–141

    Google Scholar 

  6. Michlmayr, E., Pany, Graf., S. Applying Ant-based Multi-Agent Systems to Query Routing in Distributed Environments, Proceedings of the 3rd IEEE Conference On Intelligent Systems (IEEE IS06), London, UK, September 2006

    Google Scholar 

  7. Michlmayr, E., Pany, A., Kappel, G., Using Taxonomies for Content-based Routing with Ants, Journal of Computer Networks, Elsevier, 2007

    Google Scholar 

  8. Schelfthout, K., and Holvoet, T., (2003) A Pheromone-Based Coordination Mechanism Applied to Peer-to-Peer. In Agents and peer-to-Peer Computing, Second International Workshop (AP2PC 2003) volume 2872 of Lecture Notes in Computer Science, 71-76. Springner, July 2003.

    Google Scholar 

  9. Schoonderwoerd, R., Holland, O., Bruten, J., Rothkratz, L. (1996), ”Ant-based load balancing in telecommunication networks”, Adaptive Behaviour, Vol. 5 pp.169-207.

    Google Scholar 

  10. Schwartz, M.F., andWood, D.C.M., (1993) Discovering shared interests using graph analysis. Commnications of the ACM, 36(8):78-89, 1993.

    Article  Google Scholar 

  11. Tempich, C., Staab, S., and Wranik, A., Reminding: Semantic Query Routing in Peer-to-Peer Networks Based on Social Metaphors, Proc. 13th International World Wide Web Conf., pp. 640-649, 2004.

    Google Scholar 

  12. Tomiyasu, H., Maekawa, T., Hara, T., Nishio, S. Profile-based Query Routing in a Mobile Social Network. MDM 2006: 105

    Google Scholar 

  13. Watts, Duncan J.; Strogatz, Steven H. (June 1998). ”Collective dynamics of ’small-world’ networks”. Nature 393: 440-442

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this paper

Cite this paper

Ahmad, M.A., Srivastava, J. (2008). An Ant Colony Optimization Approach to Expert Identification in Social Networks. In: Liu, H., Salerno, J.J., Young, M.J. (eds) Social Computing, Behavioral Modeling, and Prediction. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77672-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-77672-9_14

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-77671-2

  • Online ISBN: 978-0-387-77672-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics