A Low-Rank Approximation-Based Transductive Support Tensor Machine for Semisupervised Classification

Xiaolan Liu

doi:10.1109/TIP.2015.2403235

Return

A Low-Rank Approximation-Based Transductive Support Tensor Machine for Semisupervised Classification

2015-06-01

PRE

DOI：10.1109/TIP.2015.2403235

Original

Original request for help

Save

Abstract

En 中文

In the fields of machine learning, pattern recognition, image processing, and computer vision, the data are usually represented by the tensors. For the semisupervised tensor classification, the existing transductive support tensor machine (TSTM) needs to resort to iterative technique, which is very time-consuming. In order to overcome this shortcoming, in this paper, we extend the concave-convex procedure-based transductive support vector machine (CCCP-TSVM) to the tensor patterns and propose a low-rank approximation-based TSTM, in which the tensor rank-one decomposition is used to compute the inner product of the tensors. Theoretically, concave-convex procedure-based TSTM (CCCP-TSTM) is an extension of the linear CCCP-TSVM to tensor patterns. When the input patterns are vectors, CCCP-TSTM degenerates into the linear CCCP-TSVM. A set of experiments is conducted on 23 semisupervised classification tasks, which are generated from seven second-order face data sets, three third-order gait data sets, and two third-order image data sets, to illustrate the performance of the CCCP-TSTM. The results show that compared with CCCP-TSVM and TSTM, CCCP-TSTM provides significant performance gain in terms of test accuracy and training speed.

Keywords:

Concave-convex procedure

semi-supervised tensor classification

tensor rank-one decomposition

transductive support tensor machine (TSTM)

transductive support vector machine (TSVM)

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.