Interactive deduplication using active learning

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2002, Pages 269-278

  Sarawagi, Sunita ^a   Bhamidipaty, Anuradha ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CODING ERRORS; DATA RECORDING; DATABASE SYSTEMS; INTERACTIVE COMPUTER SYSTEMS; WEBSITES;

ACTIVE LEARNING; INTERACTIVE DEDUPLICATION;

LEARNING SYSTEMS;

EID: 0242456811     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775085.775087     Document Type: Conference Paper

References (34)

1. S. Argamon-Engelson and I. Dagan. Committee-based sample selection for probabilistic classifiers. Journal of Artificial Intelligence Research, 11:335-360, 1999.
2. V.R Borkar, K. Deshmukh, and S. Sarawagi. Automatic text segmentation for extracting structured records. In Proc. ACM SIGMOD International Conf. on Management of Data, Santa Barbara, USA, 2001.
3. C. Buckley, G. Salton, and J. Allan. The effect of adding relevance information in a relevance feedback environment. In Proc. of SIGIR, 292-300, 1994.
4. C.J.C. Burges. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2(2):121-167, 1998.
5. S. Chaudhuri, V. Narasayya, and S. Sarawagi. Efficient evaluation of queries with mining predicates. In Proc. of the 18th Int'l Conference on Data Engineering (ICDE), San Jose, USA, April 2002.
6. D. Cohn, L. Atlas, and R. Ladner. Improving generalization with active learning. Machine Learning, 15(2):201-221, 1994.
7. R. Collobert and S. Bengio. Svmtorch: Support vector machines for large-scale regression problems. Journal of Machine Learning Research, 1:143-160, 2001. Software available from "http://www.idiap.ch/learning/SVMTorch.html".
8. Y. Freund, H.S. Seung, E. Shamir, and N. Tishby. Selective sampling using the query by committee algorithm. Machine Learning, 28(2-3):133-168, 1997.
9. H. Galhardas, D. Florescu, D. Shasha, E. Simon, and C. Saita. Declarative data cleaning: Language, model and algorithms. In Proc. of the 27th Int'l Conference on Very Large Databases (VLDB), 307-316, Rome,Italy, 2001
10. L. Gravano, Panagiotis, and H.V. Jagadish, Approximate string joins in a database (almost) for free. In Proc. of the 27th Int'l Conference on Very Large Databases (VLDB), Rome, Italy, 2001.
11. M.A. Hernandez and S.J. Stolfo. Real-world data is dirty: Data cleansing and the merge/purge problem. Data Mining and Knowledge Discovery, 2(1):9-37, 1998.
12. J. Hylton. Identifying and merging related bibliographic records. Master's thesis, MIT, 1996.
13. V.S. Iyengar, C. Apte, and T. Zhang. In R. Ramakrishnan, S. Stolfo, R. Bayardo, and I. Parsa, editors, Active learning using adaptive resampling Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-00), 91-98, N. Y., Aug. 20-23 2000. ACM Press.
14. W.C. Jacob. Learning to match and cluster entity names. In ACM SIGIR' 01 Workshop on Mathematical/Formal Methods in Information Retrieval, 2001.
15. R. Kohavi, D. Sommerfield, and J. Dougherty. Data mining using MLC++: A machine learning library in C++. In Tools with Artificial Intelligence, 234-245. IEEE Computer Society Press, available from http://www.sgi.com/tech/mlc/, 1996.
16. S. Lawrence, C.L. Giles, and K. Bollacker. Digital libraries and autonomous citation indexing. IEEE Computer, 32(6):67-71, 1999.
17. R. Liere and P. Tadepalli. Active learning with committees for text categorization. In Proceedings of AAAI-97, 14th Conference of the American Association for Artificial Intelligence, 591-596, Providence, US, 1997. AAAI Press, Menlo Park, US.
18. A. McCallum, K. Nigam, J. Reed, J. Rennie, and K. Seymour. Cora: Computer science research paper search engine. http://cora.whizbang.com/, 2000.
19. A. McCallum, K. Nigam, and L.H. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In Knowledge Discovery and Data Mining, 169-178, 2000.
20. A.K. McCallum and K. Nigam. Employing EM in pool-based active learning for text classification. Proceedings of ICML-98, 15th International Conference on Machine Learning, In J. W. Shavlik, editor, 350-358, Madison, US, 1998. Morgan Kaufmann Publishers, San Francisco, US.
21. T. Mitchell. Machine Learning. McGraw-Hill, 1997.
22. 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), 1996.
23. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
24. J.R. Quinlan. C4.5: Programs for Machine Learning. 1993. software available from http://www.cse.unsw.edu.au/~quinlan/c4.5r8.tar.gz
25. V. Raman and J.M. Hellerstein. Potters wheel: An interactive data cleaning systems. In Proc. of the 27th Int'l Conference on Very Large Databases (VLDB), 307-316, Rome,Italy, 2001.
26. S. Sarawagi, editor. IEEE Data Engineering special issue on Data Cleaning. http://www.research.microsoft.com/research/db/debull/AOOdec/issue.htm December 2000.
27. G. Schohn and D. Cohn. Less is more: Active learning with support vector machines. In Proc. 17th International Conf. on Machine Learning, 839-846. Morgan Kaufmann, San Francisco, CA, 2000.
28. H.S. Seung, M. Opper, and H. Sompolinsky. Query by committee. In Computational Learning Theory, 287-294, 1992.
29. S. Toney. Cleanup and deduplication of an international deduplication function. Information Technology and libraries, 11(1):19 - 28, 1992.
30. S. Tong and D. Koller. Support vector machine active learning with applications to text classification. Journal of Machine Learning Research, 2:45-66, Nov. 2001.
31. W.E. Winkler. Matching and record linkage. In B. G. C. et al, editor, Business Survey Methods, pages 355-384. New York: J. Wiley, 1995. available from http:/www.census.gov/
32. W.E. Winkler. The state of record linkage and current research problems. RR99/04, http://www.census.gov/srd/papers/pdf/rr99-04.pdf 1999.
33. B. Zadrozny and C. Elkan. Learning and making decisions when costs and probabilities are both unknown. In Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining (KDD), 2001.
34. T. Zhang and F.J. Oles. A probability analysis on the value of unlabeled data for classification problems. In Proc. 17th International Conf. on Machine Learning, pages 1191-1198. Morgan Kaufmann, San Francisco, CA, 2000.