sparsity problem
Recently Published Documents


TOTAL DOCUMENTS

97
(FIVE YEARS 41)

H-INDEX

9
(FIVE YEARS 2)

2022 ◽  
Vol 12 (2) ◽  
pp. 594
Author(s):  
Jianjie Shao ◽  
Jiwei Qin ◽  
Wei Zeng ◽  
Jiong Zheng

Recently, the interaction information from reviews has been modeled to acquire representations between users and items and improve the sparsity problem in recommendation systems. Reviews are more responsive to information about users’ preferences for the different aspects and attributes of items. However, how to better construct the representation of users (items) still needs further research. Inspired by the interaction information from reviews, auxiliary ID embedding information is used to further enrich the word-level representation in the proposed model named MPCAR. In this paper, first, a multipointer learning scheme is adopted to extract the most informative reviews from user and item reviews and represent users (items) in a word-by-word manner. Then, users and items are embedded to extract the ID embedding that can reveal the identity of users (items). Finally, the review features and ID embedding are input to the gated neural network for effective fusion to obtain richer representations of users and items. We randomly select ten subcategory datasets from the Amazon dataset to evaluate our algorithm. The experimental results show that our algorithm can achieve the best results compared to other recommendation approaches.


2021 ◽  
Vol 12 (1) ◽  
pp. 45
Author(s):  
Soo-Yeon Jeong ◽  
Young-Kuk Kim

A context-aware recommender system can make recommendations to users by considering contextual information such as time and place, not only the scores assigned to items by users. However, as a user preferences matrix is expanded in a multidimensional matrix, data sparsity is maximized. In this paper, we propose a deep learning-based context-aware recommender system that considers the contextual features. Based on existing deep learning models, we combine a neural network and autoencoder to extract characteristics and predict scores in the process of restoring input data. The newly proposed model is able to easily reflect various type of contextual information and predicts user preferences by considering the feature of user, item and context. The experimental results confirm that the proposed method is mostly superior to the existing method in all datasets. Also, for the dataset with data sparsity problem, it was confirmed that the performance of the proposed method is higher than that of existing methods. The proposed method has higher precision by 0.01–0.05 than other recommender systems in a dataset with many context dimensions. And it showed good performance with a high precision of 0.03 to 0.09 in a small dimensional dataset.


2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Bing Fang ◽  
Enpeng Hu ◽  
Junyang Shen ◽  
Jingwen Zhang ◽  
Yang Chen

Studying recommendation method has long been a fundamental area in personalized marketing science. The rating data sparsity problem is the biggest challenge of recommendations. In addition, existing recommendation methods can only identify user preferences rather than customer needs. To solve these two bottleneck problems, we propose a novel implicit feedback recommendation method using user-generated content (UGC). We identify product feature and customer needs from UGC using Convolutional Neural Network (CNN) model and textual semantic analysis techniques, measure user-product fit degree introducing attention mechanism and antonym mechanism, and predict user rating based on user-product fit degree and user history rating data. Using data from a large-scale review sites, we demonstrate the effectiveness of our proposed method. Our study makes several research contributions. First, we propose a novel recommendation method with strong robustness against sparse rating data. Second, we propose a novel recommendation method based on the customer need-product feature fit. Third, we propose a novel approach to measure the fit degree of customer needs-product feature, which can effectively improve the performance of recommendation method. Our study also indicates the following findings: (1) UGC can be used to predict user ratings with no user rating records. This finding has important implications to solve the sparsity problem of recommendations thoroughly. (2) The customer need-based recommendation method has better performance than existing user preference-based recommendation methods. This finding sheds light on the necessity of mining customer need for recommendation methods. (3) UGC can be used to mine customer need and product features. This finding indicates that UGC also can be used in the other studies requiring information about customer need and product feature. (4) Comparing the opinions of user review should not be solely on the basis of semantic similarity. This finding sheds light on the limitation of existing opinion mining studies.


Algorithms ◽  
2021 ◽  
Vol 14 (10) ◽  
pp. 281
Author(s):  
Zhen Tian ◽  
Lamei Pan ◽  
Pu Yin ◽  
Rui Wang

The emergence of the recommendation system has effectively alleviated the information overload problem. However, traditional recommendation systems either ignore the rich attribute information of users and items, such as the user’s social-demographic features, the item’s content features, etc., facing the sparsity problem, or adopt the fully connected network to concatenate the attribute information, ignoring the interaction between the attribute information. In this paper, we propose the information fusion-based deep neural attentive matrix factorization (IFDNAMF) recommendation model, which introduces the attribute information and adopts the element-wise product between the different information domains to learn the cross-features when conducting information fusion. In addition, the attention mechanism is utilized to distinguish the importance of different cross-features on prediction results. In addition, the IFDNAMF adopts the deep neural network to learn the high-order interaction between users and items. Meanwhile, we conduct extensive experiments on two datasets: MovieLens and Book-crossing, and demonstrate the feasibility and effectiveness of the model.


Author(s):  
Menghui Zhu ◽  
Minghuan Liu ◽  
Jian Shen ◽  
Zhicheng Zhang ◽  
Sheng Chen ◽  
...  

In Goal-oriented Reinforcement learning, relabeling the raw goals in past experience to provide agents with hindsight ability is a major solution to the reward sparsity problem. In this paper, to enhance the diversity of relabeled goals, we develop FGI (Foresight Goal Inference), a new relabeling strategy that relabels the goals by looking into the future with a learned dynamics model. Besides, to improve sample efficiency, we propose to use the dynamics model to generate simulated trajectories for policy training. By integrating these two improvements, we introduce the MapGo framework (Model-Assisted Policy optimization for Goal-oriented tasks). In our experiments, we first show the effectiveness of the FGI strategy compared with the hindsight one, and then show that the MapGo framework achieves higher sample efficiency when compared to model-free baselines on a set of complicated tasks.


Author(s):  
Feng Zhu ◽  
Yan Wang ◽  
Chaochao Chen ◽  
Jun Zhou ◽  
Longfei Li ◽  
...  

To address the long-standing data sparsity problem in recommender systems (RSs), cross-domain recommendation (CDR) has been proposed to leverage the relatively richer information from a richer domain to improve the recommendation performance in a sparser domain. Although CDR has been extensively studied in recent years, there is a lack of a systematic review of the existing CDR approaches. To fill this gap, in this paper, we provide a comprehensive review of existing CDR approaches, including challenges, research progress, and prospects. Specifically, we first summarize existing CDR approaches into four types, including single-target CDR, single-target multi-domain recommendation (MDR), dual-target CDR, and multi-target CDR. We then present the definitions and challenges of these CDR approaches. Next, we propose a full-view categorization and new taxonomies on these approaches and report their research progress in detail. In the end, we share several promising prospects in CDR.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Huale Li ◽  
Rui Cao ◽  
Xuan Wang ◽  
Xiaohan Hou ◽  
Tao Qian ◽  
...  

In recent years, deep reinforcement learning (DRL) achieves great success in many fields, especially in the field of games, such as AlphaGo, AlphaZero, and AlphaStar. However, due to the reward sparsity problem, the traditional DRL-based method shows limited performance in 3D games, which contain much higher dimension of state space. To solve this problem, in this paper, we propose an intrinsic-based policy optimization (IBPO) algorithm for reward sparsity. In the IBPO, a novel intrinsic reward is integrated into the value network, which provides an additional reward in the environment with sparse reward, so as to accelerate the training. Besides, to deal with the problem of value estimation bias, we further design three types of auxiliary tasks, which can evaluate the state value and the action more accurately in 3D scenes. Finally, a framework of auxiliary intrinsic-based policy optimization (AIBPO) is proposed, which improves the performance of the IBPO. The experimental results show that the method is able to deal with the reward sparsity problem effectively. Therefore, the proposed method may be applied to real-world scenarios, such as 3-dimensional navigation and automatic driving, which can improve the sample utilization to reduce the cost of interactive sample collected by the real equipment.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Long H. B. Nguyen ◽  
Viet H. Pham ◽  
Dien Dinh

The Seq2Seq model and its variants (ConvSeq2Seq and Transformer) emerge as a promising novel solution to the machine translation problem. However, these models only focus on exploiting knowledge from bilingual sentences without paying much attention to utilizing external linguistic knowledge sources such as semantic representations. Not only do semantic representations can help preserve meaning but they also minimize the data sparsity problem. However, to date, semantic information remains rarely integrated into machine translation models. In this study, we examine the effect of abstract meaning representation (AMR) semantic graphs in different machine translation models. Experimental results on the IWSLT15 English-Vietnamese dataset have proven the efficiency of the proposed model, expanding the use of external language knowledge sources to significantly improve the performance of machine translation models, especially in the application of low-resource language pairs.


Sign in / Sign up

Export Citation Format

Share Document