[ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ]

Journal of Information Science and Engineering, Vol. 34 No. 2, pp. 519-534

An Efficient Matching Algorithm for Fuzzy RDF Graph

1College of Computer Science and Engineering
Northeastern University
Shenyang, 110819 P.R. China

2College of Computer Science and Technology
Nanjing University of Aeronautics and Astronautics
Nanjing, 211106 P.R. China

3Collaborative Innovation Center of Novel Software Technology and Industrialization
Nanjing, 210023 P.R. China

The rapid growth of RDF (Resource Description Framework) data shows a steady trendy of decentralization. Identify correspondences among these data sources is an important task. Concentrating on the RDF data with fuzzy information, in this paper, we propose a unified framework combined multiple measures of similarity for automatically solving the problem of fuzzy RDF data matching. For this purpose, syntactic and semantic similarities are calculated based on element labels of RDF graph. Motivated by the structural characteristics of fuzzy RDF graph, we introduce an effective similarity measure approach by interactively utilizing structural information, in which we take fuzzy edge values and edge similarities into consideration. It is proved that the iterative computation of the proposed similarity approach converges. Finally, we combine these results of the individual metrics and extract the correspondences based on the total similarities. The experimental results show that our method can effectively identify correspondences among the fuzzy RDF graphs.

Keywords: fuzzy RDF, graph matching, similarity, iterative computation, label similarity, structural similarity

  Retrieve PDF document (JISE_201802_13.pdf)