Robust Bidirectional Poly-Matching

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...

Full description

Saved in:
Bibliographic Details
Main Authors: LEE, Ween Jiann, TKACHENKO, Maksim, LAUW, Hady Wirawan
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2023
Subjects:
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
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

Internet

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

Similar Items