Cancer: Another Algorithm for Subtropical Matrix Factorization

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9852)

Abstract

Subtropical algebra is a semi-ring over the nonnegative real numbers with standard multiplication and the addition defined as the maximum operator. Factorizing a matrix over the subtropical algebra gives us a representation of the original matrix with element-wise maximum over a collection of nonnegative rank-1 matrices. Such structure can be compared to the well-known Nonnegative Matrix Factorization (NMF) that gives an element-wise sum over a collection of nonnegative rank-1 matrices. Using the maximum instead of sum changes the ‘parts-of-whole’ interpretation of NMF to ‘winner-takes-it-all’ interpretation. We recently introduced an algorithm for subtropical matrix factorization, called Capricorn, that was designed to work on discrete-valued data with discrete noise [Karaev & Miettinen, SDM ’16]. In this paper we present another algorithm, called Cancer, that is designed to work over continuous-valued data with continuous noise – arguably, the more common case. We show that Cancer is capable of finding sparse factors with excellent reconstruction error, being better than either Capricorn, NMF, or SVD in continuous subtropical data. We also show that the winner-takes-it-all interpretation is usable in many real-world scenarios and lets us find structure that is different, and often easier to interpret, than what is found by NMF.

References

  1. 1.
    Akian, M., Bapat, R., Gaubert, S.: Max-plus algebra. In: Hogben, L. (ed.) Handbook of Linear Algebra. Chapman & Hall/CRC, London (2007)Google Scholar
  2. 2.
    Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.P.: Synchronization and Linearity: An Algebra for Discrete Event Systems. John Wiley & Sons, New York (1992)MATHGoogle Scholar
  3. 3.
    Bělohlávek, R., Krmelova, M.: Factor analysis of ordinal data via decomposition of matrices with grades. Ann. Math. Artif. Intell. 72(1–2), 23–44 (2014)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems, 2nd edn. Springer, Secaucus (2008)CrossRefMATHGoogle Scholar
  5. 5.
    Cichocki, A., Zdunek, R., Phan, A.H., Amari, S.I.: Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation. John Wiley & Sons, Chichester (2009)CrossRefGoogle Scholar
  6. 6.
    Cohen, G., Gaubert, S., Quadrat, J.P.: Max-plus algebra and system theory: where we are and where to go now. Ann. Rev. Control 23, 207–219 (1999)CrossRefGoogle Scholar
  7. 7.
    Georghiades, A.S., Belhumeur, P.N., Kriegman, D.J.: From few to many: generative models for recognition under variable pose and illumination. In: IEEE AFGR, pp. 277–284 (2000)Google Scholar
  8. 8.
    Hoyer, P.O.: Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res. 5, 1457–1469 (2004)MathSciNetMATHGoogle Scholar
  9. 9.
    Karaev, S., Miettinen, P.: Capricorn: an algorithm for subtropical matrix factorization. In: SDM, pp. 702–710 (2016)Google Scholar
  10. 10.
    Miettinen, P.: Matrix decomposition methods for data mining: computational complexity and algorithms. Ph.d. thesis, University of Helsinki (2009)Google Scholar
  11. 11.
    Miettinen, P., Mielikäinen, T., Gionis, A., Das, G., Mannila, H.: The discrete basis problem. IEEE Trans. Knowl. Data Eng. 20(10), 1348–1362 (2008)CrossRefGoogle Scholar
  12. 12.
    Weston, J., Weiss, R.J., Yee, H.: Nonlinear latent factorization by embedding multiple user interests. In: RecSys, pp. 65–68 (2013)Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations