Research
Print page Print page
Switch language
The Capital Region of Denmark - a part of Copenhagen University Hospital
Published

Algorithms for sparse nonnegative Tucker decompositions

Research output: Contribution to journalJournal articleResearchpeer-review

  1. Infinite von Mises-Fisher Mixture Modeling of Whole Brain fMRI Data

    Research output: Contribution to journalJournal articleResearchpeer-review

  2. Bayesian model comparison in nonlinear BOLD fMRI hemodynamics

    Research output: Contribution to journalJournal articleResearchpeer-review

  1. Arguments for a Phenomenologically Informed Clinical Approach to Autism Spectrum Disorder

    Research output: Contribution to journalReviewResearchpeer-review

  2. Transdiagnostic group CBT for anxiety disorders: the unified protocol in mental health services

    Research output: Contribution to journalJournal articleResearchpeer-review

  3. Cognitive behavioural therapy for ADHD in adults: systematic review and meta-analyses

    Research output: Contribution to journalJournal articleResearchpeer-review

  4. Et læringsteoretisk perspektiv på klinisk mesterlære

    Research output: Contribution to journalJournal articleResearchpeer-review

View graph of relations
There is a increasing interest in analysis of large-scale multiway data. The concept of multiway data refers to arrays of data with more than two dimensions, that is, taking the form of tensors. To analyze such data, decomposition techniques are widely used. The two most common decompositions for tensors are the Tucker model and the more restricted PARAFAC model. Both models can be viewed as generalizations of the regular factor analysis to data of more than two modalities. Nonnegative matrix factorization (NMF), in conjunction with sparse coding, has recently been given much attention due to its part-based and easy interpretable representation. While NMF has been extended to the PARAFAC model, no such attempt has been done to extend NMF to the Tucker model. However, if the tensor data analyzed are nonnegative, it may well be relevant to consider purely additive (i.e., nonnegative) Tucker decompositions). To reduce ambiguities of this type of decomposition, we develop updates that can impose sparseness in any combination of modalities, hence, proposed algorithms for sparse nonnegative Tucker decompositions (SN-TUCKER). We demonstrate how the proposed algorithms are superior to existing algorithms for Tucker decompositions when the data and interactions can be considered nonnegative. We further illustrate how sparse coding can help identify what model (PARAFAC or Tucker) is more appropriate for the data as well as to select the number of components by turning off excess components. The algorithms for SN-TUCKER can be downloaded from Mørup (2007).
Original languageEnglish
JournalNeural Computation
Volume20
Issue number8
Pages (from-to)2112-31
Number of pages20
ISSN0899-7667
DOIs
Publication statusPublished - 1 Aug 2008

    Research areas

  • Algorithms, Artificial Intelligence, Brain, Computer Simulation, Electroencephalography, Humans, Signal Processing, Computer-Assisted, Software, Statistics as Topic

ID: 32752430