paper-with-me

홈 › Papers

ShallowBlocker: Improving Set Similarity Joins for Blocking

2023-12-26 · Nils Barlaug

Blocking is a crucial step in large-scale entity matching but often requires significant manual engineering from an expert for each new dataset. Recent work has show that deep learning is state-of-the-art and has great potential for achieving hands-off and accurate blocking compared to classical methods. However, in practice, such deep learning methods are often unstable, offers little interpretability, and require hyperparameter tuning and significant computational resources. In this paper, we propose a hands-off blocking method based on classical string similarity measures: ShallowBlocker. It uses a novel hybrid set similarity join combining absolute similarity, relative similarity, and local cardinality conditions with a new effective pre-candidate filter replacing size filter. We show that the method achieves state-of-the-art pair effectiveness on both unsupervised and supervised blocking in a scalable way.

📄 PDF Abstract BibTeX arXiv:2312.15835

Code (0)

등록된 구현이 없습니다.

Tasks

BlockingDeep Learning

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Error-bounded Approximate Time Series Joins Using Compact Dictionary Representations of Time Series

2021-12-24 · Chin-Chia Michael Yeh, Yan Zheng, Junpeng Wang, Huiyuan Chen 외

The matrix profile is an effective data mining tool that provides similarity join functionality for time series data. Users of the matrix profile can either join a time series with itself using intra-similarity join (i.e…

Time SeriesTime Series Analysis

Adaptive Candidate Generation for Scalable Edge-discovery Tasks on Data Graphs

2016-05-02 · Mayank Kejriwal

Several `edge-discovery' applications over graph-based data models are known to have worst-case quadratic time complexity in the nodes, even if the discovered edges are sparse. One example is the generic link discovery p…

BlockingEntity ResolutionLink Prediction

Efficient Joinable Table Discovery in Data Lakes: A High-Dimensional Similarity-Based Approach

2020-10-26 · Yuyang Dong, Kunihiro Takeoka, Chuan Xiao, Masafumi Oyamada

Finding joinable tables in data lakes is key procedure in many applications such as data integration, data augmentation, data analysis, and data market. Traditional approaches that find equi-joinable tables are unable to…

Data AugmentationData Integration

AutoBlock: A Hands-off Blocking Framework for Entity Matching

2019-12-07 · Wei Zhang, Hao Wei, Bunyamin Sisman, Xin Luna Dong 외

Entity matching seeks to identify data records over one or multiple data sources that refer to the same real-world entity. Virtually every entity matching task on large datasets requires blocking, a step that reduces the…

BlockingEntity ResolutionRepresentation Learning

Improving Ads-Profitability Using Traffic-Fingerprints

2022-05-31 · Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski, Marcin Mucha 외

This paper introduces the concept of traffic-fingerprints, i.e., normalized 24-dimensional vectors representing a distribution of daily traffic on a web page. Using k-means clustering we show that similarity of traffic-f…

BlockingClustering