Skip to main content

Profile-Based Selection of Expert Groups

  • Conference paper
  • First Online:
Research and Advanced Technology for Digital Libraries (TPDL 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9819))

Included in the following conference series:

Abstract

In a wide variety of daily activities, the need of selecting a group of k experts from a larger pool of n candidates (\(k<n\)) based on some criteria often arises. Indicative examples, among many others, include the selection of program committee members for a research conference, staffing an organization’s board with competent members, forming a subject-specific task force, or building a group of project evaluators. Unfortunately, the process of expert group selection is typically carried out manually by a certain individual, which poses two significant shortcomings: (a) the task is particularly cumbersome, and (b) the selection process is largely subjective thus leading to results of doubtful quality. To address these challenges, in this paper, we propose an automatic profile-based expert group selection mechanism that is supported by digital libraries. To this end, we build textual profiles of candidates and propose algorithms that follow an IR-based approach to perform the expert group selection. Our approach is generic and independent of the actual expert group selection problem, as long as the candidate profiles have been generated. To evaluate the effectiveness of our approach, we demonstrate its applicability on the scenario of automatically building a program committee for a research conference.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We intend to make data and queries publicly available after the publication of this paper.

References

  1. Balog, K., Azzopardi, L., de Rijke, M.: Formal models for expert finding in enterprise corpora. In: Proceedings of SIGIR, pp. 43–50 (2006)

    Google Scholar 

  2. Balog, K., de Rijke, M.: Non-local evidence for expert finding. In: Proceedings of CIKM, pp. 489–498 (2008)

    Google Scholar 

  3. Bast, H., Chitea, A., Suchanek, F.M., Weber, I.: ESTER: efficient search on text, entities, and relations. In: Proceedings of SIGIR, pp. 671–678 (2007)

    Google Scholar 

  4. Demartini, G., Gaugaz, J., Nejdl, W.: A vector space model for ranking entities and its application to expert search. In: Boughanem, M., Berrut, C., Mothe, J., Soule-Dupuy, C. (eds.) ECIR 2009. LNCS, vol. 5478, pp. 189–201. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Fang, H., Zhai, C.X.: Probabilistic models for expert finding. In: Amati, G., Carpineto, C., Romano, G. (eds.) ECIR 2007. LNCS, vol. 4425, pp. 418–430. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Gollapalli, S.D., Mitra, P., Giles, C.L.: Ranking experts using author-document-topic graphs. In: Proceedings of JCDL, pp. 87–96 (2013)

    Google Scholar 

  7. Merelo-Guervós, J.J., Castillo-Valdivieso, P.: Conference paper assignment using a combined greedy/evolutionary algorithm. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 602–611. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Hochbaum, D.S.: Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 94–143. PWS Publishing Co., Boston (1997)

    Google Scholar 

  9. Hofmann, K., Balog, K., Bogers, T., de Rijke, M.: Contextual factors for finding similar experts. JASIST 61(5), 994–1014 (2010)

    Article  Google Scholar 

  10. Karimzadehgan, M., Zhai, C.: Constrained multi-aspect expertise matching for committee review assignment. In: Proceedings of CIKM, pp. 1697–1700 (2009)

    Google Scholar 

  11. Karimzadehgan, M., Zhai, C., Belford, G.G.: Multi-aspect expertise matching for review assignment. In: Proceedings of CIKM, pp. 1113–1122 (2008)

    Google Scholar 

  12. Robertson, S.E.: The probability ranking principle in IR. In: Robertson, S.E. (ed.) Readings in Information Retrieval, pp. 281–286. Morgan Kaufmann Publishers Inc., San Francisco (1997)

    Google Scholar 

  13. Serdyukov, P., Rode, H., Hiemstra, D.: Modeling multi-step relevance propagation for expert finding. In: Proceedings of CIKM, pp. 1133–1142 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Christos Doulkeridis .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Sfyris, G.A., Fragkos, N., Doulkeridis, C. (2016). Profile-Based Selection of Expert Groups. In: Fuhr, N., Kovács, L., Risse, T., Nejdl, W. (eds) Research and Advanced Technology for Digital Libraries. TPDL 2016. Lecture Notes in Computer Science(), vol 9819. Springer, Cham. https://doi.org/10.1007/978-3-319-43997-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-43997-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-43996-9

  • Online ISBN: 978-3-319-43997-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics