DOIAbstract
Entity resolution (ER) is the task of identifying all records in adatabase that refer to the same underlying entity. This is an expensivetask, and can take a significant amount of money and time; theend-user may want to take decisions during the process, rather thanwaiting for the task to be completed. We formalize an online versionof the entity resolution task, and use an oracle which correctlylabels matching and non-matching pairs through queries. In thissetting, we design algorithms that seek to maximize progressive recall,and develop a novel analysis framework for prior proposalson entity resolution with an oracle, beyond their worst case guarantees.Finally, we provide both theoretical and experimental analysisof the proposed algorithms
Add to ORKG