Flexible Models for Microclustering with Application to Entity Resolution

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.

[1]  J. Pitman Combinatorial Stochastic Processes , 2006 .

[2]  Peter Christen,et al.  Data Matching , 2012, Data-Centric Systems and Applications.

[3]  École d'été de probabilités de Saint-Flour,et al.  École d'été de probabilités de Saint-Flour XIII - 1983 , 1985 .

[4]  V. F. Kolchin A problem of the Allocation of Particles in Cells and Cycles of Random Permutations , 1971 .

[5]  Radford M. Neal Slice Sampling , 2003, The Annals of Statistics.

[6]  Rebecca C. Steorts,et al.  Variational Bayes for Merging Noisy Databases , 2014, 1410.4792.

[7]  Lancelot F. James,et al.  Generalized weighted Chinese restaurant processes for species sampling mixture models , 2003 .

[8]  Patrick Ball,et al.  Updated Statistical Analysis of Documentation of Killings in the Syrian Arab Republic , 2013 .

[9]  Jeffrey W. Miller,et al.  Mixture Models With a Prior on the Number of Components , 2015, Journal of the American Statistical Association.

[10]  L. Tierney Markov Chains for Exploring Posterior Distributions , 1994 .

[11]  J. Kingman The Representation of Partition Structures , 1978 .

[12]  Rob Hall,et al.  A Bayesian Approach to Graphical Record Linkage and Deduplication , 2016 .

[13]  W. Winkler Overview of Record Linkage and Current Research Directions , 2006 .

[14]  Rob Hall,et al.  A Bayesian Approach to Graphical Record Linkage and Deduplication , 2013, AISTATS.

[15]  Stephen E. Fienberg,et al.  A Comparison of Blocking Methods for Record Linkage , 2014, Privacy in Statistical Databases.

[16]  J. Sethuraman A CONSTRUCTIVE DEFINITION OF DIRICHLET PRIORS , 1991 .

[17]  P. Green,et al.  Corrigendum: On Bayesian analysis of mixtures with an unknown number of components , 1997 .

[18]  D. Aldous Exchangeability and related topics , 1985 .

[19]  Katherine A. Heller,et al.  An Alternative Prior Process for Nonparametric Bayesian Clustering , 2008, AISTATS.

[20]  H. Jeffreys,et al.  The Theory of Probability , 1896 .

[21]  Rebecca C. Steorts,et al.  Entity Resolution with Empirically Motivated Priors , 2014, 1409.0643.

[22]  Radford M. Neal,et al.  A Split-Merge Markov chain Monte Carlo Procedure for the Dirichlet Process Mixture Model , 2004 .

[23]  Peter Christen,et al.  A Survey of Indexing Techniques for Scalable Record Linkage and Deduplication , 2012, IEEE Transactions on Knowledge and Data Engineering.