Duplicate Detection Algorithm in Hierarchical Data Using Efficient and Effective Network Pruning Algorithm

Provided by: RS Publication
Topic: Networking
Format: PDF
There is a long line of work on identifying duplicates in relational data; only a few solutions are there which focus on duplicate detection in more complex hierarchical structures, example XML data. This paper is either on improving the quality of the detected duplicates (effectiveness) or on saving computation time (efficiency). This paper, focused on a novel method for XML (eXtensible Markup Language) Duplicate detection, which is called XMLDup. The algorithm which uses a Bayesian network to determine the probability of two XML elements will consider the information within the elements and the way that information is structured.

Find By Topic