Physical Sciences and Mathematics Commons^™

Robust Bidirectional Poly-Matching, Ween Jiann Lee, Maksim Tkachenko, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

A fundamental problem in many scenarios is to match entities across two data sources. It is frequently presumed in prior work that entities to be matched are of comparable granularity. In this work, we address one-to-many or poly-matching in the scenario where entities have varying granularity. A distinctive feature of our problem is its bidirectional nature, where the 'one' or the 'many' could come from either source arbitrarily. Moreover, to deal with diverse entity representations that give rise to noisy similarity values, we incorporate novel notions of receptivity and reclusivity into a robust matching objective. As the optimal solution to …