K-Radius Subgraph Comparison for RDF Data Cleansing
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 rea soning. 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 RDFHierarchical 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.
RDF data cleansing K-radius subgraph comparison
Hai Jin Li Huang Pingpeng Yuan
Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology, Wuhan, 430074, China
国际会议
11th International Conference,WAIM 2010(第十一届网络时代管理国际会议)
九寨沟
英文
309-320
2010-07-14（万方平台首次上网日期，不代表论文的发表时间）