On Leveraging Large Language Models for Enhancing Entity Resolution: A Cost-efficient Approach
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:6J5KFVEHrecord.jsonopen to challenge →
read the original abstract
Entity resolution, the task of identifying and merging records that refer to the same real-world entity, is crucial in sectors like e-commerce, healthcare, and law enforcement. Large Language Models (LLMs) introduce an innovative approach to this task, capitalizing on their advanced linguistic capabilities and a ``pay-as-you-go'' model that provides significant advantages to those without extensive data science expertise. However, current LLMs are costly due to per-API request billing. Existing methods often either lack quality or become prohibitively expensive at scale. To address these problems, we propose an uncertainty reduction framework using LLMs to improve entity resolution results. We first initialize possible partitions of the entity cluster, refer to the same entity, and define the uncertainty of the result. Then, we reduce the uncertainty by selecting a few valuable matching questions for LLM verification. Upon receiving the answers, we update the probability distribution of the possible partitions. To further reduce costs, we design an efficient algorithm to judiciously select the most valuable matching pairs to query. Additionally, we create error-tolerant techniques to handle LLM mistakes and a dynamic adjustment method to reach truly correct partitions. Experimental results show that our method is efficient and effective, offering promising applications in real-world tasks.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Adaptive Graph Refinement and Label Propagation with LLMs for Cost-Effective Entity Resolution
Alper unifies entity resolution matching and clustering into an iterative graph refinement and probabilistic label propagation process that adaptively selects LLM queries via a budgeted greedy optimization to outperfo...
-
Identifying unique developers in OSS projects: A family of models
Creates a ground-truth dataset via LLM-assisted matching and benchmarks classical ML models against an Indel baseline for identifying duplicate developer identities in OSS commit data.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.