Exploiting relationships for object consolidation

Proceedings of the 2nd International Workshop on Information Quality in Information Systems, IQIS 2005

Volumn , Issue , 2005, Pages 47-58

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

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLEANING; GRAPH THEORY; INFORMATION SYSTEMS; INFORMATION USE; SEMANTICS;

ATTRIBUTED RELATIONAL GRAPH; DATA MINING ALGORITHM; DATA PREPROCESSING; DOMAIN INDEPENDENTS; GRAPH PARTITIONING; OBJECT REPRESENTATIONS; REAL-WORLD DATASETS; SEMANTIC INFORMATION;

DATA MINING;

EID: 85016708008     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1077501.1077512     Document Type: Conference Paper

References (34)

1. R. Ananthakrishna, S. Chaudhuri, and V. Ganti. Elimin-Ating fuzzy duplicates in data warehouses. In VLDB, 2002.
2. I. Bhattacharya and L. Getoor. Iterative record linkage for cleaning and integration. In DMKD Workshop, 2004.
3. M. Bilenko and R. Mooney. Adaptive duplicate detection using learnable string similarity measures. In SIGKDD'03.
4. S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. In SIGMOD Conf., 2003.
5. P. Christen, T. Churches, and J. X. Zhu. Probabilistic name and address cleaning and standardisation. The Australasian Data Mining Wshp, 2002.
6. W. W. Cohen and J. Richman. Learning to match and cluster large high-dimensional data sets for data integration. In SIGKDD, 2002.
7. X. Dong, A. Halevy, and J. Madhavan. Reference reconcil- iation in complex information spaces. In SIGMOD, 2005.
8. M. G. Elfeky and V. S. Verykios. On search enhancement of the record linkage process. In KDD-2003 Wshp on Data Cleaning, Record Linkage, and Object Consolidation, 2003.
9. C. Faloutsos, K. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In SIGKDD, 2004.
10. I. Fellegi and A. Sunter. A theory for record linkage. Journal of the American Statistical Association, 64(328):1183-1210, 1969.
11. H. Garcia-Molina, J. Ullman, and J. Widom. Database systems: The complete book. Prentice Hall, 2002.
12. L. Gravano, P. Ipeirotis, H. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free. In VLDB01.
13. M. Hernandez and S. Stolfo. The merge/purge prob- lem for large databases. In SIGMOD, 1995.
14. D. Kalashnikov and S. Mehrotra. Exploiting relationships for domain-independent data cleaning. SIAM SDM, 2005. ext. ver., http://www.ics.uci.edu/-dvk/pub/sdm05.pdf.
15. D. V. Kalashnikov and S. Mehrotra. RelDC project. http://www.ics.uci.edu/-dvk/RelDC/.
16. D. V. Kalashnikov and S. Mehrotra. Learning importance of relationships for reference disambiguation. UCI Technical Report RESCUE-04-23, Dec. 2004. http://www.ics.uci.edu/-dvk/RelDC/TR/TR-RESCUE-04-23.pdf.
17. D. V. Kalashnikov, S. Mehrotra, and Z. Chen. Exploiting relationships for domain-independent data cleaning. In SIAM International Conference on Data Mining (SIAM SDM 2005), Newport Beach, CA, USA, April 21-23 2005.
18. M. Lee, W. Hsu, and V. Kothari. Cleaning the spurious links in data. IEEE Intelligent Systems, Mar-Apr 2004.
19. A. K. McCallum, K. Nigam, and L. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In SIGKDD, 2000.
20. M. Michalowski, S. Thakkar, and C. Knoblock. Exploiting secondary sources for automatic object consolidation. In KDD-2003 Wshp on Data Cleaning, Record Linkage, and Object Consolidation, 2003.
21. A. E. Monge and C. P. Elkan. An efficient domain-independent algorithm for detecting approximately duplicate database records. In SIGMOD Wshp on Research Issues on Data Mining and Knowledge Discovery, 1997.
22. M. Neiling and S. Jurk. The object identification framework. In KDD-2003 Wshp on Data Cleaning, Record Linkage, and Object Consolidation, 2003.
23. H. B. Newcombe, J. M. Kennedy, S. J. Axford, and A. P. James. Automatic linkage of vital records. Science, 130:954-959, 1959.
24. H. Pasula, B. Marthi, B. Milch, S. Russell, and I. Shpitser. Identity uncertainty and citation matching. In Advances in Neural Processing Systems 15. Vancouver, British Columbia:MIT Press, 2002.
25. D. Quass and P. Starkey. Record linkage for genealogical databases. In KDD-2003 Wshp on Data Cleaning, 2003.
26. L. D. Raedt et al. Three companions for data mining in first order logic. In Relational Data Mining. Springer-Verlag, 2001.
27. S. Sarawagi and A. Bhamidipaty. Interactive deduplication using active learning. In SIGKDD, 2002.
28. C. E. Shannon. The Mathematical Theory of Communication. University of Illinois Press, 1949.
29. J. Shawe-Taylor and N. Cristianni. Kernel Methods for Pattern Analysis. Cambridge University Press, 2004.
30. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 2000.
31. S. Tejada, C. A. Knoblock, and S. Minton. Learning domain-independent string tranformation weights for high accuracy object identification. In SIGKDD, 2002.
32. V. Verykios, G.V.Moustakides, and M. Elfeky. A bayesian decision model for cost optimal record matching. The VLDB Journal, 12:28-40, 2003.
33. S. White and P. Smyth. Algorithms for estimating relative importance in networks. In SIGKDD, 2003.
34. G. Wiederhold. www-db.stanford.edu/pub/movies/.