Supervised Tensor Learning
Dacheng Tao, Xuelong Li, Weiming Hu et al. · Proceedings · 2006
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 n/sup th/-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.
Cited by 373 works. doi:10.1109/icdm.2005.139
Authors
References
- The Nature of Statistical Learning Theory
- Convex Optimization
- Introduction to Statistical Pattern Recognition
- Pattern Classification
- A Tutorial on Support Vector Machines for Pattern Recognition
- Learning with Kernels
- Numerical optimization
- A model of saliency-based visual attention for rapid scene analysis
- Advances in kernel methods: support vector learning
- A feature-integration theory of attention