Advertisement
Published in:
2010 | OriginalPaper | Chapter
K-Radius Subgraph Comparison for RDF Data Cleansing
Authors : Hai Jin, Li Huang, Pingpeng Yuan
Published in: Web-Age Information Management
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
With the quick development of the semantic web technology, RDF data explosion has become a challenging problem. Since RDF data are always from different resources which may have overlap with each other, they could have duplicates. These duplicates may cause ambiguity and even error in reasoning. However, attentions are seldom paid to this problem. In this paper, we study the problem and give a solution, named
K-radius subgraph comparison
(KSC). The proposed method is based on RDF-Hierarchical Graph Model. KSC combines similar and comparison of
context
to detect duplicate in RDF data. Experiments on publication datasets show that the proposed method is efficient in duplicate detection of RDF data. KSC is simpler and less time-costs than other methods of graph comparison.