Regularizing Matrix Factorization with Implicit User Preference Embeddings for Web API Recommendation

2019 ◽  
Author(s):  
Kenneth Fletcher
Keyword(s):  
Matrix Factorization ◽  
User Preference

scholarly journals A social trust and preference segmentation-based matrix factorization recommendation algorithm

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Wei Peng ◽  
Baogui Xin
Keyword(s):  
Matrix Factorization ◽  
Social Trust ◽  
State Of The Art ◽  
User Preference ◽  
Social Recommendation ◽  
Recommendation Algorithm ◽  
Commercial Activities ◽  
Trust Relationships ◽  
Recommendation Algorithms ◽  
The Difference

AbstractA recommendation can inspire potential demands of users and make e-commerce platforms more intelligent and is essential for e-commerce enterprises’ sustainable development. The traditional social recommendation algorithm ignores the following fact: the preferences of users with trust relationships are not necessarily similar, and the consideration of user preference similarity should be limited to specific areas. To solve these problems mentioned above, we propose a social trust and preference segmentation-based matrix factorization (SPMF) recommendation algorithm. Experimental results based on the Ciao and Epinions datasets show that the accuracy of the SPMF algorithm is significantly superior to that of some state-of-the-art recommendation algorithms. The SPMF algorithm is a better recommendation algorithm based on distinguishing the difference of trust relations and preference domain, which can support commercial activities such as product marketing.

scholarly journals Neural Matrix Factorization Recommendation for User Preference Prediction Based on Explicit and Implicit Feedback

2022 ◽  
Vol 2022 ◽  
pp. 1-12
Author(s):  
Huazhen Liu ◽  
Wei Wang ◽  
Yihan Zhang ◽  
Renqian Gu ◽  
Yaqi Hao
Keyword(s):  
Neural Network ◽  
Matrix Factorization ◽  
Recommendation System ◽  
Heterogeneous Data ◽  
User Preference ◽  
Personalized Recommendation ◽  
Implicit Feedback ◽  
Network Training ◽  
Feedback Data ◽  
Explicit Feedback

Explicit feedback and implicit feedback are two important types of heterogeneous data for constructing a recommendation system. The combination of the two can effectively improve the performance of the recommendation system. However, most of the current deep learning recommendation models fail to fully exploit the complementary advantages of two types of data combined and usually only use binary implicit feedback data. Thus, this paper proposes a neural matrix factorization recommendation algorithm (EINMF) based on explicit-implicit feedback. First, neural network is used to learn nonlinear feature of explicit-implicit feedback of user-item interaction. Second, combined with the traditional matrix factorization, explicit feedback is used to accurately reflect the explicit preference and the potential preferences of users to build a recommendation model; a new loss function is designed based on explicit-implicit feedback to obtain the best parameters through the neural network training to predict the preference of users for items; finally, according to prediction results, personalized recommendation list is pushed to the user. The feasibility, validity, and robustness are fully demonstrated in comparison with multiple baseline models on two real datasets.

Analysis of athletes’ stadium stress source based on improved layered K-means algorithm

2020 ◽  
Vol 39 (4) ◽  
pp. 5905-5914
Author(s):  
Chen Gong
Keyword(s):  
Experimental Data ◽  
Machine Learning Algorithms ◽  
User Preference ◽  
Experimental Comparison ◽  
Actual Situation ◽  
Medical Field ◽  
Pressure Source ◽  
Preference Model ◽  
Related Research ◽  
Analysis System

Most of the research on stressors is in the medical field, and there are few analysis of athletes’ stressors, so it can not provide reference for the analysis of athletes’ stressors. Based on this, this study combines machine learning algorithms to analyze the pressure source of athletes’ stadium. In terms of data collection, it is mainly obtained through questionnaire survey and interview form, and it is used as experimental data after passing the test. In order to improve the performance of the algorithm, this paper combines the known K-Means algorithm with the layering algorithm to form a new improved layered K-Means algorithm. At the same time, this paper analyzes the performance of the improved hierarchical K-Means algorithm through experimental comparison and compares the clustering results. In addition, the analysis system corresponding to the algorithm is constructed based on the actual situation, the algorithm is applied to practice, and the user preference model is constructed. Finally, this article helps athletes find stressors and find ways to reduce stressors through personalized recommendations. The research shows that the algorithm of this study is reliable and has certain practical effects and can provide theoretical reference for subsequent related research.

TrustSVD: A Novel Trust-Based Matrix Factorization Model with User Trust and Item Ratings

2017 ◽  
Vol 7 (11) ◽  
pp. 7 ◽  
Author(s):  
K Sobha Rani
Keyword(s):  
Matrix Factorization ◽  
Social Trust ◽  
State Of The Art ◽  
Data Sets ◽  
Real World Data ◽  
Recommendation Algorithm ◽  
Active User ◽  
Factorization Model ◽  
The Social ◽  
Matrix Factorization Technique

Collaborative filtering suffers from the problems of data sparsity and cold start, which dramatically degrade recommendation performance. To help resolve these issues, we propose TrustSVD, a trust-based matrix factorization technique. By analyzing the social trust data from four real-world data sets, we conclude that not only the explicit but also the implicit influence of both ratings and trust should be taken into consideration in a recommendation model. Hence, we build on top of a state-of-the-art recommendation algorithm SVD++ which inherently involves the explicit and implicit influence of rated items, by further incorporating both the explicit and implicit influence of trusted users on the prediction of items for an active user. To our knowledge, the work reported is the first to extend SVD++ with social trust information. Experimental results on the four data sets demonstrate that our approach TrustSVD achieves better accuracy than other ten counterparts, and can better handle the concerned issues.

Sign in / Sign up

Export Citation Format

Share Document