Supervised nonnegative tensor factorization with Maximum-Margin Constraint

22Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

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 particular for 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. Copyright © 2013, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Cite

CITATION STYLE

APA

Wu, F., Tan, X., Yang, Y., Tao, D., Tang, S., & Zhuang, Y. (2013). Supervised nonnegative tensor factorization with Maximum-Margin Constraint. In Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013 (pp. 962–968). https://doi.org/10.1609/aaai.v27i1.8598

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free