Exploiting relationships for domain-independent data cleaning

Proceedings of the 2005 SIAM International Conference on Data Mining, SDM 2005

Volumn , Issue , 2005, Pages 262-273

  Kalashnikov, Dmitri V ^a   Mehrotra, Sharad ^a   Chen, Zhaoqi ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA CLEANING; DOMAIN INDEPENDENTS; REAL DATA SETS; SYNTHETIC DATASETS; TRADITIONAL TECHNIQUES;

DATA MINING;

EID: 84880127702     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972757.24     Document Type: Conference Paper

References (25)

1. CiteSeer. http://citeseer.nj.nec.com/cs.
2. HomePageSearch. http://hpsearch.uni-trier.de.
3. Knowledge Discovery. http://www.kdnuggets.com/polls/2003/data- preparation.htm.
4. SNOPT solver. http://www.gams.com/solvers/.
5. Ananthakrishna, Chaudhuri, and Ganti. Eliminating fuzzy duplicates in data warehouses. In VLDB, 2002.
6. M. Bilenko and R. Mooney. Adaptive duplicate detection using learnable string similarity measures. In SIGKDD, 2003.
7. S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. In Proc. of ACM SIGMOD Conf., 2003.
8. R. Cheng, D. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In Proc. ACM SIGMOD Conf., 2003.
9. R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Querying imprecise data in moving object environments. IEEE TKDE, 16(9), Sept. 2004.
10. R. Cheng, S. Prabhakar, and D. Kalashnikov. Querying imprecise data in moving object environments. In Proc. IEEE ICDE Conf., 2003.
11. C. Faloutsos, K. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In SIGKDD, 2004.
12. I. Fellegi and A. Sunter. A theory for record linkage. J. of Amer. Stat. Assoc, 64(328):1183-1210, 1969.
13. H. Garcia-Molina, J. Ullman, and J. Widom. Database systems: the complete book. Prentice Hall, 2002.
14. M. Hernandez and S. Stolfo. The merge/purge problem for large databases. In Proc. of SIGMOD, 1995.
15. D. Kalashnikov and Mehrotra. Exploiting relationships for data cleaning. TR-RESCUE-03-02, Nov. 2003.
16. D. Kalashnikov and S. Mehrotra. Exploiting relationships for domain-independent data cleaning. Extended Version of SI AM Data Mining 2005 publication, http://www.ics.uci.edu/~dvk/pub/sdm05.pdf.
17. D. V. Kalashnikov and S. Mehrotra. RelDC project. http://www.ics.uci.edu/ ~dvk/RelDC/.
18. D. V. Kalashnikov and S. Mehrotra. Learning importance of relationships for reference disambiguation. Submitted for Publication, Dec. 2004. http://www.ics.uci.edu/~dvk/RelDC/TR/TR-RESCUE-04-23.pdf.
19. M. Lee, W. Hsu, and V. Kothari. Cleaning the spurious links in data. IEEE Intelligent Systems, Mar-Apr 2004.
20. R. Little and D. Rubin. Statistical Analysis with Missing Data. John Wiley and Sons, 1986.
21. J. Maletic and A. Marcus. Data cleansing: Beyond integrity checking. In Conf. on Inf. Quality, 2000.
22. A. K. McCallum, K. Nigam, and L. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In ACM SIGKDD, 2000.
23. Newcombe, Kennedy, Axford, and James. Automatic linkage of vital records. Science, 130:954-959, 1959.
24. S. White and P. Smyth. Algorithms for estimating relative importance in networks. In SIGKDD, 2003.
25. G. Wiederhold. www-db.stanford.edu/pub/movies/.