A Fuzzy RDF Graph-Matching Method Based on Neighborhood Similarity

A Fuzzy RDF Graph-Matching Method Based on Neighborhood Similarity

Guanfeng Li (Ningxia University, China) and Zongmin Ma (Nanjing University of Aeronautics and Astronautics, China)
DOI: 10.4018/978-1-5225-8446-9.ch009
OnDemand PDF Download:
List Price: $37.50
10% Discount:-$3.75


With the popularity of fuzzy RDF data, identifying correspondences among these data sources is an important task. Although there are some solutions addressing this problem in classical RDF datasets, existing methods do not consider fuzzy information which is an important property existing in fuzzy RDF graphs. In this article, we apply fuzzy graph to model the fuzzy RDF datasets and propose a novel similarity-oriented RDF graph matching approach, which makes full use of the 1-hop neighbor vertex and edge label information, and takes into account the fuzzy information of a fuzzy RDF graph. Based on the neighborhood similarity, we propose a breadth-first branch-and-bound method for fuzzy RDF graph matching, which uses a state space search method and uses truncation parameters to constrain the search. This algorithm can be used to identify the matched pairs.
Chapter Preview


Resource description framework (RDF) (Klyne & Carroll, 2006) is a standard data model recommended by the World Wide Web Consortium (W3C) to capture resource information the context of the semantic web (Berners-Lee, Hendler, & Lassila, 2001). This model represents data as sets of triples where each triple consists of three elements that are referred to as the subject, the predicate, and the object of the triple. These triples allow users to describe arbitrary things in terms of their attributes and their relationships to other things. At the same time, information is often vague or imprecise in the real-world applications. Therefore, the study of fuzzy extension of RDF models has emerged (Ma, Li, & Yan, 2018; Ma, & Yan, 2018; Mazzieri, & Dragoni, 2008; Straccia, 2009). Nowadays fuzzy RDF has been widely used in a variety of real scenarios (Pivert, Slama, & Thion, 2016; Zhang, 2017).

An increasing amount of data is becoming available in RDF format. Multiple datasets are effectively published according to the linked-data principles (Zhang, Song, He, Shi, & Dong, 2012). Integrating these datasets through interlink or fusion is needed in order to assure interoperability between the resources composing them. To do this, we need to automatically discover the correspondence between these data sources in different information stores. Data matching is the process of bringing data from different data sources together and comparing them in order to find out whether they represent the same real-world object in a given domain (Dorneles, Gonçalves, & dos Santos Mello, 2011). Efficient RDF data matching becomes the technical foundation of many tasks in Semantic Web (Li, & Ma, 2018; Zou, & Özsu, 2017).

Fuzzy RDF data have a natural representation in the form of a labeled directed graph in which the vertices present the resources and values (also called literals), and edges represent semantic relationships between resources. So, RDF data matching problem has been often addressed in terms of graph matching approach. Graph matching is usually based on the graph isomorphism or homomorphism, combining a specific application environment to find similar topology graph. Some works (Carroll, 2002) has been dedicated to the search for the best match between two graphs or subgraphs. Unfortunately, the traditional graph matching algorithms based on graph isomorphic have been proved that its complexity is NP-complete (Ullmann, 1976). For this reason, some works (Costabello, 2014; Dorneles, Gonçalves, & Mello, 2011) of approximate matching based on similarity or distance metrics use a specific index structure to reduce the complexity of RDF graph matching. However, these approximate matching approaches ignored many features of RDF graph. Firstly, these approaches only take the similarity of vertices and edges into account in RDF graph, do not concern structure among the vertices and edges. Secondly, vertices in RDF graphs have incomplete information or even anonymized information (blank vertices), and the partial neighborhood information available from a source graph will be helpful to identify entities in the target graph. More importantly, these methods cannot process fuzzy information in the matching process.

Key Terms in this Chapter

Graph Matching: Graph matching is the problem of finding a similarity between graphs. Matching methods are the ones based on identification of possible and impossible pairings of vertices between the two graphs.

Linear Assignment Problem: The linear assignment problem is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics.

Branch-and-Bound: Branch-and-bound is an algorithm design paradigm for discrete and combinatorial optimization problems. The algorithm depends on efficient estimation of the lower and upper bounds of regions/branches of the search space.

Similarity Measure: Similarity measure or similarity function is a real-valued function that quantifies the similarity between two objects.

Resource Description Framework (RDF): RDF is a family of World Wide Web Consortium (W3C) specifications originally designed as a metadata data model. It has come to be used as a general method for conceptual description or modeling of information that is implemented in web resources, using a variety of syntax notations and data serialization formats.

Complete Chapter List

Search this Book: