Adaptive graphical approach to entity resolution

Proceedings of the ACM International Conference on Digital Libraries

Volumn , Issue , 2007, Pages 204-213

  Chen, Zhaoqi ^a   Kalashnikov, Dmitri V ^a   Mehrotra, Sharad ^a  

^a Irvine   (United States)

Author keywords

Entity relationship graph; Entity resolution; Graph analysis; Self tuning; SNA

Indexed keywords

ENTITY RELATIONSHIP GRAPHS; ENTITY RESOLUTION; GRAPH ANALYSIS; INFORMATION QUALITY (IQ); SELF TUNING;

ALGORITHMS; DATA STRUCTURES; GRAPHIC METHODS; LARGE SCALE SYSTEMS; PROBLEM SOLVING; WEBSITES;

ADAPTIVE SYSTEMS;

EID: 36348962508     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1255175.1255215     Document Type: Conference Paper

References (37)

1. Riddle:http://www.cs.utexas.edu/users/ml/riddle/.
2. Kdd workshop on data cleaning, record linkage, and object consolidation, 2003.
3. R. Ananthakrishna, S. Chaudhuri, and V. Ganti. Eliminating fuzzy duplicates in data warehouses. In VLDB, 2002.
4. R. Bekkerman and A. McCallum. Disambiguating web appearances of people in a social network. In WWW, 2005.
5. I. Bhattacharya and L. Getoor. Iterative record linkage for cleaning and integration. In DMKD Workshop, 2004.
6. I. Bhattacharya and L. Getoor. Relational clustering for multi-type entity resolution. In MRDM Workshop, 2005.
7. I. Bhattacharya and L. Getoor. Collective entity resolution in relational data. 29(2):4-12, June 2006.
8. I. Bhattacharya and L. Getoor. A latent dirichlet model for unsupervised entity resolution. In SIAM Data Mining (SDM), 2006.
9. M. Bilenko and R. Mooney. Adaptive duplicate detection using learnable string similarity measures. In KDD, 2003.
10. S. Chaudhuri, K. Ganjam, V. Ganti, R. Kapoor, V. Narasayya, and T. Vassilakis. Data cleaning in Microsoft SQL Server 2005. In SIGMOD, 2005.
11. Z. Chen, D. V. Kalashnikov, and S. Mehrotra. Exploiting relationships for object consolidation. In IQIS Workshop at ACM SIGMOD Conference, 2005.
12. W. W. Cohen and J. Richman. Learning to match and cluster large high-dimensional data sets for data integration. In SIGKDD, 2002.
13. I. G. Councill, H. Li, Z. Zhuang, S. Debnath, L. Bolelli, W. C. Lee, A. Sivasubramaniam, and C. L. Giles. Learning metadata from the evidence in an on-line citation matching scheme. In JCDL, 2006.
14. A. Culotta and A. McCallum. Joint deduplication of multiple record types in relational data. In CIKM, 2005.
15. X. Dong, A. Y. Halevy, and J. Madhavan. Reference reconciliation in complex information spaces. In SIGMOD, 2005.
16. I. Fellegi and A. Sunter. A theory for record linkage. Journal of Amer. Statistical Association, 64(328):1183-1210, 1969.
17. H. Han, L. Giles, H. Zha, C. Li, and K. Tsioutsiouliklis. Two supervised learning approaches for name disambiguation in author citations. In JCDL, 2004.
18. M. Hernandez and S. Stolfo. The merge/purge problem for large databases. In SIGMOD, 1995.
19. F. Hillier and G. Lieberman. Introduction to operations research. McGraw-Hill, 2001.
20. R. Holzer, B. Malin, and L. Sweeney. Email alias detection using social network analysis. In LinkKDD Workshop, 2005.
21. D. V. Kalashnikov and S. Mehrotra. Domain-independent data cleaning via analysis of entity-relationship graph. ACM TODS, 31(2), June 2006.
22. D. V. Kalashnikov, S. Mehrotra, and Z. Chen. Exploiting relationships for domain-independent data cleaning. In SIAM Data Mining (SDM), 2005.
23. D. V. Kalashnikov, S. Mehrotra, Z. Chen, R. Nuray-Turan, and N. Ashish. Disambiguation algorithm for people search on the web. In ICDE poster, 2007.
24. S. Lawrence, K. Bollacker, and C. L. Giles. Autonomous citation matching. In Proceedings of the Third International Conference on Autonomous Agents, 1999.
25. X. Li, P. Morie, and D. Roth. Identification and tracing of ambiguous names: Discriminative and generative approaches. In AAAI, 2004.
26. B. Malin. Unsupervised name disambiguation via social network similarity. In Workshop on Link Analysis, Counterterrorism, and Security, 2005.
27. A. McCallum and B. Wellner. Conditional models of identity uncertainty with application to noun coreference. In NIPS, 2004.
28. A. K. McCallum, K. Nigam, and L. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In SIGKDD, 2000.
29. E. Minkov, W. W. Cohen, and A. Y. Ng. Contextual search and name disambiguation in email using graphs. In ACM SIGIR, 2006.
30. R. Nuray-Turan, D. V. Kalashnikov, and S. Mehrotra. Self-tuning in graph-based reference disambiguation. In DASFAA, 2007.
31. B.-W. On, E. Elmacioglu, D. Lee, J. Kang, and J. Pei. Improving grouped-entity resolution using quasi-cliques. In ICDM, 2006.
32. B.-W. On, D. Lee, J. Kang, and P. Mitra. Comparative study of name disambiguation problem using a scalable blocking-based framework. In JCDL, 2005.
33. H. Pasula, B. Marthi, B. Milch, S. Russell, and I. Shpitser. Identity uncertainty and citation matching. In NIPS, 2002.
34. S. Sarawagi and A. Bhamidipaty. Interactive deduplication using active learning. In SIGKDD, 2002.
35. P. Singla and P. Domingos. Multi-relational record linkage. In MRDM Workshop, 2004.
36. S. Tejada, C. A. Knoblock, and S. Minton. Learning domain-independent string transformation weights for high accuracy object identification. In SIGKDD, 2002.
37. G. Wiederhold. The movies dataset. http://www-db.stanford.edu/pub/movies/ doc.html.