Abstract
Entity matching (EM), which is, the task of identifying records that refer to the same entity, is a critical task when constructing data warehouses. This task is often very expensive at the running time because data must be compared in pairs. This problem becomes more important when dealing with large-scale data. We propose a new parallel algorithm that divides the data using K-Medoid algorithm implemented with Spark framework. The computational experiments are done and show that we can improve the solution of a set of instances in a reduced execution time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
