Searching for expertise in social networks: a simulation of potential strategies

  • Authors:
  • Jun Zhang;Mark S. Ackerman

  • Affiliations:
  • University of Michigan, Ann Arbor, MI;University of Michigan, Ann Arbor, MI

  • Venue:
  • GROUP '05 Proceedings of the 2005 international ACM SIGGROUP conference on Supporting group work
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

People search for people with suitable expertise all of the time in their social networks - to answer questions or provide help. Recently, efforts have been made to augment this searching. However, relatively little is known about the social characteristics of various algorithms that might be useful. In this paper, we examine three families of searching strategies that we believe may be useful in expertise location. We do so through a simulation, based on the Enron email data set. (We would be unable to suitably experiment in a real organization, thus our need for a simulation.) Our emphasis is not on graph theoretical concerns, but on the social characteristics involved. The goal is to understand the tradeoffs involved in the design of social network based searching engines.