K-Means Clustering Algorithm Based on Entity Resolution

Provided by: International Journal of Computer Applications
Topic: Data Management
Format: PDF
Entity resolution is the problem of recognizing which entry in database refers to same cluster. In this paper, the authors have to run the ER in order to reduce the running time and to obtain good results. This paper investigates how they can reduce the running of ER with minimum amount of work using K-means clustering algorithm. In this, clustering can be done according to the matching of entries. They introduce a concept of technique called as k-means clustering to maximize the matching of entries identified using a limited amount of work.

Find By Topic