[1] B. Sch¨olkopf and A. Smola, Learning with Kernels. Cambridge,
Massachusetts: The MIT Press, 2002.
[2] H. Lua, K. N. Plataniotisb, and A. N. Venetsanopoulos, “A survey
of multilinear subspace learning for tensor data,” Pattern Recognition,
vol. 44, pp. 1540–1551, 2011.
[3] X. Guo, L. Zhang, and X. Huang, “Hyperspectral image noise reduction
based on rank-1 tensor decomposition,” ISPRS Journal of
Photogrammetry and Remote Sensing, vol. 83, pp. 50–63, 2013.
[4] D. Cai, X. He, and J. Han, “Tensor space model for document
analysis,” in Proceedings of the 29th annual international ACM SIGIR
conference on Research and development in information retrieval,
2006, pp. 625 – 626.
[5] T. G. Kolda, “Multilinear operators for higher-order decompositions,”
Sandia National Laboratories, Tech. Rep., 2006.
[6] T. G. Kolda and B. W. Bader, “Tensor decompositions and applications,”
SIAM Review, vol. 51, no. 3, pp. 455–500, 2009.
[7] G. A. Shaw and H. hua K. Burke, “Spectral imaging for remote
sensing,” Lincoln Laboratory Journal, vol. 14, no. 1, pp. 3–28, 2003.
[8] C. Bishop, Pattern Recognition and Machine Learning, ser. Information
Science and Statistics. Springer, 2006.
[9] G. Golub and C. van Loan, Matrix Computations, 3rd ed. Maryland:
The Johns Hopkins University Press, 1996.
[10] S. Aja-Fern´andez, G. R. Luis, D. Tao, and X. Li, Tensors in Image
Processing and Computer Vision. Springer, 2009.
[11] Y. Tang, R. Salakhutdinov, and G. Hinton, “Tensor analyzers,” in Proceedings
of the 30th International Conference on Machine Learning,
Atlanta, USA, 2013.
[12] A. Shashua and T. Hazan, “Non-negative tensor factorization with
applications to statistics and computer vision,” in Proceedings of
International Conference on Machine Learning (ICML), 2005, pp.
792–799.
[13] M. Morup, “Applications of tensor (multiway array) factorizations and
decompositions in data mining,” Wiley Interdisciplinary Reviews: Data
Mining and Knowledge Discovery, vol. 1, no. 1, pp. 24–40, 2011.
[14] H. Kiers, “Towards a standardized notation and terminology in multiway
analysis,” Journal of Chemometrics, vol. 14, no. 3, pp. 105–122,
2000.
[15] L. DeLathauwer, B. DeMoor, and J. Vandewalle, “A multilinear
singular value decomposition,” SIAM Journal of Matrix Analysis and
Applications, vol. 21, no. 4, pp. 1253–1278, 2001.
[16] ——, “On the best rank-1 and rank-(r1; r2; � � � ; rn) approximation
of higherorder tensors,” SIAM Journal of Matrix Analysis and Applications,
vol. 21, p. 13241342, 2000.
[17] D. D. Lee and H. S. Seung, “Learning the parts of objects by nonnegative
matrix factorization,” Nature, vol. 401, no. 6755, p. 788791,
1999.
[18] ——, “Algorithms for non-negative matrix factorization,” in Advances
in Neural Information Processing Systems (NIPS), T. K. Leen, T. G.
Diettercih, and V. Tresp, Eds., vol. 13. MIT Press, 2001, pp. 556–562.
[19] C. Lin, “Projected gradient methods for nonnegative matrix factorization,”
Neural Computation, vol. 19, no. 10, p. 27562779, 2007.
[20] M. Welling and M. Weber, “Positive tensor factorization,” Pattern
Recognition Letters, vol. 22, pp. 1255–1261, 2001.
[21] M. P. Friedlander and K. Hatz, “Computing non-negative tensor
factorizations,” Optimization Methods and Software, vol. 23, no. 4,
pp. 631–647, 2008.
[22] J. Liu, J. Liu, P. Wonka, and J. Ye, “Sparse non-negative tensor factorization
using columnwise coordinate descent,” Pattern Recognition,
vol. 45, pp. 649–656, 2012.
[23] F. Wu, X. Tan, Y. Yang, D. Tao, S. Tang, and Y. Zhuang, “Supervised
nonnegative tensor factorization with maximum-margin constraint,”
in Proceedings of the Twenty-Seventh AAAI Conference on Artificial
Intelligence, 2013, pp. 962–968.
[24] Z. Y. Zhang, T. Li, and C. Ding, “Non-negative tri-factor tensor
decomposition with applications,” Knowledge Information Systems,
vol. 34, pp. 243–265, 2013.
[25] H. Liu, Z. Wu, X. Li, D. Cai, and T. S. Huang, “Constrained nonnegative
matrix factorization for image representation,” IEEE Transactions
on Pattern Analysis and Machine Intelligence, vol. 34, no. 7, pp. 1299–
1311, 2012.
[26] A. Adler, M. Elad, and Y. Hel-Or, “Probabilistic subspace clustering
via sparse representations,” IEEE Signal Processing Letters, vol. 20,
no. 1, pp. 63–66, 2013.
[27] A. Kapteyn, H. Neudecker, and T. Wansbeek, “An approach to n-mode
components analysis,” Psychometrika, vol. 51, pp. 269–275, 1986.
[28] C. Ding and T. Li, “Adaptive dimension reduction using discriminant
analysis and K-means clustering,” in Proceedings of International
Conference on Machine Learning, 2007, pp. 521–528.
[29] M. Vichi and H. A. L. Kiers, “Factorial K-means analysis for two-way
data,” Computational Statistics & Data Analysis, vol. 37, pp. 49–64,
2001.
[30] N. D. Ho, “Non-negative matrix factorization algorithms and applications,”
Ph.D. dissertation, Department of Applied Mathematics,
Universite Catholique de Louvain, 2008.
[31] Y.-D. Kim and S. Choi, “Nonnegative Tucker decomposition,” in
Proceedings of IEEE Conference on Computer Vision and Pattern
Recognition (CVPR), 2007.
[32] E. C. Chi and T. G. Kolda, “On tensors, sparsity, and nonnegative
factorizations,” SIAM Journal on Matrix Analysis and Applications,
vol. 33, no. 4, pp. 1272–1299, 2012.
[33] P. Schonemann, “A generalized solution of the orthogonal Procrustes
problem,” Psychometrika, vol. 31, pp. 1–10, 1966.
[34] Y. Nesterov, Introductory lectures on convex optimization: A basic
course. Kluwer Academic Publishers, 2003.
[35] Y. Xu and W. Yin, “A block coordinate descent method for regularized
multiconvex optimization with applications to nonnegative tensor
factorization and completion,” SIAM J. of Imaging Sciences, vol. 6,
no. 3, pp. 1758–1789, 2013.
[36] J. Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE
Transactions on Pattern Analysis and Machine Intelligence, vol. 22,
pp. 888–905, 1997.
[37] H. Kim and H. Park, “Sparse non-negative matrix factorization via
alternating non-negativity-constrained least squares for microarray data
analysis,” Bioinformatics, vol. 23, no. 12, pp. 1495–1502, 2007.
[38] M. Schmidt, O. Winther, and L. Hansen, “Bayesian non-negative
matrix factorization,” in Lecture Notes in Computer Science (LNCS):
Proc. of International Conf on Independent Component Analysis and
Signal Separation, vol. 5541, 2009, pp. 540–547.
[39] Q. Gu and J. Zhou, “Co-clustering on manifolds,” in The 15th ACM
SIGKDD International Conference on Knowledge Discovery and Data
Mining (KDD), Paris, France, 2009.
[40] D. Cai, X. He, X. Wang, H. Bao, and J. Han, “Locality preserving
nonnegative matrix factorization,” in Proc. of Int. Joint Conference on
Artificial Intelligence (IJCAI), 2009.
[41] S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition
by basis pursuit,” SIAM Review, vol. 43, no. 1, pp. 129–159, Jan.
2001.
[42] D. Cai, X. He, J. Han, and T. S. Huang, “Graph regularized nonnegative
matrix factorization for data representation. , 33(8):, 2011.”
IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 33, no. 8, pp. 1548–1560, 2011.
1572