Advertisement

Greedy Unsupervised Multiple Kernel Learning

  • Grigorios Tzortzis
  • Aristidis Likas
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7297)

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.

Keywords

Feature Space Neural Information Processing System Multiple Kernel Multiple Kernel Learning Kernel Cluster 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bishop, C.M.: Pattern Recognition and Machine Learning. Springer-Verlag New York, Inc. (2006)Google Scholar
  2. 2.
    Cortes, C., Mohri, M., Rostamizadeh, A.: L2 regularization for learning kernels. In: Conf. on Uncertainty in Artificial Intelligence, pp. 109–116 (2009)Google Scholar
  3. 3.
    Cortes, C., Mohri, M., Rostamizadeh, A.: Learning non-linear combinations of kernels. In: Advances in Neural Information Processing Systems, pp. 396–404 (2009)Google Scholar
  4. 4.
    Filippone, M., Camastra, F., Masulli, F., Rovetta, S.: A survey of kernel and spectral methods for clustering. Pattern Recognition 41(1), 176–190 (2008)zbMATHCrossRefGoogle Scholar
  5. 5.
    Gönen, M., Alpaydin, E.: Multiple kernel learning algorithms. J. of Machine Learning Research 12, 2211–2268 (2011)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Lange, T., Buhmann, J.M.: Fusion of similarity data in clustering. In: Advances in Neural Information Processing Systems, pp. 723–730 (2005)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Valizadegan, H., Jin, R.: Generalized maximum margin clustering and unsupervised kernel learning. In: Advances in Neural Information Processing Systems, pp. 1417–1424 (2006)Google Scholar
  10. 10.
    Varma, M., Babu, B.R.: More generality in efficient multiple kernel learning. In: Int. Conf. on Machine Learning, pp. 1065–1072 (2009)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    Zhao, B., Kwok, J.T., Zhang, C.: Multiple kernel clustering. In: SIAM Int. Conf. on Data Mining, pp. 638–649 (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Grigorios Tzortzis
    • 1
  • Aristidis Likas
    • 1
  1. 1.Department of Computer ScienceUniversity of IoanninaIoanninaGreece

Personalised recommendations