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: | LEE, Ween Jiann, TKACHENKO, Maksim, LAUW, Hady Wirawan |
---|---|
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 |
Similar Items
-
Robust bipoly-matching for multi-granular entities
by: LEE, Ween Jiann, et al.
Published: (2021) -
Adaptive sorted neighborhood methods for efficient record linkage
by: Yan, S., et al.
Published: (2013) -
INCORPORATING USER ACTIVITY DATA FOR IMPROVED USER ENTITY RESOLUTION
by: SAPUMAL AHANGAMA
Published: (2019) -
Soft matching for question answering
by: CUI HANG
Published: (2010) -
100-km long distance FBG vibration sensor based on matching filter demodulation
by: Hu, J., et al.
Published: (2014)