<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jun Zhang</style></author><author><style face="normal" font="default" size="100%">Mark S. Ackerman</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Searching for Expertise in Social Networks:  A Simulation of Potential Strategies</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Conference on Group Work (Group'05)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">expertise finding</style></keyword><keyword><style  face="normal" font="default" size="100%">expertise location</style></keyword><keyword><style  face="normal" font="default" size="100%">online communities</style></keyword><keyword><style  face="normal" font="default" size="100%">simulation</style></keyword><keyword><style  face="normal" font="default" size="100%">social computing</style></keyword><keyword><style  face="normal" font="default" size="100%">social networks</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.eecs.umich.edu/~ackerm/pub/05b38/zhang-ackerman.group05.final.pdf</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">71-80</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div style=&quot;margin: 0in 0in 2pt&quot;&gt;&lt;font size=&quot;2&quot;&gt;People search for people with suitable expertise all of the time in their social networks &amp;ndash; to answer questions or provide help.&amp;nbsp;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.&amp;nbsp;(We would be unable to suitably experiment in a real organization, thus our need for a simulation.)&amp;nbsp;Our emphasis is not on graph theoretical concerns, but on the social characteristics involved.&amp;nbsp;The goal is to understand the tradeoffs involved in the design of social network based searching engines.&lt;/font&gt;&lt;/div&gt;</style></abstract></record></records></xml>
