Loading

Tensor Data Imputation by PARAFAC with Updated Chaotic Biases by Adam Optimizer
Pooja Choudhary1, Kanwal Garg2

1Pooja Choudhary, Computer Science & Applications from Department of Computer Science & Applications, Kurukshetra University, Kurukshetra.
2Kanwal Garg, Assistant Professor at Department of Computer Science & Applications, Kurukshetra University, Kurukshetra.

Manuscript received on January 20, 2020. | Revised Manuscript received on February 10, 2021. | Manuscript published on March 30, 2021. | PP: 30-38 | Volume-9 Issue-6, March 2021. | Retrieval Number: 100.1/ijrte.E5291019521 | DOI: 10.35940/ijrte.E5291.039621
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: The big data pattern analysis suffers from incorrect responses due to missing data entries in the real world. Data collected for digital movie platforms like Netflix and intelligent transportation systems is Spatio-temporal data. Extracting the latent and explicit features from this data is a challenge. We present the high dimensional data imputation problem as a higher-order tensor decomposition. The regularized and biased PARAFAC decomposition is proposed to generate the missing data entries. The biases are created and updated by a chaotic exponential factor in Adam’s optimization, which reduces the imputation error. This chaotic perturbed exponentially update in the learning rate replaces the fixed learning rate in the bias update by Adam optimization. The idea has experimented with Netflix and traffic datasets from Guangzhou, China. 
Keywords: Tensor decomposition, PARAFAC, Adam optimization, Data imputation, etc.