Removing Fully and Partially Duplicated Records Through K-Means Clustering

Provided by: International Journal of Engineering and Technology
Topic: Data Management
Format: PDF
Records duplication is one of the prominent problems in data warehouse. This problem arises when various databases are integrated. This paper focuses on the identification of fully as well as partially duplicated records. In this paper the authors propose a de-duplicator algorithm which is based on numeric conversion of entire data. For efficiency, data mining technique k-mean clustering is applied on the numeric value that reduces the number of comparisons among records. To identify and remove the duplicated records, divide and conquer technique is used to match records within a cluster which further improves the efficiency of the algorithm.

Find By Topic