Database Paper Browser

Back to papers

Evaluating Entity Resolution Results

Summary: Analyzes existing ER measures; shows they can rank results inconsistently across algorithms. Introduces generalized merge distance (GMD), an edit-distance style ER measure with configurable split/merge costs; unifies VI as a special case and makes F1 computable from GMD; provides a linear-time algorithm for broad cost classes. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10077
Venue
VLDB
Year
2010
Pagerank
7.4367331e-05
Overall Rank
3,177 | 77.90%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
67 The Merge/Purge Problem for Large Databases 1995 SIGMOD 0.00061348205
229 Reference Reconciliation in Complex Information Spaces 2005 SIGMOD 0.00032242633
280 Eliminating Fuzzy Duplicates in Data Warehouses 2002 VLDB 0.00029113044
936 Framework for Evaluating Clustering Algorithms in Duplicate Detection 2009 VLDB 0.0001521549
1,410 Entity Resolution with Iterative Blocking 2009 SIGMOD 0.00012127555
Previous Page 1 / 1 Next

Semantically Similar Papers