A Latent Dirichlet Model for Unsupervised Entity Resolution
| dc.contributor.author | Bhattacharya, Indrajit | |
| dc.contributor.author | Getoor, Lise | |
| dc.date.accessioned | 2006-12-15T21:49:27Z | |
| dc.date.available | 2006-12-15T21:49:27Z | |
| dc.date.issued | 2005-08-19 | |
| dc.description.abstract | In this paper, we address the problem of entity resolution, where given many references to underlying objects, the task is to predict which references correspond to the same object. We propose a probabilistic model for collective entity resolution. Our approach differs from other recently proposed entity resolution approaches in that it is a) unsupervised, b) generative and c) introduces a hidden `group' variable to capture collections of entities which are commonly observed together. The entity resolution decisions are not considered on an independent pairwise basis, but instead decisions are made collectively. We focus on how the use of relational links among the references can be exploited. We show how we can use Gibbs Sampling to infer the collaboration groups and the entities jointly from the observed co-author relationships among entity references and how this improves entity resolution performance. We demonstrate the utility of our approach on two real-world bibliographic datasets. In addition, we present preliminary results on characterizing conditions under which collaborative information is useful. | en |
| dc.format.extent | 209060 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4022 | |
| dc.language.iso | en_US | en |
| dc.relation.ispartofseries | UM Computer Science Department | en |
| dc.relation.ispartofseries | CS-TR-4740 | en |
| dc.title | A Latent Dirichlet Model for Unsupervised Entity Resolution | en |
| dc.type | Technical Report | en |