Supervised tensor learning

  • Tao D
  • Li X
  • Wu X
 et al. 
  • 115


    Mendeley users who have this article in their library.
  • 223


    Citations of this article.


This paper aims to take general tensors as inputs for supervised learning. A supervised tensor learning (STL) framework is established for convex optimization based learning techniques such as support vector machines (SVM) and minimax probability machines (MPM). Within the STL framework, many conventional learning machines can be generalized to take nth-order tensors as inputs. We also study the applications of tensors to learning machine design and feature extraction by linear discriminant analysis (LDA). Our method for tensor based feature extraction is named the tenor rank-one discriminant analysis (TR1DA). These generalized algorithms have several advantages: 1) reduce the curse of dimension problem in machine learning and data mining; 2) avoid the failure to converge; and 3) achieve better separation between the different categories of samples. As an example, we generalize MPM to its STL version, which is named the tensor MPM (TMPM). TMPM learns a series of tensor projections iteratively. It is then evaluated against the original MPM. Our experiments on a binary classification problem show that TMPM significantly outperforms the original MPM.

Author-supplied keywords

  • Alternating projection
  • Convex optimization
  • Supervised learning
  • Tensor

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Dacheng Tao

  • Xuelong Li

  • Xindong Wu

  • Weiming Hu

  • Stephen J. Maybank

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free