scholarly journals Deep Feedback Network for Recommendation

2020 ◽  
Author(s):  
Ruobing Xie ◽  
Cheng Ling ◽  
Yalong Wang ◽  
Rui Wang ◽  
Feng Xia ◽  
...  
Keyword(s):  
Recommendation System ◽  
User Preferences ◽  
Current Recommendation ◽  
Positive Feedbacks ◽  
Fine Grained ◽  
User Behaviors ◽  
Feedback Network ◽  
Recommendation Algorithms ◽  
Negative Feedbacks ◽  
Interaction Component

Both explicit and implicit feedbacks can reflect user opinions on items, which are essential for learning user preferences in recommendation. However, most current recommendation algorithms merely focus on implicit positive feedbacks (e.g., click), ignoring other informative user behaviors. In this paper, we aim to jointly consider explicit/implicit and positive/negative feedbacks to learn user unbiased preferences for recommendation. Specifically, we propose a novel Deep feedback network (DFN) modeling click, unclick and dislike behaviors. DFN has an internal feedback interaction component that captures fine-grained interactions between individual behaviors, and an external feedback interaction component that uses precise but relatively rare feedbacks (click/dislike) to extract useful information from rich but noisy feedbacks (unclick). In experiments, we conduct both offline and online evaluations on a real-world recommendation system WeChat Top Stories used by millions of users. The significant improvements verify the effectiveness and robustness of DFN. The source code is in https://github.com/qqxiaochongqq/DFN.

Using latent features for building an interpretable recommendation system

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Ziming Zeng ◽  
Yu Shi ◽  
Lavinia Florentina Pieptea ◽  
Junhua Ding
Keyword(s):  
Recommendation System ◽  
User Preferences ◽  
User Preference ◽  
Data Sets ◽  
Historical Records ◽  
Data Link ◽  
Content Type ◽  
Fine Grained ◽  
Public Data ◽  
Latent Features

Purpose Aspects extracted from the user’s historical records are widely used to define user’s fine-grained preferences for building interpretable recommendation systems. As the aspects were extracted from the historical records, the aspects that represent user’s negative preferences cannot be identified because of their absence from the records. However, these latent aspects are also as important as those aspects representing user’s positive preferences for building a recommendation system. This paper aims to identify the user’s positive preferences and negative preferences for building an interpretable recommendation. Design/methodology/approach First, high-frequency tags are selected as aspects to describe user preferences in aspect-level. Second, user positive and negative preferences are calculated according to the positive and negative preference model, and the interaction between similar aspects is adopted to address the aspect sparsity problem. Finally, an experiment is designed to evaluate the effectiveness of the model. The code and the experiment data link is: https://github.com/shiyu108/Recommendation-system Findings Experimental results show the proposed approach outperformed the state-of-the-art methods in widely used public data sets. These latent aspects are also as important as those aspects representing the user’s positive preferences for building a recommendation system. Originality/value This paper provides a new approach that identifies and uses not only users’ positive preferences but also negative preferences, which can capture user preference precisely. Besides, the proposed model provides good interpretability.

scholarly journals Restaurant Recommendation System using Machine Learning

2021 ◽  
Vol 10 (3) ◽  
pp. 1671-1675
Keyword(s):  
Recommendation System ◽  
Online Reviews ◽  
User Preferences ◽  
Personalized Recommendation ◽  
Average Rating ◽  
Hybrid Filtering ◽  
Recommendation Algorithms ◽  
Personalized Recommender System ◽  
Content Based Filtering ◽  
Or Applications

Nowadays a big challenge when going out to a new restaurant or cafe, people usually use websites or applications to look up nearby places and then choose one based on an average rating. But most of the time the average rating isn't enough to predict the quality or hygiene of the restaurant. Different people have different perspectives and priorities when evaluating a restaurant. Many online businesses now have implemented personalized recommendation systems which basically try to identify user preferences and then provide relevant products to enhance the users experience . In turn, users will be able to enjoy exploring what they might like with convenience and ease because of the recommendation results. Finding an ideal restaurant can be a struggle because the mainstream recommender apps have not yet adopted the personalized recommender approach. So we took up this challenge and we aim to build the prototype of a personalized recommender system that incorporates metadata which is basically the information provided by interactions of customers and restaurants online(reviews), which gives a pretty good idea of customers satisfaction and taste as well as features of the restaurant. This type of approach enhances user experience of finding a restaurant that suits their taste better. This paper has used a package called lightfm(the library of python for implementing popular recommendation algorithms) and the dataset from yelp. There are different methods of filtering the data, here we have used Hybrid filtering which is a combination of Content-based filtering (CBF) and Collaborative Filtering (CF). Since the results from Hybrid filtering are far more closer to accuracy than CBF or CF respectively. Then hybrid filtering gives results in the form of personalized recommendations for users after training and testing of the data

Feature-based multi-criteria recommendation system using a weighted approach with ranking correlation

2021 ◽  
Vol 25 (4) ◽  
pp. 1013-1029
Author(s):  
Zeeshan Zeeshan ◽  
Qurat ul Ain ◽  
Uzair Aslam Bhatti ◽  
Waqar Hussain Memon ◽  
Sajid Ali ◽  
...  
Keyword(s):  
Recommendation System ◽  
Sources Of Information ◽  
Multiple Features ◽  
Recommendation Algorithms ◽  
Label Correlations ◽  
Feature Based ◽  
Multicriteria Model ◽  
Implicit And Explicit ◽  
Hybrid Recommendation ◽  
Different Sources

With the increase of online businesses, recommendation algorithms are being researched a lot to facilitate the process of using the existing information. Such multi-criteria recommendation (MCRS) helps a lot the end-users to attain the required results of interest having different selective criteria – such as combinations of implicit and explicit interest indicators in the form of ranking or rankings on different matched dimensions. Current approaches typically use label correlation, by assuming that the label correlations are shared by all objects. In real-world tasks, however, different sources of information have different features. Recommendation systems are more effective if being used for making a recommendation using multiple criteria of decisions by using the correlation between the features and items content (content-based approach) or finding a similar user rating to get targeted results (Collaborative filtering). To combine these two filterings in the multicriteria model, we proposed a features-based fb-knn multi-criteria hybrid recommendation algorithm approach for getting the recommendation of the items by using multicriteria features of items and integrating those with the correlated items found in similar datasets. Ranks were assigned to each decision and then weights were computed for each decision by using the standard deviation of items to get the nearest result. For evaluation, we tested the proposed algorithm on different datasets having multiple features of information. The results demonstrate that proposed fb-knn is efficient in different types of datasets.

scholarly journals A Two-Stage Neural Network-Based Cold Start Item Recommender

2021 ◽  
Vol 11 (9) ◽  
pp. 4243
Author(s):  
Chieh-Yuan Tsai ◽  
Yi-Fan Chiu ◽  
Yu-Jen Chen
Keyword(s):  
Neural Network ◽  
Recommendation System ◽  
Service Providers ◽  
Cold Start ◽  
Computational Time ◽  
Two Stage ◽  
The Neural Network ◽  
Textual Description ◽  
Recommendation Algorithms ◽  
Content Information

Nowadays, recommendation systems have been successfully adopted in variant online services such as e-commerce, news, and social media. The recommenders provide users a convenient and efficient way to find their exciting items and increase service providers’ revenue. However, it is found that many recommenders suffered from the cold start (CS) problem where only a small number of ratings are available for some new items. To conquer the difficulties, this research proposes a two-stage neural network-based CS item recommendation system. The proposed system includes two major components, which are the denoising autoencoder (DAE)-based CS item rating (DACR) generator and the neural network-based collaborative filtering (NNCF) predictor. In the DACR generator, a textual description of an item is used as auxiliary content information to represent the item. Then, the DAE is applied to extract the content features from high-dimensional textual vectors. With the compact content features, a CS item’s rating can be efficiently derived based on the ratings of similar non-CS items. Second, the NNCF predictor is developed to predict the ratings in the sparse user–item matrix. In the predictor, both spare binary user and item vectors are projected to dense latent vectors in the embedding layer. Next, latent vectors are fed into multilayer perceptron (MLP) layers for user–item matrix learning. Finally, appropriate item suggestions can be accurately obtained. The extensive experiments show that the DAE can significantly reduce the computational time for item similarity evaluations while keeping the original features’ characteristics. Besides, the experiments show that the proposed NNCF predictor outperforms several popular recommendation algorithms. We also demonstrate that the proposed CS item recommender can achieve up to 8% MAE improvement compared to adding no CS item rating.

scholarly journals PRUB: A Privacy Protection Friend Recommendation System Based on User Behavior

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Wei Jiang ◽  
Ruijin Wang ◽  
Zhiyuan Xu ◽  
Yaodong Huang ◽  
Shuo Chang ◽  
...  
Keyword(s):  
Social Network ◽  
Recommendation System ◽  
User Behavior ◽  
Network Services ◽  
Mobile Social Network ◽  
Fine Grained ◽  
Friend Recommendation ◽  
Social Applications ◽  
Browsing Behavior ◽  
Behavioral Information

The fast developing social network is a double-edged sword. It remains a serious problem to provide users with excellent mobile social network services as well as protecting privacy data. Most popular social applications utilize behavior of users to build connection with people having similar behavior, thus improving user experience. However, many users do not want to share their certain behavioral information to the recommendation system. In this paper, we aim to design a secure friend recommendation system based on the user behavior, called PRUB. The system proposed aims at achieving fine-grained recommendation to friends who share some same characteristics without exposing the actual user behavior. We utilized the anonymous data from a Chinese ISP, which records the user browsing behavior, for 3 months to test our system. The experiment result shows that our system can achieve a remarkable recommendation goal and, at the same time, protect the privacy of the user behavior information.

scholarly journals Learning Feature Interactions with Lorentzian Factorization Machine

2020 ◽  
Vol 34 (04) ◽  
pp. 6470-6477
Author(s):  
Canran Xu ◽  
Ming Wu
Keyword(s):  
Deep Learning ◽  
Hyperbolic Space ◽  
Recommendation System ◽  
Triangle Inequality ◽  
State Of The Art ◽  
Learning Methods ◽  
New Model ◽  
User Behaviors ◽  
Feature Interactions ◽  
Factorization Machine

Learning representations for feature interactions to model user behaviors is critical for recommendation system and click-trough rate (CTR) predictions. Recent advances in this area are empowered by deep learning methods which could learn sophisticated feature interactions and achieve the state-of-the-art result in an end-to-end manner. These approaches require large number of training parameters integrated with the low-level representations, and thus are memory and computational inefficient. In this paper, we propose a new model named “LorentzFM” that can learn feature interactions embedded in a hyperbolic space in which the violation of triangle inequality for Lorentz distances is available. To this end, the learned representation is benefited by the peculiar geometric properties of hyperbolic triangles, and result in a significant reduction in the number of parameters (20% to 80%) because all the top deep learning layers are not required. With such a lightweight architecture, LorentzFM achieves comparable and even materially better results than the deep learning methods such as DeepFM, xDeepFM and Deep & Cross in both recommendation and CTR prediction tasks.

scholarly journals Using the Generative Adversarial Network to Generate Recommendations

2020 ◽  
Author(s):  
A.V. Prosvetov
Keyword(s):  
Real World ◽  
Recommendation System ◽  
Generative Adversarial Networks ◽  
Generative Adversarial Network ◽  
Theoretical Comparison ◽  
New Methods ◽  
Adversarial Network ◽  
Adversarial Networks ◽  
Recommendation Algorithms ◽  
Cold Start Problem

Widely used recommendation systems do not meet all industry requirements, so the search for more advanced methods for creating recommendations continues. The proposed new methods based on Generative Adversarial Networks (GAN) have a theoretical comparison with other recommendation algorithms; however, real-world comparisons are needed to introduce new methods in the industry. In our work, we compare recommendations from the Generative Adversarial Network with recommendation from the Deep Semantic Similarity Model (DSSM) on real-world case of airflight tickets. We found a way to train the GAN so that users receive appropriate recommendations, and during A/B testing, we noted that the GAN-based recommendation system can successfully compete with other neural networks in generating recommendations. One of the advantages of the proposed approach is that the GAN training process avoids a negative sampling, which causes a number of distortions in the final ratings of recommendations. Due to the ability of the GAN to generate new objects from the distribution of the training set, we assume that the Conditional GAN is able to solve the cold start problem.

scholarly journals Temporal Patterns Of User Preferences In The Tasks Of Forming Explanations In The Recommender System

2020 ◽  
Vol 2 (95) ◽  
pp. 21-27
Author(s):  
S. F. Chalyi ◽  
V. O. Leshchynskyi
Keyword(s):  
Recommendation System ◽  
Selection Process ◽  
Temporal Patterns ◽  
User Preferences ◽  
Data Sets ◽  
Goods And Services ◽  
Temporal Relationships ◽  
Sequential Selection ◽  
System User ◽  
Alternative Choice

The problem of taking into account changes in the user’s behavior of the recommendation system whenconstructing explanations for recommendations is considered. This problem occurs as a result of cyclical changes in userrequirements. Its solution is associated with the construction of an explanation comparing the alternative choices of theuser of the recommendation system. The developed models of temporal patterns consist of a set of temporal relationshipsbetween the events of users’ choice of goods and services. The first pattern contains an alternative in the form of sequential selection in time of several objects or the selection of only a pair - the first and the last object. The second pattern,sequential-alternative choice, consists of a sequence of choices over time, which ends with the first pattern. The proposedapproach to the formation of patterns is based on the construction of data sets containing temporal dependencies betweena group of user choices for a given level of time detail. The temporal dataset is used to construct a temporal graph of therecommender system user selection process. The latter includes a set of temporal patterns with an indication of the timeof their beginning and end, which makes it possible to determine the duration of the implementation of these patterns.On the basis of the patterns, subsets of temporal relationships are formed to build explanations for the recommendedlist of goods and services. Experimental verification of the developed approach using the “Online Retail” sales data sethas shown the possibility of identifying temporal patterns even on short initial samples.

scholarly journals SIS dynamic network model based on product semantics from the perspective of infectious disease dynamics

2021 ◽  
Vol 235 ◽  
pp. 03035
Author(s):  
jiaojiao Lv ◽  
yingsi Zhao
Keyword(s):  
Network Model ◽  
Purchase Intention ◽  
Recommendation System ◽  
Optimal Algorithm ◽  
Dynamic Network ◽  
Distribution Model ◽  
Recommendation Algorithm ◽  
Model Based ◽  
Dynamic Network Model ◽  
Recommendation Algorithms

Recommendation system is unable to achive the optimal algorithm, recommendation system precision problem into bottleneck. Based on the perspective of product marketing, paper takes the inherent attribute as the classification standard and focuses on the core problem of “matching of product classification and recommendation algorithm of users’ purchase demand”. Three hypotheses are proposed: (1) inherent attributes of the product directly affect user demand; (2) classified product is suitable for different recommendation algorithms; (3) recommendation algorithm integration can achieve personalized customization. Based on empirical research on the relationship between characteristics of recommendation information (independent variable) and purchase intention (dependent variable), it is concluded that predictability and difference of recommendation information are not fully perceived and stimulation is insufficient. Therefore, SIS dynamic network model based on the distribution model of SIS virus is constructed. It discusses the spreading path of recommendation information and “infection” situation of consumers to enhance accurate matching of recommendation system.

Sign in / Sign up

Export Citation Format

Share Document