Databases and Information Systems Commons^™

Robust Bipoly-Matching For Multi-Granular Entities, Ween Jiann Lee, Maksim Tkachenko, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Entity matching across two data sources is a prevalent need in many domains, including e-commerce. Of interest is the scenario where entities have varying granularity, e.g., a coarse product category may match multiple finer categories. Previous work in one-to-many matching generally presumes the `one' necessarily comes from a designated source and the `many' from the other source. In contrast, we propose a novel formulation that allows concurrent one-to-many bidirectional matching in any direction. Beyond flexibility, we also seek matching that is more robust to noisy similarity values arising from diverse entity descriptions, by introducing receptivity and reclusivity notions. In addition …