An unsupervised algorithm for learning blocking schemes

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2013, Pages 340-349

  Kejriwal, Mayank ^a   Miranker, Daniel P ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Blocking; Record Linkage

Indexed keywords

EID: 84894647271     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2013.60     Document Type: Conference Paper

References (16)

1. A. K. Elmagarmid, p. G. Ipeirotis, and V. S. Verykios, "Duplicate record detection: A survey," Knowledge and Data Engineering, IEEE Transactions on, vol. 19, no. 1, pp. 1-16, 2007.
2. p. Christen, "A survey of indexing techniques for scalable record linkage and deduplication," Knowledge and Data Engineering, IEEE Transactions on, vol. 24, no. 9, pp. 1537-1555, 2012.
3. M. Michelson and C. A. Knoblock, "Learning blocking schemes for record linkage," in Proceedings of the National Conference on Artificial Intelligence, vol. 21, no. 1. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999, 2006, p. 440.
4. M. Bilenko, B. Kamath, and R. J. Mooney, "Adaptive blocking: Learning to scale up record linkage," in Data Mining, 2006. ICDM'06. Sixth International Conference on. IEEE, 2006, pp. 87-96.
5. M. A. Hernández and S. J. Stolfo, "The merge/purge problem for large databases," in ACM SIGMOD Record, vol. 24, no. 2. ACM, 1995, pp. 127-138.
6. M. G. Elfeky, V. S. Verykios, and A. K. Elmagarmid, "Tailor: A record linkage toolbox," in Data Engineering, 2002. Proceedings. 18th International Conference on. IEEE, 2002, pp. 17-28.
7. R. D. Carr, S. Doddi, G. Konjevod, and M. Marathe, "On the red-blue set cover problem," in Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 2000, pp. 345-353.
8. D. Peleg, "Approximation algorithms for the label-cover max and redblue set cover problems," in Algorithm Theory-SWAT 2000. Springer, 2000, pp. 220-231.
9. V. Chvatal, "A greedy heuristic for the set-covering problem," Mathematics of operations research, vol. 4, no. 3, pp. 233-235, 1979.
10. A. Bilke and F. Naumann, "Schema matching using duplicates," in Data Engineering, 2005. ICDE 2005. Proceedings. 21st International Conference on. IEEE, 2005, pp. 69-80.
11. p. E. Hart, R. O. Duda, and D. G. Stork, Pattern classification, 2nd ed. Wiley Chichester, 2001, ch. 3, pp. 117-121.
12. I. Guyon and A. Elisseeff, "An introduction to variable and feature selection," The Journal of Machine Learning Research, vol. 3, pp. 1157-1182, 2003.
13. L. Gu and R. Baxter, "Adaptive filtering for efficient record linkage," in Proceedings of the Fourth SIAM International Conference on Data Mining. Society for Industrial Mathematics, 2004, pp. 477-481.
14. M. Bilenko and R. J. Mooney, "On evaluation and training-set construction for duplicate detection," in Proceedings of the KDD-2003 Workshop on Data Cleaning, Record Linkage, and Object Consolidation, 2003, pp. 7-12.
15. p. Melville and R. J. Mooney, "Constructing diverse classifier ensembles using artificial training examples," in International Joint Conference on Artificial Intelligence, vol. 18. Citeseer, 2003, pp. 505-512.
16. J. Dean and S. Ghemawat, "Mapreduce: simplified data processing on large clusters," Communications of the ACM, vol. 51, no. 1, pp. 107-113, 2008.