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.
|Original language||English (US)|
|Title of host publication||Social Computing, Behavioral Modeling, and Prediction, 2008|
|Editors||John J. Salerno, Michael J. Young, Huan Liu|
|Number of pages||9|
|State||Published - 2008|
|Event||1st International workshop on Social Computing, Behavioral Modeling and Prediction, 2008 - Phoenix, United States|
Duration: Apr 1 2008 → Apr 2 2008
|Name||Social Computing, Behavioral Modeling, and Prediction, 2008|
|Conference||1st International workshop on Social Computing, Behavioral Modeling and Prediction, 2008|
|Period||4/1/08 → 4/2/08|
Bibliographical notePublisher Copyright:
© 2008 Springer Science+Business Media, LLC.