Advertisement

Discriminative Fast Soft Competitive Learning

  • Frank-Michael Schleif
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8681)

Abstract

Proximity matrices like kernels or dissimilarity matrices provide non-standard data representations common in the life science domain. Here we extend fast soft competitive learning to a discriminative and vector labeled learning algorithm for proximity data. It provides a more stable and consistent integration of label information in the cost function solely based on a give proximity matrix without the need of an explicite vector space. The algorithm has linear computational and memory requirements and performs favorable to traditional techniques.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Qin, A.K., Suganthan, P.N.: Kernel neural gas algorithms with application to cluster analysis. In: ICPR, vol. 4, pp. 617–620 (2004)Google Scholar
  2. 2.
    Pekalska, E., Haasdonk, B.: Kernel discriminant analysis for positive definite and indefinite kernels. IEEE TPAMI 31(6), 1017–1032 (2009)CrossRefGoogle Scholar
  3. 3.
    Hammer, B., Hasenfuss, A.: Topographic mapping of large dissimilarity datasets. Neural Computation 22(9), 2229–2284 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Martinetz, T., Berkovich, S., Schulten, K.: Neural Gas Network for Vector Quantization and its Application to Time-Series Prediction. IEEE TNN 4(4), 558–569 (1993)Google Scholar
  5. 5.
    Gisbrecht, A., Mokbel, B., Schleif, F.-M., Zhu, X., Hammer, B.: Linear time relational prototype based learning. Journal of Neural Systems 22(5) (2012)Google Scholar
  6. 6.
    Schleif, F.-M., Zhu, X., Gisbrecht, A., Hammer, B.: Fast approximated relational and kernel clustering. In: Proc. of ICPR 2012, pp. 1229–1232. IEEE (2012)Google Scholar
  7. 7.
    Jain, A.K.: Data clustering: 50 years beyond K-means. Pat. Rec. Let. 31, 651–666 (2010)CrossRefGoogle Scholar
  8. 8.
    Chitta, R., et al.: Approximate kernel k-means: solution to large scale kernel clustering. In: Apté, C. (ed.) KDD, pp. 895–903. ACM (2011)Google Scholar
  9. 9.
    Zhu, X., Goldberg, A.B.: Introduction to semi-supervised learning. Synthesis Lectures on Artif. Intell. and Machine Learning 3(1), 1–130 (2009)Google Scholar
  10. 10.
    Villmann, T., Hammer, B., Schleif, F.-M., Geweniger, T., Herrmann, W.: Fuzzy classification by fuzzy labeled neural gas. Neural Netw. 19(6-7), 772–779 (2006)CrossRefzbMATHGoogle Scholar
  11. 11.
    Villmann, T., Schleif, F.-M., Hammer, B., Kostrzewa, M.: Exploration of mass-spectrometric data in clinical proteomics using learning vector quantization methods. Briefings in Bioinformatics 9(2), 129–143 (2008)CrossRefGoogle Scholar
  12. 12.
    Kästner, M., Villmann, T.: Fuzzy supervised self-organizing map for semi-supervised vector quantization. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2012, Part I. LNCS, vol. 7267, pp. 256–265. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  13. 13.
    Hammer, B., Hasenfuss, A., Schleif, F.-M., Villmann, T.: Supervised batch neural gas. In: Schwenker, F., Marinai, S. (eds.) ANNPR 2006. LNCS (LNAI), vol. 4087, pp. 33–45. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  14. 14.
    Schneider, P., Geweniger, T., Schleif, F.-M., Biehl, M., Villmann, T.: Multivariate class labeling in robust soft LVQ. In: Proc. of ESANN 2011, pp. 17–22 (2011)Google Scholar
  15. 15.
    Finley, T., Joachims, T.: Supervised clustering with support vector machines. In: De Raedt, L. (ed.) ICML, vol. 119, pp. 217–224. ACM (2005)Google Scholar
  16. 16.
    Arandjelovic, O.: Discriminative k-means clustering. In: IJCNN, pp. 1–7 (2013)Google Scholar
  17. 17.
    Badoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: STOC, pp. 250–257 (2002)Google Scholar
  18. 18.
    Alex, N., Hasenfuss, A., Hammer, B.: Patch clustering for massive data sets. Neurocomputing 72(7-9), 1455–1469 (2009)CrossRefGoogle Scholar
  19. 19.
    Cottrell, M., Hammer, B., Hasenfuss, A., Villmann, T.: Batch and median neural gas. Neural Networks 19, 762–771 (2006)CrossRefzbMATHGoogle Scholar
  20. 20.
    Pekalska, E., Duin, R.: The dissimilarity representation for pattern recognition. World Scientific (2005)Google Scholar
  21. 21.
    Williams, C., Seeger, M.: Using the nyström method to speed up kernel machines. In: Leen, T.K. (ed.) NIPS, pp. 682–688. MIT Press (2000)Google Scholar
  22. 22.
    Schleif, F.-M., Gisbrecht, A.: Data analysis of (non-)metric proximities at linear costs. In: Hancock, E., Pelillo, M. (eds.) SIMBAD 2013. LNCS, vol. 7953, pp. 59–74. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  23. 23.
    Tsang, I., Kocsor, A., Kwok, J.: Simpler core vector machines with enclosing balls. In: Proc. of the 24th Int. Conf. on Machine Learning (ICML 2007), pp. 911–918 (2007)Google Scholar
  24. 24.
    Brüß, C., Bollenbeck, F., Schleif, F.-M., et al.: Fuzzy image segmentation with fuzzy labelled neural gas. In: Proc. of ESANN 2006, pp. 563–569 (2006)Google Scholar
  25. 25.
    Schleif, F.-M., Ongyerth, F.-M., Villmann, T.: Supervised data analysis and reliability estimation for spectral data. Neuro Comp. 72(16-18), 3590–3601 (2009)Google Scholar
  26. 26.
    Frénay, B., Verleysen, M.: Parameter-insensitive kernel in extreme learning for non-linear support vector regression. Neuro Comp. 74(16), 2526–2531 (2011)Google Scholar
  27. 27.
    Schleif, F.-M.: Proximity learning for non-standard big data. In: Proceedings of ESANN 2014, pp. 359–364 (2014)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Frank-Michael Schleif
    • 1
  1. 1.School of Computer ScienceUniversity of BirminghamBirminghamUK

Personalised recommendations