Learnable similarity functions and their applications to clustering and record linkage

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 981-982

  Bilenko, Mikhail ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; DATA MINING; DATABASE SYSTEMS; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILISTIC LOGICS;

INFORMATION INTEGRATION PROGRESSES; LEARNABLE SIMILARITY FUNCTIONS; MULTIPLY ADAPTIVE RECORD LINKAGE USING INDUCTION (MARLIN); SUPPORT VECTOR MACHINE (SVM);

LEARNING SYSTEMS;

EID: 9444281954     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Basu, S.; Bilenko, M.; and Mooney, R. J. 2004. A probabilistic framework for semi-supervised clustering. In submission, available at http://www.cs. utexas.edu/~m1/publication.
2. Bilenko, M., and Mooney, R. J. 2003a. Adaptive duplicate detection using learnable string similarity measures. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2003), 39-48.
3. Bilenko, M., and Mooney, R. J. 2003b. On evaluation and training-set construction for duplicate detection. In Proceedings of the KDD-03 Workshop on Data Cleaning, Record Linkage, and Object Consolidation, 7-12.
4. Bilenko, M.; Basu, S.; and Mooney, R. J. 2004. Integrating constraints and metric learning in semi-supervised clustering. In Proceedings of 21st International Conference on Machine Learning (ICML-2004).
5. Cohen, W. W., and Richman, J. 2002. Learning to match and cluster large high-dimensional data sets for data integration. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2002).
6. Doan, A.; Domingos, P.; and Halevy, A. 2001. Reconciling schemas of disparate data sources: A machine-learning approach. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, 509-520. Santa Barbara, CA: ACM Press.
7. Duda, R. O.; Hart, P. E.; and Stork, D. G. 2001. Pattern Classification. New York: Wiley, second edition.
8. Gusfield, D. 1997. Algorithms on Strings, Trees and Sequences. New York: Cambridge University Press.
9. Jolliffe, I. T. 1986. Principal Component Analysis. New York: Springer-Verlag.
10. Lafferty, J.; McCallum, A.; and Pereira, F. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of 18th International Conference on Machine Learning (ICML-2001).
11. Lodhi, H.; Saunders, C.; Shawe-Taylor, J.; Cristianini, N.; and Watkins, C. 2002. Text classification using string kernels. Journal of Machine Learning Research 2:419-444.
12. Ristad, E. S., and Yianilos, P. N. 1998. Learning string edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(5):522-532.
13. Saul, L., and Roweis, S. 2003. Think globally, fit locally: un-supervised learning of low dimensional manifolds. Journal of Machine Learning Research 4:119-155.
14. Schultz, M., and Joachims, T. 2004. Learning a distance metric from relative comparisons. In Advances in Neural Information Processing Systems 16.
15. Vapnik, V. N. 1998. Statistical Learning Theory. John Wiley & Sons.
16. Wagstaff, K.; Cardie, C.; Rogers, S.; and Schroedl, S. 2001. Constrained K-Means clustering with background knowledge. In Proceedings of 18th International Conference on Machine Learning (ICML-2001), 577-584.
17. Xing, E. P.; Ng, A. Y.; Jordan, M. I.; and Russell, S. 2003. Distance metric learning, with application to clustering with side-information. In Advances in Neural Information Processing Systems 15, 505-512. Cambridge, MA: MIT Press.