Entity resolution with evolving rules

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 1326-1337

  Whang, Steven Euijong ^a   Garcia Molina, Hector ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM PROPERTIES; BASED CLUSTERING; DATABASE RECORDS; DISTANCE-BASED; ENTITY RESOLUTIONS; LARGE DATASETS; REAL-WORLD ENTITIES; RULE EVOLUTION;

COMPUTER CIRCUITS;

EID: 83055176299     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1921004     Document Type: Article

References (21)

1. C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu. A framework for clustering evolving data streams. In VLDB, pages 81-92, 2003.
2. O. Benjelloun, H. Garcia-Molina, D. Menestrina, Q. Su, S. E. Whang, and J. Widom. Swoosh: a generic approach to entity resolution. VLDB J., 18(1):255-276, 2009.
3. I. Bhattacharya and L. Getoor. Iterative record linkage for cleaning and integration. In DMKD, 2004.
4. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. In STOC, pages 626-635, 1997.
5. S. Chaudhuri, V. Ganti, and R. Motwani. Robust identification of fuzzy duplicates. In Proc. of ICDE, Tokyo, Japan, 2005.
6. S. Chaudhuri, R. Krishnamurthy, S. Potamianos, and K. Shim. Optimizing queries with materialized views. In ICDE, pages 190-200, 1995.
7. A. K. Elmagarmid, P. G. Ipeirotis, and V. S. Verykios. Duplicate record detection: A survey. IEEE Trans. Knowl. Data Eng., 19(1):1-16, 2007.
8. J. C. Gower and G. J. S. Ross. Minimum spanning trees and single linkage cluster analysis. Applied Statistics, 18(1):54-64, 1969.
9. L. M. Haas, M. Hentschel, D. Kossmann, and R. J. Miller. Schema and data: A holistic approach to mapping, resolution and fusion in information integration. In ER, pages 27-40, 2009.
10. V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. In SIGMOD Conference, pages 205-216, 1996.
11. M. A. Hernández and S. J. Stolfo. The merge/purge problem for large databases. In Proc. of ACM SIGMOD, pages 127-138, 1995.
12. P. Indyk. A small approximately min-wise independent family of hash functions. J. Algorithms, 38(1):84-90, 2001.
13. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: A review. ACM Comput. Surv., 31(3):264-323, 1999.
14. C. D. Manning, P. Raghavan, and H. Schtze. Introduction to Information Retrieval. Cambridge University Press, New York, NY, USA, 2008.
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 DMKD, pages 23-29, 1997.
17. H. B. Newcombe and J. M. Kennedy. Record linkage: making maximum use of the discriminating power of identifying information. Commun. ACM, 5(11):563-566, 1962.
18. S. E. Whang, O. Benjelloun, and H. Garcia-Molina. Generic entity resolution with negative rules. VLDB J., 18(6):1261-1277, 2009.
19. S. E. Whang and H. Garcia-Molina. Entity resolution with evolving rules. Technical report, Stanford University, available at http://ilpubs.stanford.edu:8090/961/.
20. S. E. Whang, D. Menestrina, G. Koutrika, M. Theobald, and H. Garcia-Molina. Entity resolution with iterative blocking. In SIGMOD Conference, pages 219-232, 2009.
21. W. Winkler. Overview of record linkage and current research directions. Technical report, Statistical Research Division, U.S. Bureau of the Census, Washington, DC, 2006.