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.