Fast nonnegative tensor factorization for very large-scale problems using two-stage procedure
暂无分享,去创建一个
[1] J. Kruskal,et al. How 3-MFA data can cause degenerate parafac solutions, among other relationships , 1989 .
[2] A. Cichocki,et al. Flexible HALS algorithms for sparse non-negative matrix/tensor factorization , 2008, 2008 IEEE Workshop on Machine Learning for Signal Processing.
[3] Andrzej Cichocki,et al. Nonnegative Matrix and Tensor Factorization T , 2007 .
[4] Tamara G. Kolda,et al. Tensor Decompositions and Applications , 2009, SIAM Rev..
[5] Andrzej Cichocki,et al. Fast Local Algorithms for Large Scale Nonnegative Matrix and Tensor Factorizations , 2009, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[6] Rasmus Bro,et al. A comparison of algorithms for fitting the PARAFAC model , 2006, Comput. Stat. Data Anal..
[7] Andrzej Cichocki,et al. Advances in PARAFAC Using Parallel Block Decomposition , 2009, ICONIP.
[8] R. Leeb,et al. BCI Competition 2008 { Graz data set B , 2008 .
[9] Lars Kai Hansen,et al. Decomposing the time-frequency representation of EEG using non-negative matrix and multi-way factorization , 2006 .
[10] J. Chang,et al. Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition , 1970 .