SOTAVerified

Blocking

Entity resolution (also known as entity matching, record linkage, or duplicate detection) is the task of finding records that refer to the same real-world entity across different data sources (e.g., data files, books, websites, and databases). (Source: Wikipedia)

Blocking is a crucial step in any entity resolution pipeline because a pair-wise comparison of all records across two data sources is infeasible. Blocking applies a computationally cheap method to generate a smaller set of candidate record pairs reducing the workload of the matcher. During matching a more expensive pair-wise matcher generates a final set of matching record pairs.

Survey on blocking:

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 51–75 of 524 papers

TitleStatusHype
Block-Based Multi-Scale Image Rescaling—0
BlockDoor: Blocking Backdoor Based Watermarks in Deep Neural Networks—0
Precision-Enhanced Human-Object Contact Detection via Depth-Aware Perspective Interaction and Object Texture Restoration—0
Knowledge Graph Guided Evaluation of Abstention Techniques—0
The Hyperfitting Phenomenon: Sharpening and Stabilizing LLMs for Open-Ended Text Generation—0
Effect of Correlated Building Blockages on the Ergodic Capacity of mmWave Systems in Urban Scenarios—0
Analysis of Blocking in mmWave Cellular Systems: Characterization of the LOS and NLOS Intervals in Urban Scenarios—0
Avoiding Deadlocks Is Not Enough: Analysis and Resolution of Blocked Airplanes—0
Leveraging large language models for efficient representation learning for entity resolution—0
Block based Adaptive Compressive Sensing with Sampling Rate Control—0
LOS/NLOS Estimators for mmWave Cellular Systems With Blockages—0
Synergizing Hyper-accelerated Power Optimization and Wavelength-Dependent QoT-Aware Cross-Layer Design in Next-Generation Multi-Band EONs—0
ALISE: Accelerating Large Language Model Serving with Speculative Scheduling—0
Annotation Efficiency: Identifying Hard Samples via Blocked Sparse Linear Bandits—0
A Stochastic Approximation Approach for Efficient Decentralized Optimization on Random NetworksCode0
Towards Effective Planning Strategies for Dynamic Opinion NetworksCode0
SudoLM: Learning Access Control of Parametric Knowledge with Authorization Alignment—0
Large Language Model-driven Multi-Agent Simulation for News Diffusion Under Different Network Structures—0
On Calibration of LLM-based Guard Models for Reliable Content ModerationCode0
Multi-granularity Contrastive Cross-modal Collaborative Generation for End-to-End Long-term Video Question AnsweringCode1
Degrees of Freedom of Holographic MIMO in Multi-user Near-field Channels—0
Don't Stop Me Now: Embedding Based Scheduling for LLMs—0
Medha: Efficiently Serving Multi-Million Context Length LLM Inference Requests Without Approximations—0
Evaluating Blocking Biases in Entity MatchingCode0
PecSched: Preemptive and Efficient Cluster Scheduling for LLM Inference—0
Show:102550
← PrevPage 3 of 21Next →

No leaderboard results yet.