Record linkage with uniqueness constraints and erroneous values

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 417-428

  Guo, Songtao ^a   Dong, Xin Luna ^b   Srivastava, Divesh ^b   Zajac, Remi ^a  

^a AT and T Interactive Research   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION MANAGEMENT;

ATTRIBUTE VALUES; BUSINESS CONTACTS; ERRONEOUS DATUM; K-PARTITE GRAPH; MANAGEMENT APPLICATIONS; NOVEL TECHNIQUES; REAL-WORLD ENTITIES; TRADITIONAL TECHNIQUES;

PROBLEM SOLVING;

EID: 79960023714     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920897     Document Type: Article

References (32)

1. J. Aslam, K. Pelekhov, and D. Rus. A practical clustering algorithm for static and dynamic information organization. In SODA, 1999.
2. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. Mach. Learn., 56(1-3):89-113, 2004.
3. I. Bhattacharya and L. Getoor. Collective entity resolution in relational data. ACM Trans. Knowl. Discov. Data, 1(1):5, 2007.
4. M. Bilenko, S. Basu, and R. J. Mooney. Integrating constraints and metric learning in semi-supervised clustering. In ICML, 2004.
5. M. Bilenko and R. J. Mooney. Adaptive duplicate detection using learnable string similarity measures. In SIGKDD, pages 39-48, 2003.
6. P. Bohannon, W. Fan, M. Flaster, and R. Rastogi. A cost-based model and effective heuristic for repairing constraints by value modification. In Sigmod, 2005.
7. S. Chaudhuri, A. Das Sarma, V. Ganti, and R. Kaushik. Leveraging aggregate constraints for deduplication. In SIGMOD, 2007.
8. W. W. Cohen, P. Ravikumar, and S. E. Fienberg. A comparison of string distance metrics for name-matching tasks. In IIWEB, 2003.
9. D. L. Davies and D. W. Bouldin. A cluster separation measure. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-1(2):224-227, 1979.
10. X. Dong, A. Y. Halevy, and J. Madhavan. Reference reconciliation in complex information spaces. In SIGMOD, pages 85-96, 2005.
11. X. L. Dong, L. Berti-Equille, and D. Srivastava. Integrating conflicting data: the role of source dependence. PVLDB, 2009.
12. X. L. Dong and F. Naumann. Data fusion-resolving data conflicts for integration. PVLDB, 2009.
13. J. Dunn. Well separated clusters and optimal fuzzy partitions. Journal of Cybernetics, 4:95-104, 1974.
14. A. K. Elmagarmid, P. G. Ipeirotis, and V. S. Verykios. Duplicate record detection: A survey. TKDE, 19(1):1-16, 2007.
15. W. Fan. Dependencies revisited for improving data quality. In PODS, pages 159-170, 2008.
16. W. Fan, X. Jia, J. Li, and S. Ma. Reasoning about record matching rules. PVLDB, 2(1):757-768, 2009.
17. T. F. Gonzalez. On the computational complexity of clustering and related problems. Lecture Notes in Control and Information Sciences, 38:174-182, 1982.
18. S. Guo, X. L. Dong, D. Srivastava, and R. Zajac. Record linkage with uniqueness constraints and erroneous values. http://www.research.att. com/~lunadong/publication/linkage_techReport.pdf.
19. I. F. Ilyas, V. Markl, P. J. Haas, P. G. Brown, and A. Aboulnaga. Cords: Automatic generation of correlation statistics in db2. In VLDB, 2004.
20. N. Koudas, A. Saha, D. Srivastava, and S. Venkatasubramanian. Metric functional dependencies. In ICDE, 2009.
21. N. Koudas, S. Sarawagi, and D. Srivastava. Record linkage: similarity measures and algorithms. In SIGMOD, 2006.
22. M. W. Krentel. The complexity of optimization problems. Lecture Notes in Computer Science, 223, 1986.
23. H. W. Kuhn. The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2:83-97, 1955.
24. C. Legany, S. Juhasz, and A. Babos. Cluster validity measurement techniques. In WSEAS, pages 388-393, 2006.
25. P. Lyman, H. R. Varian, K. Swearingen, P. Charles, N. Good, L. L. Jordan, and J. Pal. How much information? 2003. http://www2.sims.berkeley.edu/research/projects/how-much-info- 2003/execsum.htm.
26. S. Petrovic. A comparison between the silhouette index and the davies-bouldin index in labelling ids clusters. In NORDSEC, 2006.
27. E. Rahm and P. A. Bernstein. A survey of approaches to automatic schema matching. VLDBJ, 10(4):334-350, 2001.
28. P. Rousseeuw. Silhouettes: A graphical aid to the interpretation and validation of cluster analysis. Journal of Comp. and Applied Math., 20(1):53-65, 1987.
29. J. Sima and S. E. Schaeffer. On the NPCompleteness of some graph cluster measures. Lecture Notes in Computer Science, 3831:530-537, 2006.
30. A. K. H. Tung, R. T. Ng, L. V. S. Lakshmanan, and J. Han. Constraint-based clustering in large databases. In ICDT, 2001.
31. W. Winkler. Overview of record linkage and current research directions. Technical report, Statistical Research Division, U. S. Bureau of the Census, 2006.
32. D. Zardetto, M. Scannapieco, and T. Catarci. Effective automated object matching. In ICDE, pages 757-768, 2010.