I. Introduction
High-dimensional and sparse (HiDS) matrices are found in many big-data-related industrial applications like recommender systems [1]–[5]. They are frequently encountered because of: 1) the great need to describe the relationship among involved entities with matrices and 2) the impossibility to fully observe the relationship among an exploding number of entities, for example, millions of users and items in a recommender system [1]–[5]. It is thus highly important to explore the full relationship among entities for various purposes, for example, predicting potential user preferences in online stores for personalized recommendation [1]–[5] and estimating missing links among users in social networks for community detection [6], [7], [26]. Therefore, to predict missing data of an HiDS matrix from industrial applications based on its known ones is a vital issue.