Title: On contraction method to cleansing duplicates in graph

Authors: Li Huang

Addresses: College of Computer Science and Technology, Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System, Wuhan University of Science and Technology, Hubei, Wuhan, China

Abstract: With the quick development of the linked data, graph data explosion has become a challenging problem. Duplicates also exit in graph data. Duplicates detection is a hotspot in the study of heterogeneous data integration and information retrieval. However, attentions are seldom paid to duplicates cleansing after detecting. Due to the complexity and relevance, duplicates in graph could not remove immediately. It is more important need some special methods for duplicates cleansing. In this paper, we study the problem and give a solution, named on contraction method to cleansing graph duplicates. The proposed method introduces graph contraction for duplicates cleansing. According to the situations, we give different solutions. Experiments on publication datasets show that the proposed method efficient ensures the relationship and stability in the graph.

Keywords: graph data integration; duplicates cleansing; graph contraction.

DOI: 10.1504/IJCSM.2017.10010017

International Journal of Computing Science and Mathematics, 2017 Vol.8 No.6, pp.552 - 561

Received: 10 Jun 2016
Accepted: 10 May 2017

Published online: 03 Jan 2018 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article