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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balog, K., Azzopardi, L., Rijke, M., Formal models for expert finding in enterprise corpora. SIGIR 2006: 43-50
Campbell. C.S., Magio, P.P., Cozzi, A. Dom, Byron. (2003) Expertise Identification using email communications. CIKM 2003: 528-531.
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.
Dorigo, M., Blum, C., (2005) Ant Colony Optimization Theory: A Survey, Theoretical Computer Science 344 243-278.
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
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
Michlmayr, E., Pany, A., Kappel, G., Using Taxonomies for Content-based Routing with Ants, Journal of Computer Networks, Elsevier, 2007
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.
Schoonderwoerd, R., Holland, O., Bruten, J., Rothkratz, L. (1996), ”Ant-based load balancing in telecommunication networks”, Adaptive Behaviour, Vol. 5 pp.169-207.
Schwartz, M.F., andWood, D.C.M., (1993) Discovering shared interests using graph analysis. Commnications of the ACM, 36(8):78-89, 1993.
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.
Tomiyasu, H., Maekawa, T., Hara, T., Nishio, S. Profile-based Query Routing in a Mobile Social Network. MDM 2006: 105
Watts, Duncan J.; Strogatz, Steven H. (June 1998). ”Collective dynamics of ’small-world’ networks”. Nature 393: 440-442
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)