The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Adaptive Blocking: Learning to Scale Up Record Linkage
Abstract
Many data mining tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as well as in clustering and schema mapping algorithms. Because the number of object pairs grows quadratically with the size of the dataset, computing similarity between all pairs is impractical and becomes prohibitive for large datasets and complex similarity functions. Blocking methods alleviate this problem by efficiently selecting approximately similar object pairs for subsequent distance computations, leaving out the remaining pairs as dissimilar. Previously proposed blocking methods require manually constructing an index- based similarity function or selecting a set of predicates, followed by hand-tuning of parameters. In this paper, we introduce an adaptive framework for automatically learning blocking functions that are efficient and accurate. We describe two predicate-based formulations of learnable blocking functions and provide learning algorithms for training them. The effectiveness of the proposed techniques is demonstrated on real and simulated datasets, on which they prove to be more accurate than non-adaptive blocking methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Cited by
A Survey of Techniques for Event Detection in Twitter
Atefeh, F., & Khreich, W. (2015) · Computational Intelligence · doi:10.1111/coin.12017 · Cited by 717
Disambiguation and co-authorship networks of the U.S. patent inventor database (1975–2010)
Li, G.-C., Lai, R., D’Amour, A., Doolin, D. M., Sun, Y., Torvik, V. I., Yu, A. Z., & Fleming, L. (2014) · Research Policy · doi:10.1016/j.respol.2014.01.012 · Cited by 498
Learning similarity metrics for event identification in social media
Becker, H., Naaman, M., & Gravano, L. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718524 · Cited by 387
Entity resolution: theory, practice & open challenges
Getoor, L., & Machanavajjhala, A. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2367502.2367564 · Cited by 348
Author name disambiguation in MEDLINE
Torvik, V. I., & Smalheiser, N. R. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1552303.1552304 · Cited by 285
Metadata
- Authors
- Bilenko, M., Kamath, B., & Mooney, R.
- Venue
- Sixth International Conference on Data Mining (ICDM'06)
- Publisher
- IEEE
- Published
- 2006-12
- Pages
- 87-96
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2111116800
- Cited by
- 235
- References
- 1
- FWCI
- 11.27
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Adaptive Blocking: Learning to Scale Up Record Linkage. https://app.cochat.ai/papers/10.1109/icdm.2006.13
- The paper
- Bilenko, M., Kamath, B., & Mooney, R. (2006). Adaptive Blocking: Learning to Scale Up Record Linkage. Sixth International Conference on Data Mining (ICDM'06). https://doi.org/10.1109/icdm.2006.13
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.