Skip to main content
SpringerLink
Log in
Book cover

International Conference on Theory and Practice of Digital Libraries

TPDL 2020: Digital Libraries for Open Knowledge pp 48–61Cite as

VeTo: Expert Set Expansion in Academia

  • Conference paper
  • First Online:

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

Abstract

Expanding a set of known domain experts with new individuals, that have similar expertise, is a problem with many practical applications (e.g., adding new members to a conference program committee). In this work, we study this problem in the context of academic experts and we introduce VeTo, a novel method to effectively deal with it by exploiting scholarly knowledge graphs. In particular, VeTo expands the given set of experts by identifying researchers that share similar publishing habits with them, based on a graph analysis approach. Our experiments show that VeTo is more effective than existing techniques that can be applied to deal with the same problem.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Notes

  1. 1.

    The last one may be larger than the others, however it is easy to take this into consideration.

  2. 2.

    We have also conducted experiments using DOC, the alternative graph-based approach proposed in the same paper, however it performed worse in all cases and its results were omitted from the experimental section for presentation reasons.

  3. 3.

    https://github.com/schatzopoulos/HeySim.

  4. 4.

    https://doi.org/10.5281/zenodo.3739316.

  5. 5.

    https://trec.nist.gov/.

References

  1. Balog, K., Azzopardi, L., de Rijke, M.: Formal models for expert finding in enterprise corpora. In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Seattle, Washington, USA, August 6–11, 2006, pp. 43–50 (2006)

    Google Scholar 

  2. Balog, K., de Rijke, M.: Finding similar experts. In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2007, pp. 821–822. Association for Computing Machinery, New York (2007). https://doi.org/10.1145/1277741.1277926

  3. Cao, Y., Liu, J., Bao, S., Li, H.: Research on expert search at enterprise track of TREC 2005. In: Proceedings of the Fourteenth Text Retrieval Conference, TREC 2005, Gaithersburg, Maryland, USA, November 15–18, 2005 (2005). http://trec.nist.gov/pubs/trec14/papers/microsoft-asia.ent.pdf

  4. Chen, H.H., Gou, L., Zhang, X., Giles, C.L.: Collabseer: a search engine for collaboration discovery. In: Proceedings of the 11th Annual International ACM/IEEE Joint Conference on Digital Libraries, JCDL 2011, pp. 231–240. Association for Computing Machinery, New York (2011). https://doi.org/10.1145/1998076.1998121

  5. Craswell, N., Hawking, D., Vercoustre, A.M., Wilkins, P.: P@noptic expert: searching for experts not just for documents. In: Ausweb Poster Proceedings, Queensland, Australia, vol. 15, p. 17 (2001)

    Google Scholar 

  6. Davenport, T.H., Prusak, L.: Working knowledge: how organizations manage what they know. Ubiquity 2000(August), 6 (2000)

    Article  Google Scholar 

  7. 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). https://doi.org/10.1007/978-3-540-71496-5_38

    Chapter  Google Scholar 

  8. Gollapalli, S.D., Mitra, P., Giles, C.L.: Similar researcher search in academic environments. In: Proceedings of the 12th ACM/IEEE-CS Joint Conference on Digital Libraries, JCDL 2012, pp. 167–170. Association for Computing Machinery, New York (2012). https://doi.org/10.1145/2232817.2232849

  9. Gollapalli, S.D., Mitra, P., Giles, C.L.: Ranking experts using author-document-topic graphs. In: 13th ACM/IEEE-CS Joint Conference on Digital Libraries, JCDL 2013, Indianapolis, IN, USA, July 22–26, 2013, pp. 87–96 (2013). https://doi.org/10.1145/2467696.2467707

  10. Gonçalves, R., Dorneles, C.F.: Automated expertise retrieval: a taxonomy-based survey and open issues. ACM Comput. Surv. 52(5), 96:1–96:30 (2019)

    Google Scholar 

  11. Jaradeh, M.Y., et al.: Open research knowledge graph: Next generation infrastructure for semantic scholarly knowledge. In: Proceedings of the 10th International Conference on Knowledge Capture, K-CAP 2019, Marina Del Rey, CA, USA, November 19–21, 2019, pp. 243–246 (2019). https://doi.org/10.1145/3360901.3364435

  12. Manghi, P., et al.: Openaire research graph dump, December 2019. https://doi.org/10.5281/zenodo.3516918

  13. Manghi, P., et al.: The openaire research graph data model, April 2019. https://doi.org/10.5281/zenodo.2643199

  14. Petkova, D., Croft, W.B.: Hierarchical language models for expert finding in enterprise corpora. Int. J. Artif. Intell. Tools 17(1), 5–18 (2008)

    Article  Google Scholar 

  15. Salatino, A., Osborne, F., Thanapalasingam, T., Motta, E.: The CSO classifier: ontology-driven detection of research topics in scholarly articles, pp. 296–311, August 2019

    Google Scholar 

  16. Salatino, A.A., Thanapalasingam, T., Mannocci, A., Osborne, F., Motta, E.: The computer science ontology: a large-scale taxonomy of research areas. In: Vrandečić, D., et al. (eds.) ISWC 2018. LNCS, vol. 11137, pp. 187–205. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00668-6_12

    Chapter  Google Scholar 

  17. Serdyukov, P., Hiemstra, D.: Modeling documents as mixtures of persons for expert finding. In: Macdonald, C., Ounis, I., Plachouras, V., Ruthven, I., White, R.W. (eds.) ECIR 2008. LNCS, vol. 4956, pp. 309–320. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78646-7_29

    Chapter  Google Scholar 

  18. Sfyris, G.A., Fragkos, N., Doulkeridis, C.: Profile-based selection of expert groups. In: Fuhr, N., Kovács, L., Risse, T., Nejdl, W. (eds.) TPDL 2016. LNCS, vol. 9819, pp. 81–93. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-43997-6_7

    Chapter  Google Scholar 

  19. Shi, C., Li, Y., Zhang, J., Sun, Y., Yu, P.S.: A survey of heterogeneousinformation network analysis. IEEE Trans. Knowl. Data Eng. 29(1), 17–37 (2017). https://doi.org/10.1109/TKDE.2016.2598561

  20. Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., Su, Z.: ArnetMiner: extraction and mining of academic social networks. In: Proceedings of the 14th ACM SIGKDD, pp. 990–998. ACM (2008)

    Google Scholar 

  21. Xiong, Y., Zhu, Y., Yu, P.S.: Top-k similarity join in heterogeneous information networks. IEEE Trans. Knowl. Data En. 27(6), 1710–1723 (2015)

    Article  Google Scholar 

  22. Yang, K., Kuo, T., Lee, H., Ho, J.: A reviewer recommendation system based on collaborative intelligence. In: 2009 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2009, Milan, Italy, 15–18 September 2009, Main Conference Proceedings, pp. 564–567 (2009). https://doi.org/10.1109/WI-IAT.2009.94

Download references

Acknowledgments

We acknowledge support of this work by the project “Moving from Big Data Management to Data Science” (MIS 5002437/3) which is implemented under the Action “Re-inforcement of the Research and Innovation Infrastructure”, funded by the Operational Programme “Competitiveness, Entrepreneurship and Innovation” (NSRF 2014–2020) and co-financed by Greece and the European Union (European Regional Development Fund).

Icons in Fig. 1 were collected from www.flaticon.com and were made by Freepik, Good Ware and Pixel perfect.

Author information

Authors and Affiliations

  1. IMSI, “Athena” Research Center, 15125, Athens, Greece

    Thanasis Vergoulis, Serafeim Chatzopoulos & Theodore Dalamagas

  2. Department of Informatics and Telecommunications, University of the Peloponnese, 22100, Tripoli, Greece

    Serafeim Chatzopoulos & Christos Tryfonopoulos

Authors
  1. Thanasis Vergoulis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Serafeim Chatzopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Theodore Dalamagas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christos Tryfonopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thanasis Vergoulis .

Editor information

Editors and Affiliations

  1. School of Computing and Communications, The Open University, Milton Keynes, UK

    Mark Hall

  2. Faculty of Arts, University of Ljubljana, Ljubljana, Slovenia

    Tanja Merčun

  3. University Library J. C. Senckenberg, Goethe University Frankfurt, Frankfurt am Main, Germany

    Thomas Risse

  4. Université Claude Bernard Lyon 1, Villeurbanne, France

    Fabien Duchateau

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Vergoulis, T., Chatzopoulos, S., Dalamagas, T., Tryfonopoulos, C. (2020). VeTo: Expert Set Expansion in Academia. In: Hall, M., Merčun, T., Risse, T., Duchateau, F. (eds) Digital Libraries for Open Knowledge. TPDL 2020. Lecture Notes in Computer Science(), vol 12246. Springer, Cham. https://doi.org/10.1007/978-3-030-54956-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-54956-5_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-54955-8

  • Online ISBN: 978-3-030-54956-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation