Flexible Models for Microclustering with Application to Entity Resolution
Not on the map. Why?
Abstract (arXiv)
Most generative models for clustering implicitly assume that the number of data points in each cluster grows linearly with the total number of data points. Finite mixture models, Dirichlet process mixture models, and Pitman--Yor process mixture models make this assumption, as do all other infinitely exchangeable clustering models. However, for some applications, this assumption is inappropriate. For example, when performing entity resolution, the size of each cluster should be unrelated to the size of the data set, and each cluster should contain a negligible fraction of the total number of data points. These applications require models that yield clusters whose sizes grow sublinearly with the size of the data set. We address this requirement by defining the microclustering property and introducing a new class of models that can exhibit this property. We compare models within this class to two commonly used clustering models using four entity-resolution data sets.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Oct 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 2; 2024: 0; 2025: 2; 2026: 2.
9 papers.
- 2021Unsupervised Statistical Learning for Die Analysis in Ancient Numismaticscited by 2
- 2022Why the Rich Get Richer? On the Balancedness of Random Partition Modelscited by 2
- 2021Multifile Partitioning for Record Linkage and Duplicate Detectioncited by 1
- 2023A Primer on the Data Cleaning Pipelinecited by 1
- 2023Entropy regularization in probabilistic clusteringcited by 0
- 2025Rapidly Varying Completely Random Measures for Modeling Extremely Sparse Networkscited by 0
- 2025Large-scale entity resolution via microclustering Ewens--Pitman random partitionscited by 0
- 2026Khatri-Rao Clustering for Data Summarizationcited by 0
- 2026Adaptive Graph Refinement and Label Propagation with LLMs for Cost-Effective Entity Resolutioncited by 0
- 2026Adaptive Graph Refinement and Label Propagation with LLMs for Cost-Effective Entity Resolution25 May 2026
- 2026Khatri-Rao Clustering for Data Summarization17 Feb 2026
- 2025Large-scale entity resolution via microclustering Ewens--Pitman random partitions24 Jul 2025
- 2025Rapidly Varying Completely Random Measures for Modeling Extremely Sparse Networks19 May 2025
- 2023A Primer on the Data Cleaning Pipeline25 Jul 2023
- 2023Entropy regularization in probabilistic clustering19 Jul 2023
- 2022Why the Rich Get Richer? On the Balancedness of Random Partition Models30 Jan 2022
- 2021Unsupervised Statistical Learning for Die Analysis in Ancient Numismatics1 Dec 2021
- 2021Multifile Partitioning for Record Linkage and Duplicate Detection8 Oct 2021