A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
JSAI Technical Report, Type 2 SIG
Linked Open Data (LOD) has a graph structure, where nodes are represented by URIs, and thus LOD sets are connected and searched through different domains. In fact, however, 5% of values are literal (string without URI) even in DPpedia, which is a defacto hub of LOD. Therefore, this paper proposes a method to identify and aggregate the literal nodes in order to give an URI to the literals of the same meaning and to promote the data linkage. Our method regards part of the LOD graph structure asdoi:10.11517/jsaisigtwo.2014.swo-032_07 fatcat:4spwfa2hsvdfvnjczlu7eyykum