Skip Navigation


The Computer Journal Advance Access originally published online on March 6, 2008
The Computer Journal 2009 52(7):729-748; doi:10.1093/comjnl/bxm112
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
52/7/729    most recent
bxm112v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Macdonald, C.
Right arrow Articles by Ounis, I.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2008. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

This article appears in the following The Computer Journal issue: Incorporating Profiling Expertise and Behaviour Special Issue [View the issue table of contents]

Searching for Expertise: Experiments with the Voting Model

Craig Macdonald* and Iadh Ounis

Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK

* Corresponding author: craigm{at}dcs.gla.ac.uk

Received 1 February 2007; revised 7 September 2007

In an expert search task, the user's need is to identify people who have relevant expertise to a topic of interest. An expert search system predicts and ranks the expertise of a set of candidate persons with respect to the user's query. In this work, we propose a novel approach for estimating and ranking candidate expertise with respect to a query. We see the problem of ranking experts as a voting problem, which we model using adaptations of data fusion techniques. We extensively investigate the effectiveness of the voting approach and the associated data fusion techniques across a range of document weighting models, in the context of the TREC 2005 and TREC 2006 Enterprise track settings. The evaluation results show that the voting paradigm is very effective, without using any collection-specific heuristics. Additionally, we further analyse two main features of the voting model, namely the manner in which document votes are combined and the effect of the underlying document ranking. First, for the combination of document votes, we hypothesise that candidate with large profiles can introduce bias in the generated ranking of candidates. We propose and integrate into the model a candidate length normalisation technique that removes bias towards prolific candidate experts. Secondly, we investigate the relative effects of applying various retrieval enhancing techniques to improve the quality of the underlying document ranking, to investigate how each technique improves the retrieval effectiveness of the generated ranking of candidates. At each stage, we experiment extensively and draw conclusions. Our results show that the voting techniques proposed are indeed effective, across several different document weighting models and settings. Secondly, we see that candidate profile length normalisation can help improve retrieval accuracy when applied to the candidate profile sets. Lastly, we show that increasing the quality of the underlying ranking of candidates can enhance the retrieval accuracy of the generated ranking of candidates.

Key Words: Expert search • expert finding • voting model • information retrieval • enterprise information retrieval


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.