Based on Semi-Supervised Clustering with the Boost Similarity Metric Method for Face Retrieval

Article Preview

Abstract:

The focus of this paper is on Metric Learning, with particular interest in incorporating side information to make it semi-supervised. This study is primarily motivated by an application: face-image clustering. In the paper introduces metric learning and semi-supervised clustering, Boost the similarity metric learning method that adapt the underlying similarity metric used by the clustering algorithm. we propose a novel idea of learning with historical relevance feedback log data, and adopt a new paradigm called Boost the Similarity Metric Method for Face Retrieval, Experimental results demonstrate that the unified approach produces better clusters than both individual approaches as well as previously proposed semi-supervised clustering algorithms. This paper followed by the discussion of experiments on face-image clustering.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2720-2723

Citation:

Online since:

March 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] S. C. H. Hoi, W. Liu, M. R. Lyu, and W. -Y. Ma. Learning distance metrics with contextual constraints for image retrieval. In Proc. CVPR2006, New York, US, June 17–22 (2006).

Google Scholar

[2] K. Weinberger, J. Blitzer, and L. Saul. Distance metric learning for large margin nearest neighbor classification. In NIPS 18, pages 1473–1480, (2006).

Google Scholar

[3] E. P. Xing, A. Y. Ng, M. I. Jordan, and S. Russell. Distance metric learning with application to clustering with side-information. In NIPS2002, (2002).

Google Scholar

[4] Fauer S,Schwenker F,Semi-supervised kernel clustering with sample-to-cluster weights[c]/PSL'11 Proceedings of the First IAPR TC3 Conference on Partially Supervised Learning.Berlin Springer-Verlag,2011:72-81.

DOI: 10.1007/978-3-642-28258-4_8

Google Scholar

[5] Sugato Basu, Mikhail Bilenko, and Raymond J. Mooney. A probabilistic framework for semi-supervised clustering. In KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 59–68, New York, NY, USA, 2004. ACM.

DOI: 10.1145/1014052.1014062

Google Scholar

[6] Frank R. Kschischang, Brendan J. Frey, and Hans-Andrea Loeliger. Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47(2): 498–519, (2001).

DOI: 10.1109/18.910572

Google Scholar