Sparse nonnegative tensor decomposition using proximal algorithm and inexact block coordinate descent scheme
Wang, D., Chang, Z., & Cong, F. (2021). Sparse nonnegative tensor decomposition using proximal algorithm and inexact block coordinate descent scheme. Neural Computing and Applications, 33(24), 17369-17387. https://doi.org/10.1007/s00521-021-06325-8
Published in
Neural Computing and ApplicationsDate
2021Discipline
Secure Communications Engineering and Signal ProcessingTekniikkaTietotekniikkaSecure Communications Engineering and Signal ProcessingEngineeringMathematical Information TechnologyCopyright
© The Author(s) 2021
Nonnegative tensor decomposition is a versatile tool for multiway data analysis, by which the extracted components are nonnegative and usually sparse. Nevertheless, the sparsity is only a side effect and cannot be explicitly controlled without additional regularization. In this paper, we investigated the nonnegative CANDECOMP/PARAFAC (NCP) decomposition with the sparse regularization item using l1-norm (sparse NCP). When high sparsity is imposed, the factor matrices will contain more zero components and will not be of full column rank. Thus, the sparse NCP is prone to rank deficiency, and the algorithms of sparse NCP may not converge. In this paper, we proposed a novel model of sparse NCP with the proximal algorithm. The subproblems in the new model are strongly convex in the block coordinate descent (BCD) framework. Therefore, the new sparse NCP provides a full column rank condition and guarantees to converge to a stationary point. In addition, we proposed an inexact BCD scheme for sparse NCP, where each subproblem is updated multiple times to speed up the computation. In order to prove the effectiveness and efficiency of the sparse NCP with the proximal algorithm, we employed two optimization algorithms to solve the model, including inexact alternating nonnegative quadratic programming and inexact hierarchical alternating least squares. We evaluated the proposed sparse NCP methods by experiments on synthetic, real-world, small-scale, and large-scale tensor data. The experimental results demonstrate that our proposed algorithms can efficiently impose sparsity on factor matrices, extract meaningful sparse components, and outperform state-of-the-art methods.
...
Publisher
SpringerISSN Search the Publication Forum
0941-0643Keywords
Publication in research information system
https://converis.jyu.fi/converis/portal/detail/Publication/101378003
Metadata
Show full item recordCollections
Additional information about funding
Open access funding provided by University of Jyväskylä (JYU). This work was supported by National Natural Science Foundation of China (Grant No.91748105), National Foundation in China (No. JCKY2019110B009 & 2020-JCJQ-JJ-252), the Fundamental Research Funds for the Central Universities [DUT20LAB303 & DUT20LAB308] in Dalian University of Technology in China, and the scholarship from China Scholarship Council (No. 201600090043). ...License
Related items
Showing items with similar title or keywords.
-
Higher-order Nonnegative CANDECOMP/PARAFAC Tensor Decomposition Using Proximal Algorithm
Wang, Deqing; Cong, Fengyu; Ristaniemi, Tapani (IEEE, 2019)Tensor decomposition is a powerful tool for analyzing multiway data. Nowadays, with the fast development of multisensor technology, more and more data appear in higherorder (order > 4) and nonnegative form. However, the ... -
Extracting multi-mode ERP features using fifth-order nonnegative tensor decomposition
Wang, Deqing; Zhu, Yongjie; Ristaniemi, Tapani; Cong, Fengyu (Elsevier BV, 2018)Background Preprocessed Event-related potential (ERP) data are usually organized in multi-way tensor, in which tensor decomposition serves as a powerful tool for data processing. Due to the limitation of computation burden ... -
Shared and Unshared Feature Extraction in Major Depression During Music Listening Using Constrained Tensor Factorization
Wang, Xiulin; Liu, Wenya; Wang, Xiaoyu; Mu, Zhen; Xu, Jing; Chang, Yi; Zhang, Qing; Wu, Jianlin; Cong, Fengyu (Frontiers Media SA, 2021)Ongoing electroencephalography (EEG) signals are recorded as a mixture of stimulus-elicited EEG, spontaneous EEG and noises, which poses a huge challenge to current data analyzing techniques, especially when different ... -
Increasing Stability of EEG Components Extraction Using Sparsity Regularized Tensor Decomposition
Wang, Deqing; Wang, Xiaoyu; Zhu, Yongjie; Toiviainen, Petri; Huotilainen, Minna; Ristaniemi, Tapani; Cong, Fengyu (Springer International Publishing, 2018)Tensor decomposition has been widely employed for EEG signal processing in recent years. Constrained and regularized tensor decomposition often attains more meaningful and interpretable results. In this study, we applied ... -
Low-rank approximation based non-negative multi-way array decomposition on event-related potentials
Cong, Fengyu; Zhou, Guoxu; Astikainen, Piia; Zhao, Qibin; Wu, Qiang; Nandi, Asoke; Hietanen, Jari K.; Ristaniemi, Tapani; Cichocki, Andrzej (World Scientific, 2014)Non-negative tensor factorization (NTF) has been successfully applied to analyze event-related potentials (ERPs), and shown superiority in terms of capturing multi-domain features. However, the time-frequency representation ...