Adaptive windows for duplicate detection

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2012, Pages 1073-1083

  Draisbach, Uwe ^a   Naumann, Felix ^a   Szott, Sascha ^b   Wonneberg, Oliver ^c  

^a UNIVERSITY OF POTSDAM   (Germany)

^b ZUSE INSTITUTE BERLIN   (Germany)

^c R Lindner GmbH and Co KG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE WINDOWS; DATA SETS; DUPLICATE DETECTION; NEIGHBORHOOD METHODS; PAIR-WISE COMPARISON; REAL-WORLD ENTITIES; SIMILARITY MEASURE; WINDOW SIZE;

INDUSTRIAL ENGINEERING;

ENGINEERING;

EID: 84864232555     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2012.20     Document Type: Conference Paper

References (24)

1. H. B. Newcombe, J. M. Kennedy, S. J. Axford, and A. P. James, "Automatic linkage of vital records." Science, vol. 130, pp. 954-959, 1959.
2. L. Gu and R. Baxter, "Adaptive filtering for efficient record linkage,"in Proceedings of the SIAM International Conference on Data Mining, 2004, pp. 477-481.
3. F. Naumann and M. Herschel, An Introduction to Duplicate Detection (Synthesis Lectures on Data Management), 2010.
4. H. H. Shahri and A. A. Barforush, "A flexible fuzzy expert system for fuzzy duplicate elimination in data cleaning," in Proceedings of the International Conference on Database and Expert Systems Applications (DEXA), 2004, pp. 161-170.
5. H. Köpcke and E. Rahm, "Frameworks for entity matching: A comparison,"Data & Knowledge Engineering (DKE), vol. 69, no. 2, pp. 197-210, 2010.
6. U. Draisbach and F. Naumann, "A comparison and generalization of blocking and windowing algorithms for duplicate detection," in Proceedings of the International Workshop on Quality in Databases (QDB), 2009.
7. M. A. Hernández and S. J. Stolfo, "The merge/purge problem for large databases," in Proceedings of the ACM International Conference on Management of Data (SIGMOD), 1995, pp. 127-138.
8. M. A. Hernández and S. J. Stolfo, "Real-world data is dirty: Data cleansing and the merge/purge problem," Data Mining and Knowledge Discovery, vol. 2(1), pp. 9-37, 1998.
9. M. Bilenko and R. J. Mooney, "Adaptive duplicate detection using learnable string similarity measures," in Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD), 2003, pp. 39-48.
10. X. Dong, A. Halevy, and J. Madhavan, "Reference reconciliation in complex information spaces," in Proceedings of the ACM International Conference on Management of Data (SIGMOD), 2005, pp. 85-96.
11. P. Singla and P. Domingos, "Object identification with attribute-mediated dependences," in European Conference on Principles of Data Mining and Knowledge Discovery (PKDD), 2005, pp. 297-308.
12. U. Draisbach and F. Naumann, "DuDe: The duplicate detection toolkit,"in Proceedings of the International Workshop on Quality in Databases (QDB), 2010.
13. A. E. Monge and C. Elkan, "An efficient domain-independent algorithm for detecting approximately duplicate database records," in Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD), 1997.
14. M. Weis, F. Naumann, U. Jehle, J. Lufter, and H. Schuster, "Industry-scale duplicate detection," Proceedings of the VLDB Endowment, vol. 1, no. 2, pp. 1253-1264, 2008.
15. U. Draisbach, F. Naumann, S. Szott, and O. Wonneberg, "Adaptive windows for duplicate detection," Hasso-Plattner-Institut für Softwaresystemtechnik an der Universität Potsdam, Tech. Rep. 49, 2011.
16. S. Yan, D. Lee, M.-Y. Kan, and L. C. Giles, "Adaptive sorted neighborhood methods for efficient record linkage," in Proceedings of the ACM/IEEE-CS joint conference on Digital libraries (JCDL), 2007, pp. 185-194.
17. R. Baxter, P. Christen, and T. Churches, "A comparison of fast blocking methods for record linkage," in Proceedings of the ACM SIGKDD Workshop on Data Cleaning, Record Linkage, and Object Consolidation, 2003, pp. 25-27.
18. P. Christen, "A survey of indexing techniques for scalable record linkage and deduplication," IEEE Transactions on Knowledge and Data Engineering (TKDE), vol. PrePrints, 2011.
19. S. E. Whang, D. Menestrina, G. Koutrika, M. Theobald, and H. Garcia-Molina, "Entity resolution with iterative blocking," in Proceedings of the ACM International Conference on Management of Data (SIGMOD), 2009, pp. 219-232.
20. O. Benjelloun, H. Garcia-Molina, D. Menestrina, Q. Su, S. E. Whang, and J. Widom, "Swoosh: a generic approach to entity resolution," VLDB Journal.
21. S. Warshall, "A theorem on boolean matrices," Journal of the ACM, vol. 9, pp. 11-12, January 1962.
22. P. Christen and K. Goiser, "Quality and complexity measures for data linkage and deduplication." in Quality Measures in Data Mining, ser. Studies in Computational Intelligence, 2007, vol. 43, pp. 127-151.
23. D. Menestrina, S. Whang, and H. Garcia-Molina, "Evaluating entity resolution results," Proceedings of the VLDB Endowment, vol. 3, no. 1, pp. 208-219, 2010.
24. P. Christen, "Probabilistic data generation for deduplication and data linkage," in IDEAL, Springer LNCS 3578, 2005, pp. 109-116.