Modeling Multi-step Relevance Propagation for Expert Finding

Pavel Serdyukov, H. Rode, Djoerd Hiemstra

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

85 Citations (Scopus)
165 Downloads (Pure)


An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. This paper proposes a novel approach to expert finding in large enterprises or intranets by modeling candidate experts (persons), web documents and various relations among them with so-called expertise graphs. As distinct from the state-of-the-art approaches estimating personal expertise through one-step propagation of relevance probability from documents to the related candidates, our methods are based on the principle of multi-step relevance propagation in topic-specific expertise graphs. We model the process of expert finding by probabilistic random walks of three kinds: finite, infinite and absorbing. Experiments on TREC Enterprise Track data originating from two large organizations show that our methods using multi-step relevance propagation improve over the baseline one-step propagation based method in almost all cases.
Original languageUndefined
Title of host publicationProceeding of the 17th ACM Conference on Information and Knowledge Management (CIKM2008)
Place of PublicationNew York
PublisherAssociation for Computing Machinery
Number of pages10
ISBN (Print)978-1-59593-991-3
Publication statusPublished - Oct 2008
Event17th ACM Conference on Information and Knowledge Management, CIKM 2008 - Napa Valley, United States
Duration: 26 Oct 200830 Oct 2008
Conference number: 17

Publication series



Conference17th ACM Conference on Information and Knowledge Management, CIKM 2008
Abbreviated titleCIKM
Country/TerritoryUnited States
CityNapa Valley


  • EWI-13455
  • CR-H.3
  • METIS-251189
  • CR-H.3.3

Cite this