Neural Locality Sensitive Hashing for Entity Blocking

被引:0
作者
Wang, Runhui [1 ]
Kong, Luyang [2 ]
Tao, Yefan [2 ]
Borthwick, Andrew [2 ]
Golac, Davor [2 ]
Johnson, Henrik [2 ]
Hijazi, Shadie [2 ]
Deng, Dong [1 ]
Zhang, Yongfeng [1 ]
机构
[1] Rutgers State Univ, Newark, NJ 07102 USA
[2] Amazoncom Serv Inc, Seattle, WA USA
来源
PROCEEDINGS OF THE 2024 SIAM INTERNATIONAL CONFERENCE ON DATA MINING, SDM | 2024年
关键词
Entity Resolution; Deep Learning; Locality Sensitive Hashing;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Locality-sensitive hashing (LSH) is a fundamental algorithmic technique widely employed in large-scale data processing applications, such as nearest-neighbor search, entity resolution, and clustering. However, its applicability in some real-world scenarios is limited due to the need for careful design of hashing functions that align with specific metrics. Existing LSH-based Entity Blocking solutions primarily rely on generic similarity metrics such as Jaccard similarity, whereas practical use cases often demand complex and customized similarity rules surpassing the capabilities of generic similarity metrics. Consequently, designing LSH functions for these customized similarity rules presents considerable challenges. In this research, we propose a neuralization approach to enhance locality-sensitive hashing by training deep neural networks to serve as hashing functions for complex metrics. We assess the effectiveness of this approach within the context of the entity resolution problem, which frequently involves the use of task-specific metrics in real-world applications. Specifically, we introduce NLSHBlock (Neural-LSH Block), a novel blocking methodology that leverages pre-trained language models, fine-tuned with a novel LSH-based loss function. Through extensive evaluations conducted on a diverse range of real-world datasets, we demonstrate the superiority of NLSHBlock over existing methods, exhibiting significant performance improvements. Furthermore, we showcase the efficacy of NLSHBlock in enhancing the performance of the entity matching phase, particularly within the semi-supervised setting.
引用
收藏
页码:887 / 895
页数:9
相关论文
共 51 条
  • [1] Andoni A., 2016, SoCG), V51, P9
  • [2] Data-Dependent Hashing via Nonlinear Spectral Gaps
    Andoni, Alexandr
    Naor, Assaf
    Nikolov, Aleksandar
    Razenshteyn, Ilya
    Waingarten, Erik
    [J]. STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 787 - 800
  • [3] Optimal Data-Dependent Hashing for Approximate Near Neighbors
    Andoni, Alexandr
    Razenshteyn, Ilya
    [J]. STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 793 - 801
  • [4] Data-Dependent Hashing Based on p-Stable Distribution
    Bai, Xiao
    Yang, Haichuan
    Zhou, Jun
    Ren, Peng
    Cheng, Jian
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2014, 23 (12) : 5033 - 5046
  • [5] Scalable Blocking for Very Large Databases
    Borthwick, Andrew
    Ash, Stephen
    Pang, Bin
    Qureshi, Shehzad
    Jones, Timothy
    [J]. ECML PKDD 2020 WORKSHOPS, 2020, 1323 : 303 - 319
  • [6] Brunner Ursin, 2020, 23 INT C EXT DAT TEC, P463
  • [7] Chen T, 2020, PR MACH LEARN RES, V119
  • [8] Das S., MAGELLAN DATA REPOSI
  • [9] Falcon: Scaling Up Hands-Off Crowdsourced Entity Matching to Build Cloud Services
    Das, Sanjib
    Suganthan, Paul G. C.
    Doan, AnHai
    Naughton, Jeffrey F.
    Krishnan, Ganesh
    Deep, Rohit
    Arcaute, Esteban
    Raghavendra, Vijay
    Park, Youngchoon
    [J]. SIGMOD'17: PROCEEDINGS OF THE 2017 ACM INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2017, : 1431 - 1446
  • [10] Dong Yihe, 2020, ICLR