Multilayer Sparsity-Based Tensor Decomposition for Low-Rank Tensor Completion

Author(s):  
Jize Xue ◽  
Yongqiang Zhao ◽  
Shaoguang Huang ◽  
Wenzhi Liao ◽  
Jonathan Cheung-Wai Chan ◽  
...  
2020 ◽  
Vol 34 (04) ◽  
pp. 4804-4810
Author(s):  
Ziyue Li ◽  
Nurettin Dorukhan Sergin ◽  
Hao Yan ◽  
Chen Zhang ◽  
Fugee Tsung

Low-rank tensor decomposition and completion have attracted significant interest from academia given the ubiquity of tensor data. However, low-rank structure is a global property, which will not be fulfilled when the data presents complex and weak dependencies given specific graph structures. One particular application that motivates this study is the spatiotemporal data analysis. As shown in the preliminary study, weakly dependencies can worsen the low-rank tensor completion performance. In this paper, we propose a novel low-rank CANDECOMP / PARAFAC (CP) tensor decomposition and completion framework by introducing the L1-norm penalty and Graph Laplacian penalty to model the weakly dependency on graph. We further propose an efficient optimization algorithm based on the Block Coordinate Descent for efficient estimation. A case study based on the metro passenger flow data in Hong Kong is conducted to demonstrate an improved performance over the regular tensor completion methods.


Author(s):  
Tianheng Zhang ◽  
Jianli Zhao ◽  
Qiuxia Sun ◽  
Bin Zhang ◽  
Jianjian Chen ◽  
...  

2019 ◽  
Vol 73 ◽  
pp. 62-69 ◽  
Author(s):  
Wen-Hao Xu ◽  
Xi-Le Zhao ◽  
Teng-Yu Ji ◽  
Jia-Qing Miao ◽  
Tian-Hui Ma ◽  
...  

2021 ◽  
Author(s):  
Shengchuan Li ◽  
Yanmei Wang ◽  
Qiong Luo ◽  
Kai Wang ◽  
Zhi Han ◽  
...  

2020 ◽  
Vol 31 (11) ◽  
pp. 4567-4581 ◽  
Author(s):  
Jize Xue ◽  
Yongqiang Zhao ◽  
Wenzhi Liao ◽  
Jonathan Cheung-Wai Chan ◽  
Seong G. Kong

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Jinzhi Liao ◽  
Jiuyang Tang ◽  
Xiang Zhao ◽  
Haichuan Shang

POI recommendation finds significant importance in various real-life applications, especially when meeting with location-based services, e.g., check-ins social networks. In this paper, we propose to solve POI recommendation through a novel model of dynamic tensor, which is among the first triumphs of its kind. In order to carry out timely recommendation, we predict POI by utilizing a completion algorithm based on fast low-rank tensor. Particularly, the dynamic tensor structure is complemented by the fast low-rank tensor completion algorithm so as to achieve prediction with better performance, where the parameter optimization is achieved by a pigeon-inspired heuristic algorithm. In short, our POI recommendation via the dynamic tensor method can take advantage of the intrinsic characteristics of check-ins data due to the multimode features such as current categories, subsequent categories, and temporal information as well as seasons variations are all integrated into the model. Extensive experiment results not only validate the superiority of our proposed method but also imply the application prospect in large-scale and real-time POI recommendation environment.


Sign in / Sign up

Export Citation Format

Share Document