TY - JOUR
T1 - Feature Extraction for Incomplete Data Via Low-Rank Tensor Decomposition With Feature Regularization
AU - Shi, Qiquan
AU - Cheung, Yiu-Ming
AU - Zhao, Qibin
AU - Lu, Haiping
N1 - Funding Information:
Manuscript received April 16, 2018; revised August 10, 2018; accepted September 26, 2018. Date of publication October 29, 2018; date of current version May 23, 2019. This work was supported in part by the National Natural Science Foundation of China under Grant 61672444, Grant 61272366, and Grant 61773129, in part by the Faculty Research Grant of Hong Kong Baptist University under Project FRG2/17-18/082, in part by SZSTI under Grant JCYJ20160531194006833, and in part by JSPS KAKENHI under Grant 17K00326. (Corresponding author: Yiu-Ming Cheung.) Q. Shi is with the Huawei Noah’s Ark Lab, Hong Kong 999077 (e-mail: [email protected]).
PY - 2019/6
Y1 - 2019/6
N2 - Multidimensional data (i.e., tensors) with missing entries are common in practice. Extracting features from incomplete tensors is an important yet challenging problem in many fields such as machine learning, pattern recognition, and computer vision. Although the missing entries can be recovered by tensor completion techniques, these completion methods focus only on missing data estimation instead of effective feature extraction. To the best of our knowledge, the problem of feature extraction from incomplete tensors has yet to be well explored in the literature. In this paper, we therefore tackle this problem within the unsupervised learning environment. Specifically, we incorporate low-rank tensor decomposition with feature variance maximization (TDVM) in a unified framework. Based on orthogonal Tucker and CP decompositions, we design two TDVM methods, TDVM-Tucker and TDVM-CP, to learn low-dimensional features viewing the core tensors of the Tucker model as features and viewing the weight vectors of the CP model as features. TDVM explores the relationship among data samples via maximizing feature variance and simultaneously estimates the missing entries via low-rank Tucker/CP approximation, leading to informative features extracted directly from observed entries. Furthermore, we generalize the proposed methods by formulating a general model that incorporates feature regularization into low-rank tensor approximation. In addition, we develop a joint optimization scheme to solve the proposed methods by integrating the alternating direction method of multipliers with the block coordinate descent method. Finally, we evaluate our methods on six real-world image and video data sets under a newly designed multiblock missing setting. The extracted features are evaluated in face recognition, object/action classification, and face/gait clustering. Experimental results demonstrate the superior performance of the proposed methods compared with the state-of-the-art approaches.
AB - Multidimensional data (i.e., tensors) with missing entries are common in practice. Extracting features from incomplete tensors is an important yet challenging problem in many fields such as machine learning, pattern recognition, and computer vision. Although the missing entries can be recovered by tensor completion techniques, these completion methods focus only on missing data estimation instead of effective feature extraction. To the best of our knowledge, the problem of feature extraction from incomplete tensors has yet to be well explored in the literature. In this paper, we therefore tackle this problem within the unsupervised learning environment. Specifically, we incorporate low-rank tensor decomposition with feature variance maximization (TDVM) in a unified framework. Based on orthogonal Tucker and CP decompositions, we design two TDVM methods, TDVM-Tucker and TDVM-CP, to learn low-dimensional features viewing the core tensors of the Tucker model as features and viewing the weight vectors of the CP model as features. TDVM explores the relationship among data samples via maximizing feature variance and simultaneously estimates the missing entries via low-rank Tucker/CP approximation, leading to informative features extracted directly from observed entries. Furthermore, we generalize the proposed methods by formulating a general model that incorporates feature regularization into low-rank tensor approximation. In addition, we develop a joint optimization scheme to solve the proposed methods by integrating the alternating direction method of multipliers with the block coordinate descent method. Finally, we evaluate our methods on six real-world image and video data sets under a newly designed multiblock missing setting. The extracted features are evaluated in face recognition, object/action classification, and face/gait clustering. Experimental results demonstrate the superior performance of the proposed methods compared with the state-of-the-art approaches.
KW - Feature extraction
KW - feature regularization
KW - incomplete tensor
KW - low-rank tensor completion
KW - orthogonal tensor decomposition
KW - variance maximization
UR - http://www.scopus.com/inward/record.url?scp=85055673592&partnerID=8YFLogxK
U2 - 10.1109/TNNLS.2018.2873655
DO - 10.1109/TNNLS.2018.2873655
M3 - Journal article
C2 - 30371391
AN - SCOPUS:85055673592
SN - 2162-237X
VL - 30
SP - 1803
EP - 1817
JO - IEEE Transactions on Neural Networks and Learning Systems
JF - IEEE Transactions on Neural Networks and Learning Systems
IS - 6
M1 - 8513841
ER -