Matrix computations (3rd ed.)
A Multilinear Singular Value Decomposition
SIAM Journal on Matrix Analysis and Applications
Multilinear Independent Components Analysis
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Handwritten digit classification using higher order singular value decomposition
Pattern Recognition
Algorithms for sparse nonnegative tucker decompositions
Neural Computation
Tensor Decompositions and Applications
SIAM Review
Gene expression data classification based on non-negative matrix factorization
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Classification approach based on non-negative least squares
Neurocomputing
Hi-index | 0.00 |
With the recent advances in microarray technology, the expression levels of genes with respect to samples can be monitored over a series of time points. Such three-dimensional microarray data, termed gene-sample-time (GST) microarray data, are gene expression matrices measured as a time-series. They have not yet received considerable attention, and analysis methods need to be devised specifically to tackle the complexity of GST datasets. We propose methods that are based on tensor decomposition for the sample classification. We use tensor decomposition in order to extract discriminative features as well as multilinearly reducing high dimensionality. We then classify the test samples in the reduced spaces. We have tested and compared our approaches on a real GST dataset. We show that our methods are at least comparable in prediction accuracy to recent methods devised for GST data. Most importantly, our methods run much faster than current approaches.