Principal Convex Hull / Archetypal Analysis
Efficient algorithms for Archetypal Analysis for regular data, kernels and sparse data as described in M. Mørup and L. K. Hansen, Archetypal Analysis for Data Mining, Neural Computing 2011.
download .zip file).

Matlab scripts (written by J. C. Thøgersen.) accompanying the paper by J. C. Thøgersen, M. Mørup, S. Damkiær, S. Molin and L. Jelsbak, Archetypal analysis of diverse Pseudomonas aeruginosa transcriptomes reveals adaptation in cystic fibrosis airways, BMC Bioinformatics, 2013.
(download .zip file)   


Software tool for analyzing event related EEG and MEG data. Among many functionalities, the toolbox include wavelet transformation, non-negative matrix and tensor factorization as well as various visualization methods  (go to to learn more).

Exercise Material for CP and Tucker Decompositions
This exercise material is used for the teaching of tensor decomposition approaches for CP and Tucker decomposition as described in the review paper M. Mørup Applications of tensor (multiway array) factorizations and decompositions in data mining, Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery.
(download .zip file).

The shiftCP model as described in M. Mørup et al. “Shift Invariant Multilinear Decomposition of Neuroimaging Data” NeuroImage 2008. The model is a generalization of the Canonical Decomposition/PARAFAC (CP)model to include temporal shifts that are specific to a given mode of the tensor.
(download .zip file)

The Convolutive CP model is a generalization of the Canonical Decomposition/PARAFAC (CP) model to include latency and shape changes. The model includes an implementation of automatic relevance determination in order to determine model order. The method is described in M. Mørup, K. H. Madsen, L. K. Hansen “Modeling trial based neuromaging data”, NIPS 2008 workshop on New Directions in Statistical Learning for Meaningful and Reproducible fMRI Analysis and M. Mørup, L.K. Hansen, K. H. Madsen “Modeling Latency and Shape Changes in Trial Based Neuroimaging Data”, ASILOMAR-SSC 2011.
(download .zip file)

Automatic Relevance Determination for CP and Tucker
This demo implements automatic relevance determination for the CP and Tucker models as described in our article M. Mørup and L. K. Hansen “Automatic Relevance Determination for Multiway Models”, Journal of Chemometrics. The code infers the number of components of the CP and Tucker model at the computational cost of fitting one ordinary model. (download .zip file)

Bayesian Community Detection
This software implement our extension of the IRM model to enforce community structure in complex networks as described in our article entitled M. Mørup and M. N. Schmidt “Bayesian Community Detection” submitted to Neural Computation.
(download .zip file).

Exercise material on the Infinite Relational Model
This exercise material include Matlab implementation of the IRM model for uni-partite and bi-partite networks including split-merge sampling and extensions to multi-graphs. Included are scripts for evaluating extracted structure by normalized mutual information and link-prediction.(download .zip file).

This demo implements the non-negative least angle regression and selection method described in M. Mørup, K. H. Madsen, L. K. Hansen ”Approximate L0 constrained Non-negative Matrix and Tensor Factorization” IEEE International Symposium on Circuits and Systems 2008.
(download .zip file)