D-Swoosh: A family of algorithms for generic, distributed entity resolution

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2007, Pages 37-46

  Benjelloun, Omar ^a   Garcia Molina, Hector ^a   Gong, Heng ^a   Kawai, Hideki ^a   Larson, Tait E ^a   Menestrina, David ^a   Thavisomboon, Sutthipong ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Data cleaning; Entity resolution; Information integration

Indexed keywords

DATA REDUCTION; FUNCTIONS; INFORMATION USE; PROGRAM PROCESSORS;

DATA CLEANING; ENTITY RESOLUTION; INFORMATION INTEGRATION;

ALGORITHMS;

EID: 34848900466     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2007.96     Document Type: Conference Paper

References (23)

1. R. Baxter, P. Christen, and T. Churches. A comparison of fast blocking methods for record linkage. In Proc. of ACM SIGKDD'03 Workshop on Data Cleaning, Record Linkage, and Object Consolidation, 2003.
2. O. Benjelloun, H. Garcia-Molina, H. Gong, H. Kawai, T. E. Larson, D. Menestrina, and S. Thavisomboon. D-Swoosh: A Family of Algorithms for Generic, Distributed Entity Resolution (Extended version). Technical report, Stanford University, 2006. Available at http://dbpubs.stanford.edu/pub/2006-8.
3. O. Benjelloun, H. Garcia-Molina, J. Jonas, S. E. Whang, Q. Su, and J. Widom. Swoosh: a generic approach to entity resolution. Submitted for journal publication. Available from http://dbpubs.stanford.edu/pub/2005-5.
4. I. Bhattacharya and L. Getoor. Iterative record linkage for cleaning and integration. In Proc. of SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, 2004.
5. M. Bilenko, S. Basu, and M. Sahami. Adaptive Product Normalization: Using Online Learning for Record Linkage in Comparison Shopping. In Proc. of IEEE Int. Conf on Data Mining, Houston, Texas, 2005.
6. K. M. Chandy and L. Lamport. Distributed snapshots: determining global states of distributed systems. ACM Trans. Comput. Syst., 3(1):63-75, 1985.
7. S. Chaudhuri, V. Ganti, and R. Motwani. Robust identification of fuzzy duplicates. In Proc. of ICDE, Tokyo, Japan, 2005.
8. E. W. Dijkstra. Solution of a problem in concurrent programming control. Commun. ACM, 8(9):569, 1965.
9. X. Dong, A. Y. Halevy, and J. Madhavan. Reference reconciliation in complex information spaces. In Proc. of ACM SIGMOD, 2005.
10. I. P Fellegi and A. B. Sunter. A theory for record linkage. Journal of the American Statistical Association, 64(328):1183-1210, 1969.
11. H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. J. ACM, 32(4):841-860, 1985.
12. M. A. Hernández and S. J. Stolfo. The merge/purge problem for large databases. In Proc. of ACM SIGMOD, pages 127-138, 1995.
13. T Ibaraki, H. Nagamochi, and T. Kameda. Optimal coteries for rings and related networks. Distrib. Comput., 8(4):191-201, 1995.
14. M. Maekawa. A √N algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst., 3(2):145-159, 1985.
15. A. K. McCallum, K. Nigam, and L. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In Proc. of KDD, pages 169-178, Boston, MA, 2000.
16. A. E. Monge and C. Elkan. An efficient domain-independent algorithm for detecting approximately duplicate database records. In Proc. of SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, pages 23-29, 1997.
17. H. B. Newcombe, J. M. Kennedy, S. J. Axford, and A. P James. Automatic linkage of vital records. Science, 130(3381):954-959,1959.
18. C. H. Papadimitriou and M. Sideri. Optimal coteries. In PODC '91: Proceedings of the tenth annual ACM symposium on Principles of distributed computing, pages 75-80, New York, NY, USA, 1991. ACM Press.
19. S. Sarawagi and A. Bhamidipaty. Interactive deduplication using active learning. In Proc. of ACM SIGKDD, Edmonton, Alberta, 2002.
20. S. Tejada, C. A. Knoblock, and S. Minton. Learning object identification rules for information integration. Information Systems Journal, 26(8):635-656, 2001.
21. R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst., 4(2):180-209, 1979.
22. V. S. Verykios, G. V. Moustakides, and M. G. Elfeky. A bayesian decision model for cost optimal record matching. The VLDB Journal, 12(1):28-10, 2003.
23. W. Winkler. The state of record linkage and current research problems. Technical report, Statistical Research Division, U.S. Bureau of the Census, Washington, DC, 1999.