Robust Bidirectional Poly-Matching
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 di...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2023
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8277 https://ink.library.smu.edu.sg/context/sis_research/article/9280/viewcontent/Robust_bidirectional_poly_av.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-9280 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-92802023-11-10T08:39:26Z Robust Bidirectional Poly-Matching LEE, Ween Jiann TKACHENKO, Maksim LAUW, Hady Wirawan 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 the resulting formulation is proven computationally intractable, we propose more scalable yet still performant heuristics. Experiments on multiple real-life datasets showcase the effectiveness and outperformance of our proposed algorithms over baselines. 2023-10-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/8277 info:doi/10.1109/TKDE.2023.3266480 https://ink.library.smu.edu.sg/context/sis_research/article/9280/viewcontent/Robust_bidirectional_poly_av.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Lenses Cameras Noise measurement Matched filters Soft sensors Mathematical models Linear programming Entity resolution matching one-to-many Databases and Information Systems Numerical Analysis and Scientific Computing |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Lenses Cameras Noise measurement Matched filters Soft sensors Mathematical models Linear programming Entity resolution matching one-to-many Databases and Information Systems Numerical Analysis and Scientific Computing |
spellingShingle |
Lenses Cameras Noise measurement Matched filters Soft sensors Mathematical models Linear programming Entity resolution matching one-to-many Databases and Information Systems Numerical Analysis and Scientific Computing LEE, Ween Jiann TKACHENKO, Maksim LAUW, Hady Wirawan Robust Bidirectional Poly-Matching |
description |
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 the resulting formulation is proven computationally intractable, we propose more scalable yet still performant heuristics. Experiments on multiple real-life datasets showcase the effectiveness and outperformance of our proposed algorithms over baselines. |
format |
text |
author |
LEE, Ween Jiann TKACHENKO, Maksim LAUW, Hady Wirawan |
author_facet |
LEE, Ween Jiann TKACHENKO, Maksim LAUW, Hady Wirawan |
author_sort |
LEE, Ween Jiann |
title |
Robust Bidirectional Poly-Matching |
title_short |
Robust Bidirectional Poly-Matching |
title_full |
Robust Bidirectional Poly-Matching |
title_fullStr |
Robust Bidirectional Poly-Matching |
title_full_unstemmed |
Robust Bidirectional Poly-Matching |
title_sort |
robust bidirectional poly-matching |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2023 |
url |
https://ink.library.smu.edu.sg/sis_research/8277 https://ink.library.smu.edu.sg/context/sis_research/article/9280/viewcontent/Robust_bidirectional_poly_av.pdf |
_version_ |
1783955663437692928 |