Entity Resolution in Graphs

Mining Graph Data

Volumn , Issue , 2006, Pages 311-344

  Bhattacharya, Indrajit ^a   Getoor, Lise ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Entity resolution in graphs; Graph based clustering for entity resolution; Graph based entity resolution problem

Indexed keywords

EID: 35348847847     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470073049.ch13     Document Type: Chapter

References (41)

1. R. Ananthakrishna, S. Chaudhuri, and V. Ganti. Eliminating fuzzy duplicates in data warehouses. In Proceedings of the 28th International Conference on Very Large Databases (VLDB-2002), Hong Kong, China, 2002.
2. P. Berkhin. Survey of clustering data mining techniques. Technical Report, Accrue Software, 2002.
3. I. Bhattacharya and L. Getoor. Deduplication and group detection using links. In Proceedings of the 10th ACM SIGKDD Workshop on Link Analysis and Group Detection (LinkKDD-04), August 2004.
4. I. Bhattacharya and L. Getoor. Iterative record linkage for cleaning and integration. In Proceedings of the SIGMOD 2004 Workshop on Research Issues on Data Mining and Knowledge Discovery, June 2004.
5. I. Bhattacharya and L. Getoor. A latent dirichlet model for entity resolution. Technical Report, University of Maryland, College Park, MD, 2005.
6. M. Bilenko and R. J. Mooney. Adaptive duplicate detection using learnable string similarity measures. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2003), Washington, DC, 2003.
7. M. Bilgic, L. Licamele, L. Getoor, and B. Shneiderman. D-dupe: An interactive tool for entity resolution in social networks. In The 13th International Symposium on Graph Drawing (Poster), Limerick, Ireland, September 2005.
8. S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 313-324, San Diego, CA, 2003.
9. W. Cohen. Data integration using similarity joins and a word-based information representation language. ACM Transactions on Information Systems, 18:288-321, 2000.
10. W. W. Cohen, H. Kautz, and D. McAllester. Hardening soft information sources. In Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining (KDD-2000) pp. 255-259, Boston, August 2000.
11. W. W. Cohen, P. Ravikumar, and S. E. Fienberg. A comparison of string distance metrics for name-matching tasks. In Proceedings of the IJCAI-2003 Workshop on Information Integration on the Web, pp. 73-78, Acapulco, Mexico, August 2003.
12. W. W. Cohen and J. Richman. Learning to match and cluster large high-dimensional data sets for data integration. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2002), Edmonton, Alberta, 2002.
13. A. Doan, Y. Lu, Y. Lee, and J. Han. Object matching for data integration: A profilebased approach. In Proceedings of the IJCAI Workshop on Information Integration on the Web, Acapulco, Mexico, August 2003.
14. I. P. Fellegi and A. B. Sunter. A theory for record linkage. Journal of the American Statistical Association, 64:1183-1210, 1969.
15. H. Galhardas, D. Florescu, E. Simon, and D. Shasha. An extensible framework for data cleaning. In ICDE '00: Proceedings of the 16th International Conference on Data Engineering, p. 312. IEEE Computer Society, 2000.
16. C. Lee Giles, K. Bollacker, and S. Lawrence. CiteSeer: An automatic citation indexing system. In Proceedings of the Third ACM Conference on Digital Libraries, pp. 89-98, Pittsburgh, PA, June 23-26 1998.
17. L. Gravano, P. Ipeirotis, N. Koudas, and D. Srivastava. Text joins for data cleansing and integration in an rdbms. In 19th IEEE International Conference on Data Engineering, 2003.
18. M. A. Hernández and S. J. Stolfo. The merge/purge problem for large databases. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data (SIGMOD-95) pp. 127-138, San Jose, CA, May 1995.
19. J. A. Hylton. Identifying and merging related bibliographic records. Master's thesis, Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 1996.
20. I. Jonyer, L. B. Holder, and D. J. Cook. Graph-based hierarchical conceptual clustering. Journal of Machine Learning Research, 2(1-2):19-43, 2001.
21. D. V. Kalashnikov, S. Mehrotra, and Z. Chen. Exploiting relationships for domainindependent data cleaning. In SIAM International Conference on Data Mining (SIAM SDM), Newport Beach, CA, April 21-23 2005.
22. S. Lawrence, K. Bollacker, and C. L. Giles. Autonomous citation matching. In Proceedings of the Third International Conference on Autonomous Agents, New York, May 1999. ACM Press.
23. X. Li, P. Morie, and D. Roth. Semantic integration in text: From ambiguous names to identifiable entities. Al Magazine. Special Issue on Semantic Integration, 2005.
24. A. McCallum and B. Wellner. Conditional models of identity uncertainty with application to noun coreference. In Neural Information Processing Systems (NIPS), 2004.
25. A. K. McCallum, K. Nigam, and L. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining (KDD-2000), pp. 169-178, Boston, MA, August 2000.
26. B. Milch, B. Marthi, D. Sontag, S. Russell, D. L. Ong, and A. Kolobov. Blog: Probabilistic models with unknown objects. In Proceedings IJCAI, 2005.
27. A. E. Monge and C. P. Elkan. The field matching problem: Algorithms and applications. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), pp. 267-270, Portland, OR, August 1996.
28. A. E. Monge and C. P. Elkan. An efficient domain-independent algorithm for detecting approximately duplicate database records. In Proceedings of the SIGMOD 1997 Workshop on Research Issues on Data Mining and Knowledge Discovery, pp. 23-29, Tuscon, AZ, May 1997.
29. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
30. J. Neville, M. Adler, and D. Jensen. Clustering relational data using attribute and link information. In Proceedings of the Text Mining and Link Analysis Workshop, Eighteenth International Joint Conference on Artificial Intelligence, 2003.
31. H. B. Newcombe, J. M. Kennedy, S. J. Axford, and A. P. James. Automatic linkage of vital records. Science, 130:954-959, 1959.
32. Parag and P. Domingos. Multi-relational record linkage. In Proceedings of 3rd Workshop on Multi-Relational Data Mining at ACM SI GKDD, Seattle, WA, August 2004.
33. H. Pasula, B. Marthi, B. Milch, S. Russell, and I. Shpitser. Identity uncertainty and citation matching. In Advances in Neural Information Processing Systems 15. MIT Press, Cambridge, MA, 2003.
34. V. Raman and J. M. Hellerstein. Potter's wheel: An interactive data cleaning system. In Proceedings VLDB, 2001.
35. P. Ravikumar and W. W. Cohen. A hierarchical graphical model for record linkage. In UAI 2004, Banff, CA, July 2004.
36. E. Ristad and P. Yianilos. Learning string edit distance. IEEE Transactions on PAMI , 20(5):522-532, 1998.
37. S. Sarawagi and A. Bhamidipaty. Interactive deduplication using active learning. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2002). Edmonton, Alberta, 2002.
38. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
39. S. Tejada, C. A. Knoblock, and S. Minton. Learning object identification rules for information integration. Information Systems Journal, 26(8):635-656, 2001.
40. W. E. Winkler. The state of record linkage and current research problems. Technical Report, Statistical Research Division, U.S. Census Bureau, Washington, DC, 1999.
41. W. E. Winkler. Methods for record linkage and Bayesian networks. Technical Report, Statistical Research Division, U.S. Census Bureau, Washington, DC, 2002.