Supervised Nonnegative Tensor Factorization with Maximum-Margin Constraint

Authors

  • Fei Wu Zhejiang University
  • Xu Tan Zhejiang University
  • Yi Yang University of Queensland
  • Dacheng Tao University of Technology, Sydney
  • Siliang Tang Zhejiang University
  • Yueting Zhuang Zhejiang University

DOI:

https://doi.org/10.1609/aaai.v27i1.8598

Keywords:

supervised, tensor factorization, maximum-margin

Abstract

Non-negative tensor factorization (NTF) has attracted great attention in the machine learning community. In this paper, we extend traditional non-negative tensor factorization into a supervised discriminative decomposition, referred as Supervised Non-negative Tensor Factorization with Maximum-Margin Constraint(SNTFM2). SNTFM2 formulates the optimal discriminative factorization of non-negative tensorial data as a coupled least-squares optimization problem via a maximum-margin method. As a result, SNTFM2 not only faithfully approximates the tensorial data by additive combinations of the basis, but also obtains a strong generalization power to discriminative analysis (in particularfor classification in this paper). The experimental results show the superiority of our proposed model over state-of-the-art techniques on both toy and real world data sets.

Downloads

Published

2013-06-30

How to Cite

Wu, F., Tan, X., Yang, Y., Tao, D., Tang, S., & Zhuang, Y. (2013). Supervised Nonnegative Tensor Factorization with Maximum-Margin Constraint. Proceedings of the AAAI Conference on Artificial Intelligence, 27(1), 962-968. https://doi.org/10.1609/aaai.v27i1.8598