De-Chuan Zhan
Ming Li
ABSTRACT
In many real-world applications, such as image retrieval, it would be natural to measure the distances from one instance to others using instance specific distance which captures the distinctions from the perspective of the concerned instance. However, there is no complete framework for learning instance specific distances since existing methods are incapable of learning such distances for test instance and unlabeled data. In this paper, we propose the Isd method to address this issue. The key of Isd is metric propagation, that is, propagating and adapting metrics of individual labeled examples to individual unlabeled instances. We formulate the problem into a convex optimization framework and derive efficient solutions. Experiments show that Isd can effectively learn instance specific distances for labeled as well as unlabeled instances. The metric propagation scheme can also be used in other scenarios.
- Belkin, M., Niyogi, P., & Sindhwani, V. (2006). Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. J. Mach. Learn. Res., 7, 2399--2434. Google Scholar
Digital Library
- Blake, C., Keogh, E., & Merz, C. J. (1998). UCI repository of machine learning databases. {http://www.ics.uci.edu/~mlearn/MLRepository.html}.Google Scholar
- Frome, A., Singer, Y., & Malik, J. (2006). Image retrieval and classification using local distance functions. In Adv. Neural. Inf. Process. Syst. 19, 417--424.Google Scholar
- Frome, A., Singer, Y., Sha, F., & Malik, J. (2007). Learning globally-consistent local distance functions for shape-based image retrieval and classification. Proc. 11th Intl. Conf. Comp. Vision (pp. 1--8).Google ScholarCross Ref
- Goldberger, J., Roweis, S., Hinton, G., & Salakhutdinov, R. (2005). Neighbourhood components analysis. In Adv. Neural Inf. Process. Syst. 19, 513--520.Google Scholar
- Kwok, J., & Tsang, I. (2003). Learning with idealized kernels. Proc. 20th Intl. Conf. Mach. Learn. (pp. 400--407).Google Scholar
- Li, Z., Liu, J., & Tang, X. (2008). Pairwise constraint propagation by semidefinite programming for semi-supervised classification. Proc. 25th Intl. Conf. Mach. Learn. (pp. 576--583). Google ScholarDigital Library
- Weinberger, K. Q., Blitzer, J., & Saul, L. K. (2005). Distance metric learning for large margin nearest neighbor classification. In Adv. Neural Inf. Process. Syst. 17, 1473--1480.Google Scholar
- Xing, E. P., Ng, A. Y., Jordan, M. I., & Russell, S. (2002). Distance metric learning with application to clustering with side-information. In Adv. Neural Inf. Process. Syst. 14, 505--512.Google Scholar
- Yang, L. (2006). Distance metric learning: A comprehensive survey. {http://www.cse.msu.edu/~yangliu1/frame_survey_v2.pdf}.Google Scholar
- Zhang, R., Zhang, Z., Li, M., Ma, W.-Y., & Zhang, H. J. (2005). A probabilistic semantic model for image annotation and multi-modal image retrieval. Proc. 10th Intl. Conf. Comp. Vision (pp. 846--851). Google ScholarDigital Library
- Zhang, W., Xue, X., Sun, Z., Guo, Y.-F., & Lu, H. (2007). Optimal dimensionality of metric space for classification. Proc. 24th Intl. Conf. Mach. Learn. (pp. 1135--1142). Google ScholarDigital Library
- Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schöölkopf, B. (2003). Learning with local and global consistency. In Adv. Neural Inf. Process. Syst. 17, 321--328.Google Scholar
- Zhou, Z.-H., & Dai, H.-B. (2006). Query-sensitive similarity measure for content-based image retrieval. Proc. 6th Intl. Conf. Data Min. (pp. 1211--1215). Google ScholarDigital Library
- Zhou, Z.-H., & Yang, Y. (2005). Ensembling local learners through multimodal perturbation. IEEE Trans. Syst., Man and Cybern. - B, 35, 725--735. Google ScholarDigital Library
- Zhu, X., Ghahramani, Z., & Lafferty, J. (2003). Semi-supervised learning using Gaussian fields and harmonic functions. Proc. 20th Intl. Conf. Mach. Learn. (pp. 912--919).Google Scholar
Index Terms
- Learning instance specific distances using metric propagation
Recommendations
Multi-instance Metric Learning
ICDM '11: Proceedings of the 2011 IEEE 11th International Conference on Data MiningMulti-instance learning, like other machine learning and data mining tasks, requires distance metrics. Although metric learning methods have been studied for many years, metric learners for multi-instance learning remain almost untouched. In this paper, ...
Instance specific metric subspace learning: a Bayesian approach
AAAI'16: Proceedings of the Thirtieth AAAI Conference on Artificial IntelligenceInstead of using a uniform metric, instance specific distance learning methods assign multiple metrics for different localities, which take data heterogeneity into consideration. Therefore, they may improve the performance of distance based classifiers, ...
Learning instance specific distance for multi-instance classification
AAAI'11: Proceedings of the Twenty-Fifth AAAI Conference on Artificial IntelligenceMulti-Instance Learning (MIL) deals with problems where each training example is a bag, and each bag contains a set of instances. Multi-instance representation is useful in many real world applications, because it is able to capture more structural ...
Comments