Affiliation:
1. IBM Corporation, USA
2. University of Arkansas – Little Rock, USA
Abstract
Inverted indexing is a commonly used technique for improving the performance of entity resolution algorithms by reducing the number of pair-wise comparisons necessary to arrive at acceptable results. This chapter describes how inverted indexing can also be used as a data partitioning strategy to perform entity resolution on large datasets in a distributed processing environment. This chapter discusses the importance of index-to-rule alignment, pre-resolution index closure, post-resolution link closure, and workflows for record-based identity capture and update, and attribute-based identity capture and update in a distributed processing environment.
Reference31 articles.
1. Bianco, G. D., Galante, R., & Heuser, C. A. (2011). A fast approach for parallel deduplication on multicore processors. In Proceedings of SAC’11. TaiChung, Taiwan: SAC.
2. Getty's Synoname™ and its cousins: A survey of applications of personal name-matching algorithms
3. Center for Identity. (2011). The center for identity risk assessment model (CIRAM). Retrieved from http://identity.utexas.edu/research/model
4. Christen, P. (2006). A comparison of personal name matching: Techniques and practical issues. In Proceedings of Sixth IEEE International Conference on Data Mining-Workshops (pp. 290-294). IEEE.
5. Data Matching