Optimal hashing schemes for entity matching

WWW 2013 - Proceedings of the 22nd International Conference on World Wide Web

Volumn , Issue , 2013, Pages 295-305

  Dalvi, Nilesh ^a   Rastogi, Vibhor ^b   Dasgupta, Anirban ^c   Sarma, Anish Das ^b   Sarlós, Tamás ^b  

^a FACEBOOK   (United States)

^b GOOGLE INC   (United States)

^c YAHOO INC   (United States)

Author keywords

Blocking; Entity matching; Hashing

Indexed keywords

APPROXIMATION ALGORITHMS; BOOLEAN FUNCTIONS; SIGNAL THEORY; WORLD WIDE WEB;

BLOCKING; BOOLEAN EXPRESSIONS; ENTITY MATCHING; EXPONENTIAL COMPLEXITY; HASHING; MATCHING FUNCTIONS; NON TRIVIAL PROBLEMS; OPTIMAL STRATEGIES;

OPTIMIZATION;

EID: 84893085168     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488388.2488415     Document Type: Conference Paper

References (32)

1. Arvind Arasu, Venkatesh Ganti, and Raghav Kaushik. Efficient exact set-similarity joins. In VLDB, pages 918-929, 2006.
2. Arvind Arasu, Michaela Götz, and Raghav Kaushik. On active learning of record matching packages. In SIGMOD Conference, pages 783-794, 2010.
3. Brian Babcock and Surajit Chaudhuri. Towards a robust query optimizer: a principled and practical approach. In SIGMOD, pages 119-130, 2005.
4. Ziv Bar-Yossef, Ravi Kumar, and D. Sivakumar. Sampling algorithms: lower bounds and applications. In STOC, pages 266-275, 2001.
5. Indrajit Bhattacharya and Lise Getoor. A latent dirichlet model for unsupervised entity resolution. In SIAM Conference on Data Mining (SDM), 2006.
6. Indrajit Bhattacharya and Lise Getoor. Collective entity resolution in relational data. ACM Trans. Knowl. Discov. Data, 1(1), 2007.
7. Mikhail Bilenko, Beena Kamath, and Raymond J. Mooney. Adaptive blocking: Learning to scale up record linkage and clustering. In ICDM, 2006.
8. Surajit Chaudhuri, Venkatesh Ganti, and Raghav Kaushik. A primitive operator for similarity joins in data cleaning. In ICDE, 2006.
9. V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4:233-235, Aug 1979.
10. William W. Cohen, Pradeep Ravikumar, and Stephen E. Fienberg. A comparison of string distance metrics for name-matching tasks. In IJCAI Workshop on Information Integration on the Web, pages 73-78, 2003.
11. Pedro Domingos. Multi-relational record linkage. In In Proceedings of the KDD-2004 Workshop on Multi-Relational Data Mining, pages 31-48, 2004.
12. Xin Dong, Alon Halevy, and Jayant Madhavan. Reference reconciliation in complex information spaces. In SIGMOD, pages 85-96, 2005.
13. I. P. Fellegi and A. B. Sunter. A theory for record linkage. In Journal of the American Statistical Society, volume 64, pages 1183-1210, 1969.
14. Rahul Gupta and Sunita Sarawagi. Creating probabilistic databases from information extraction models. In VLDB, pages 965-976, 2006.
15. Rob Hall, Charles Sutton, and Andrew McCallum. Unsupervised deduplication using cross-field dependencies. In KDD, pages 310-317, 2008.
16. Junfeng He, Wei Liu, and Shih-Fu Chang. Scalable similarity search with optimized kernel hashing. In KDD, pages 1129-1138, 2010.
17. Mauricio A. Hernández and Salvatore J. Stolfo. Real-world data is dirty: Data cleansing and the merge/purge problem. Data Min. Knowl. Discov., 2:9-37, January 1998.
18. Tin Kam Ho. A data complexity analysis of comparative advantages of decision forest constructors. Pattern Anal. Appl., pages 102-112, 2002.
19. Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, STOC '98, pages 604-613, 1998.
20. Edwin H. Jacox and Hanan Samet. Spatial join techniques. ACM Trans. Database Syst., 32, March 2007.
21. Matthew A. Jaro. Advances in Record-Linkage Methodology as Applied to Matching the 1985 Census of Tampa, Florida. Journal of the American Statistical Association, 84(406):414-420, 1989.
22. Michael Luby and Avi Wigderson. Pairwise Independence and Derandomization. Now Publishers Inc, 2006.
23. Andrew McCallum, Kamal Nigam, and Lyle H. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In Knowledge Discovery and Data Mining, pages 169-178, 2000.
24. Andrew McCallum and Ben Wellner. Conditional models of identity uncertainty with application to noun coreference. In NIPS, 2004.
25. Matthew Michelson and Craig A. Knoblock. Learning blocking schemes for record linkage. In AAAI, pages 440-445, 2006.
26. Gonzalo Navarro. A guided tour to approximate string matching. ACM Comput. Surv., 33(1):31-88, 2001.
27. H. B. Newcombe, J. M. Kennedy, S. J. Axford, and A. P. andJames. Automatic Linkage of Vital Records. Science, 130:954-959, October 1959.
28. H. Pasula, B. Marthi, B. Milch, S. Russell, and I. Shpitser. Identity uncertainty and citation matching. In NIPS, 2002.
29. P Christen R Baxter and T Churches. A comparison of fast blocking methods for record linkage. In ACM SIGKDD03 Workshop on Data Cleaning, Record Linkage, and Object Consolidation, 2003.
30. Anish Das Sarma, Ankur Jain, Ashwin Machanavajjhala, and Philip Bohannon. An automatic blocking mechanism for large-scale de-duplication tasks. In CIKM, 2012.
31. Parag Singla and Pedro Domingos. Entity resolution with markov logic. In icdm, pages 572-582, 2006.
32. William Winkler. Approximate string comparator search strategies for very large administrative lists. In Technical Report, Statistical Research Division, U.S. Bureau of the Census, 2005.