This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Matching problems are ubiquitous. They occur in economic markets, labor markets, internet advertising, and elsewhere. In this paper we focus on an application of matching for soci...
Gianmarco De Francisci Morales, Aristides Gionis, ...
There have been several recent advancements in Machine Learning community on the Entity Matching (EM) problem. However, their lack of scalability has prevented them from being app...
Vibhor Rastogi, Nilesh N. Dalvi, Minos N. Garofala...
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...