Robust blind source separation by beta divergence
Neural Computation
Sparse Image Coding Using a 3D Non-Negative Tensor Factorization
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
A Unifying Approach to Hard and Probabilistic Clustering
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Non-negative tensor factorization with applications to statistics and computer vision
ICML '05 Proceedings of the 22nd international conference on Machine learning
Beyond streams and graphs: dynamic tensor analysis
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Nonnegative matrix factorization with quadratic programming
Neurocomputing
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
Regularized Alternating Least Squares Algorithms for Non-negative Matrix/Tensor Factorization
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III
Controlling sparseness in non-negative tensor factorization
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I
Multi-way clustering using super-symmetric non-negative tensor factorization
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part IV
Csiszár’s divergences for non-negative matrix factorization: family of new algorithms
ICA'06 Proceedings of the 6th international conference on Independent Component Analysis and Blind Signal Separation
Monaural music source separation: nonnegativity, sparseness, and shift-invariance
ICA'06 Proceedings of the 6th international conference on Independent Component Analysis and Blind Signal Separation
Extended SMART algorithms for non-negative matrix factorization
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Choosing parameters in block-iterative or ordered subset reconstruction algorithms
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
In the paper we derive and discuss a wide class of algorithms for 3D Super-symmetric Nonnegative Tensor Factorization (SNTF) or nonnegative symmetric PARAFAC, and as a special case: Symmetric Nonnegative Matrix Factorization (SNMF) that have many potential applications, including multi-way clustering, feature extraction, multi- sensory or multi-dimensional data analysis, and nonnegative neural sparse coding. The main advantage of the derived algorithms is relatively low complexity, and in the case of multiplicative algorithms possibility for straightforward extension of the algorithms to L-order tensors factorization due to some nice symmetric property. We also propose to use a wide class of cost functions such as Squared Euclidean, Kullback Leibler I-divergence, Alpha divergence and Beta divergence. Preliminary experimental results confirm the validity and good performance of some of these algorithms, especially when the data have sparse representations.