acl acl2010 acl2010-161 acl2010-161-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Paramveer S. Dhillon ; Partha Pratim Talukdar ; Koby Crammer
Abstract: We initiate a study comparing effectiveness of the transformed spaces learned by recently proposed supervised, and semisupervised metric learning algorithms to those generated by previously proposed unsupervised dimensionality reduction methods (e.g., PCA). Through a variety of experiments on different realworld datasets, we find IDML-IT, a semisupervised metric learning algorithm to be the most effective.
E. Bingham and H. Mannila. 2001. Random projection in dimensionality reduction: applications to image and text data. In ACM SIGKDD. J. Blitzer, M. Dredze, and F. Pereira. 2007. Biographies, bollywood, boom-boxes and blenders: Domain adaptation for sentiment classification. In ACL. J.V. Davis, B. Kulis, P. Jain, S. Sra, and I.S. Dhillon. 2007. Information-theoretic metric learning. In ICML. P. S. Dhillon, P. P. Talukdar, and K. Crammer. 2010. Inference-driven metric learning for graph construction. Technical Report MS-CIS-10-18, CIS Department, University of Pennsylvania, May. IT Jolliffe. 2002. Springer verlag. Principal component analysis. A. Subramanya and J. Bilmes. 2008. Soft-Supervised Learning for Text Classification. In EMNLP. V.N. Vapnik. 2000. The nature of statistical learning theory. Springer Verlag. K.Q. Weinberger and L.K. Saul. 2009. Distance metric learning for large margin nearest neighbor classification. The Journal of Machine Learning Research. X. Zhu, Z. Ghahramani, and J. Lafferty. 2003. Semisupervised learning using Gaussian fields and harmonic functions. In ICML. 381