Loading [MathJax]/extensions/MathMenu.js
GDup: De-Duplication of Scholarly Communication Big Graphs | IEEE Conference Publication | IEEE Xplore

GDup: De-Duplication of Scholarly Communication Big Graphs


Abstract:

Today, several online services offer functionalities to access information from big scholarly communication graphs, which interlink entities such as publications, authors...Show More

Abstract:

Today, several online services offer functionalities to access information from big scholarly communication graphs, which interlink entities such as publications, authors, datasets, organizations, etc. Such graphs are often populated over time as aggregations of multiple sources and therefore suffer from entity duplication problems. Although deduplication of graphs is a known and actual problem, solutions tend to be dedicated and address a few of the underlying challenges. In this paper, we propose the GDup system, an integrated, scalable, general-purpose system for entity deduplication over big information graphs. GDup supports practitioners with the functionalities needed to realize a fully-fledged entity deduplication workflow over a generic input graph, inclusive of Ground Truth support, end-user feedback, and strategies for identifying and merging duplicates to obtain an output disambiguated graph. GDup is today one of the core components of the OpenAIRE infrastructure production system, monitoring Open Science trends on behalf of the European Commission.
Date of Conference: 17-20 December 2018
Date Added to IEEE Xplore: 10 January 2019
ISBN Information:
Conference Location: Zurich, Switzerland

Contact IEEE to Subscribe

References

References is not available for this document.