Skip to main content

Exploiting Interlinked Research Metadata

  • Conference paper
  • First Online:

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

Abstract

OpenAIRE, the Open Access Infrastructure for Research in Europe, aggregates metadata about research (projects, publications, people, organizations, etc.) into a central Information Space. OpenAIRE aims at increasing interoperability and reusability of this data collection by exposing it as Linked Open Data (LOD). By following the LOD principles, it is now possible to further increase interoperability and reusability by connecting the OpenAIRE LOD to other datasets about projects, publications, people and organizations. Doing so required us to identify link discovery tools that perform well, as well as candidate datasets that provide comprehensive scholarly communication metadata, and then to specify linking rules. We demonstrate the added value that interlinking provides for end users by implementing visual frontends for looking up publications to cite, and publication statistics, and evaluating their usability on top of interlinked vs. non-interlinked data.

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

Buying options

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.

    https://tw.rpi.edu/web/project/RDESC.

  2. 2.

    http://tinyurl.com/OALOD.

  3. 3.

    http://lod.openaire.eu/sparql.

  4. 4.

    http://aksw.org/Projects/LIMES.html.

  5. 5.

    http://silkframework.org/.

  6. 6.

    https://datahub.io/.

  7. 7.

    https://wikipedia.org/Levenshtein_distance.

  8. 8.

    https://www.fiduswriter.org.

  9. 9.

    Note that the encoding problem (‘Sören Auer’ in OA instead of ‘Sören Auer’ in DBLP) stems from the OA data.

  10. 10.

    https://wikipedia.org/wiki/System_Usability_Scale.

References

  1. Ameri, S.: Exploiting interlinked research metadata to provide recommendations for authors of scientific papers. MA thesis. University of Bonn (2017). http://eis-bonn.github.io/Theses/2017/Shirin_Ameri/thesis.pdf

  2. Bauer, F., Kaltenböck, M.: Linked Open Data: The Essentials (2011)

    Google Scholar 

  3. Hallo, M., Luján-Mora, S., Cháez, C.: An approach to publish scientific data of open-access journals using linked open data technologies. In: EDULEARN (2014)

    Google Scholar 

  4. JQuery UI 1.12 API Documentation. https://jqueryui.com/dialog/

  5. Purohit, S., et al.: Effective tooling for linked data publishing in scientific research. In: International Conference on Semantic Computing (2016)

    Google Scholar 

  6. Rajabi, E., Sicilia, M.-A., Sanchez-Alonso, S.: Discovering duplicate and related resources using an interlinking approach: the case of educational datasets. J. Inf. Sci. 41(3), 329–341 (2015)

    Article  Google Scholar 

  7. Rajabi, E., Sicilia, M.-A., Sanchez-Alonso, S.: Interlinking educational resources to web of data through IEEE LOM. Comput. Sci. Inf. Syst. 12(1), 233–255 (2015)

    Article  Google Scholar 

  8. Rajabi, E., et al.: Interlinking educational data to web of data. In: Big Data Optimization: Recent Developments and Challenges (2015)

    Google Scholar 

  9. Rettberg, N., Schmidt, B.: OpenAIRE supporting a european open access mandate. Coll. Res. Libr. News 76(6), 306–310 (2015)

    Article  Google Scholar 

  10. Rodichevski, A.: Approximate String Matching Algorithms. http://www.morfoedro.it/doc.php?n=223&lang=en

  11. Simperl, E., et al.: Combining human and computation intelligence: the case of data interlinking tools. Int. J. Metadata Semant. Ontol. 7(2), 77–92 (2012)

    Article  Google Scholar 

  12. Stackoverflow: Difference between Jaro-Winkler and Levenshtein distance. http://stackoverflow.com/questions/25540581/difference-betweenjaro-winkler-and-levenshtein-distance

  13. Uyar, E., Brehmer, S., Athamnah, M.: Accessing, Analyzing and Linking Data from DBLP with other Internet Resources (2013)

    Google Scholar 

  14. Vahdati, S., et al.: LOD Services. Deliverable D8.2. OpenAIRE2020 (2015)

    Google Scholar 

  15. Vahdati, S., Karim, F., Huang, J.-Y., Lange, C.: Mapping large scale research metadata to linked data: a performance comparison of HBase, CSV and XML. In: Garoufallou, E., Hartley, R.J., Gaitanou, P. (eds.) MTSR 2015. CCIS, vol. 544, pp. 261–273. Springer, Cham (2015). doi:10.1007/978-3-319-24129-6_23. arXiv:1506.04006 [cs.DB]

    Chapter  Google Scholar 

Download references

Acknowledgments

This work has been partially funded by European Commission grant 643410 (OpenAIRE) and by DFG grant AU 340/9-1. This work has been partially funded by the European Commission with a grant for the H2020 project OpenAIRE2020 (GA no. 643410) and OpenBudgets.eu (GA no. 645833).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sahar Vahdati .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Ameri, S., Vahdati, S., Lange, C. (2017). Exploiting Interlinked Research Metadata. In: Kamps, J., Tsakonas, G., Manolopoulos, Y., Iliadis, L., Karydis, I. (eds) Research and Advanced Technology for Digital Libraries. TPDL 2017. Lecture Notes in Computer Science(), vol 10450. Springer, Cham. https://doi.org/10.1007/978-3-319-67008-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67008-9_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67007-2

  • Online ISBN: 978-3-319-67008-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics