Abstract
Multiple kernel learning (MKL) has emerged as a powerful tool for considering multiple kernels when the appropriate representation of the data is unknown. Some of these kernels may be complementary, while others irrelevant to the learning task. In this work we present an MKL method for clustering. The intra-cluster variance objective is extended by learning a linear combination of kernels, together with the cluster labels, through an iterative procedure. Closed-form updates for the combination weights are derived, that greatly simplify the optimization. Moreover, to allow for robust kernel mixtures, a parameter that regulates the sparsity of the weights is incorporated into our framework. Experiments conducted on a collection of images reveal the effectiveness of the proposed method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bishop, C.M.: Pattern Recognition and Machine Learning. Springer-Verlag New York, Inc. (2006)
Cortes, C., Mohri, M., Rostamizadeh, A.: L2 regularization for learning kernels. In: Conf. on Uncertainty in Artificial Intelligence, pp. 109–116 (2009)
Cortes, C., Mohri, M., Rostamizadeh, A.: Learning non-linear combinations of kernels. In: Advances in Neural Information Processing Systems, pp. 396–404 (2009)
Filippone, M., Camastra, F., Masulli, F., Rovetta, S.: A survey of kernel and spectral methods for clustering. Pattern Recognition 41(1), 176–190 (2008)
Gönen, M., Alpaydin, E.: Multiple kernel learning algorithms. J. of Machine Learning Research 12, 2211–2268 (2011)
Kloft, M., Brefeld, U., Sonnenburg, S., Laskov, P., Müller, K.R., Zien, A.: Efficient and accurate lp-norm multiple kernel learning. In: Advances in Neural Information Processing Systems, pp. 997–1005 (2009)
Lange, T., Buhmann, J.M.: Fusion of similarity data in clustering. In: Advances in Neural Information Processing Systems, pp. 723–730 (2005)
Tzortzis, G., Likas, A.: The global kernel k-means algorithm for clustering in feature space. IEEE Trans. on Neural Networks 20(7), 1181–1194 (2009)
Valizadegan, H., Jin, R.: Generalized maximum margin clustering and unsupervised kernel learning. In: Advances in Neural Information Processing Systems, pp. 1417–1424 (2006)
Varma, M., Babu, B.R.: More generality in efficient multiple kernel learning. In: Int. Conf. on Machine Learning, pp. 1065–1072 (2009)
Xu, Z., Jin, R., Yang, H., King, I., Lyu, M.R.: Simple and efficient multiple kernel learning by group lasso. In: Int. Conf. on Machine Learning, pp. 1175–1182 (2010)
Zeng, H., Cheung, Y.-M.: Kernel Learning for Local Learning Based Clustering. In: Alippi, C., Polycarpou, M., Panayiotou, C., Ellinas, G. (eds.) ICANN 2009, Part I. LNCS, vol. 5768, pp. 10–19. Springer, Heidelberg (2009)
Zhao, B., Kwok, J.T., Zhang, C.: Multiple kernel clustering. In: SIAM Int. Conf. on Data Mining, pp. 638–649 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tzortzis, G., Likas, A. (2012). Greedy Unsupervised Multiple Kernel Learning. In: Maglogiannis, I., Plagianakos, V., Vlahavas, I. (eds) Artificial Intelligence: Theories and Applications. SETN 2012. Lecture Notes in Computer Science(), vol 7297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30448-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-30448-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30447-7
Online ISBN: 978-3-642-30448-4
eBook Packages: Computer ScienceComputer Science (R0)