Abstract Non-negative tensor factorization (NTF) has recently been proposed as sparse and efficient image representation (Welling and Weber, Patt. Rec. Let., 2001). Until now, sparsity of the tensor factorization has been empirically observed in many cases, but there was no systematic way to control it. In this work, we show that a sparsity measure recently proposed for non-negative matrix factorization (Hoyer, J. Mach. Learn. Res., 2004) applies to NTF and allows precise control over sparseness of the resulting factorization. We devise an algorithm based on sequential conic programming and show improved performance over classical NTF codes on artificial and on real-world data sets.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Controlling Sparseness in Non-negative Tensor Factorization


    Beteiligte:


    Erscheinungsdatum :

    2006-01-01


    Format / Umfang :

    12 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Controlling Sparseness in Non-negative Tensor Factorization

    Heiler, M. / Schnorr, C. | British Library Conference Proceedings | 2006


    Sparse image coding using a 3D non-negative tensor factorization

    Hazan, T. / Polak, S. / Shashua, A. | IEEE | 2005


    Sparse Image Coding Using a 3D Non-Negative Tensor Factorization

    Hazan, T. / Polak, S. / Shashua, A. et al. | British Library Conference Proceedings | 2005


    Multi-way Clustering Using Super-Symmetric Non-negative Tensor Factorization

    Shashua, Amnon / Zass, Ron / Hazan, Tamir | Springer Verlag | 2006

    Freier Zugriff

    Multi-way Clustering Using Super-Symmetric Non-negative Tensor Factorization

    Shashua, A. / Zass, R. / Hazan, T. | British Library Conference Proceedings | 2006