scholarly journals Matrix Factorization Recommendation Algorithm Based on Multiple Social Relationships

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Sheng Bin ◽  
Gengxin Sun
Keyword(s):  
Social Networks ◽  
Recommender Systems ◽  
Social Relationships ◽  
Matrix Factorization ◽  
Social Relationship ◽  
Recommendation System ◽  
Social Recommendation ◽  
Recommendation Algorithm ◽  
Recommendation Algorithms

With the widespread use of social networks, social recommendation algorithms that add social relationships between users to recommender systems have been widely applied. Existing social recommendation algorithms only introduced one type of social relationship to the recommendation system, but in reality, there are often multiple social relationships among users. In this paper, a new matrix factorization recommendation algorithm combined with multiple social relationships is proposed. Through experiment results analysis on the Epinions dataset, the proposed matrix factorization recommendation algorithm has a significant improvement over the traditional and matrix factorization recommendation algorithms that integrate a single social relationship.

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.

Collaborative filtering-based recommendation of online social voting

2018 ◽  
Vol 7 (3) ◽  
pp. 1504 ◽  
Author(s):  
Dr Mohammed Ismail ◽  
Dr K. Bhanu Prakash ◽  
Dr M. Nagabhushana Rao
Keyword(s):  
Recommender Systems ◽  
Matrix Factorization ◽  
Recommendation System ◽  
Nearest Neighbor ◽  
Social Trust ◽  
Social Recommendation ◽  
Peer Reviewers ◽  
Hybrid Recommender System ◽  
Hybrid Recommender ◽  
Cold Start Problem

Social voting is becoming the new reason behind social recommendation these days. It helps in providing accurate recommendations with the help of factors like social trust etc. Here we propose Matrix factorization (MF) and nearest neighbor-based recommender systems accommodating the factors of user activities and also compared them with the peer reviewers, to provide a accurate recommendation. Through experiments we realized that the affiliation factors are very much needed for improving the accuracy of the recommender systems. This information helps us to overcome the cold start problem of the recommendation system and also y the analysis this information was much useful to cold users than to heavy users. In our experiments simple neighborhood model outperform the computerized matrix factorization models in the hot voting and non hot voting recommendation. We also proposed a hybrid recommender system producing a top-k recommendation inculcating different single approaches.  

scholarly journals A Comprehensive Social Matrix Factorization with Social Regularization for Recommendation Based on Implicit Similarity by Fusing Trust Relationships and Social Tags

2021 ◽  
Author(s):  
Rui Chen ◽  
Jianwei Zhang ◽  
Zhifeng Zhang ◽  
Yan-Shuo Chang ◽  
Jingli Gao ◽  
...  
Keyword(s):  
Social Relationships ◽  
Social Relationship ◽  
Recommendation System ◽  
Feature Space ◽  
Experimental Results ◽  
User Preference ◽  
Superior Performance ◽  
Social Recommendation ◽  
Social Tags ◽  
Trust Relationships

Abstract Social relationships play an important role in improving the quality of recommender systems (RSs). A large number of experimental results show that social relationship-based recommendation methods alleviate the problems of data sparseness and cold start in RSs to some extent. However, since the social relationships between users are extremely sparse and complex, and it is difficult to obtain accurately user preference model, thus the performance of the recommendation system is affected by the existing social recommendation methods. In order to accurately model social relationships and improve recommendation quality, we use explicit social relationships such as user-item ratings, trust relationships and implicit social relationships such as social tags to mine potential interest preferences of users and propose an improved social recommendation method integrating trust relationship and social tags. The method map user features and item features to the shared feature space by using the above social relationship, respectively, and obtains user similarity and item similarity through potential feature vectors of users and items, and continuously trains them to obtain accurate similarity relationship to improve the recommendation performance. Experimental results demonstrate that our proposed approach achieves superior performance to the other social recommendation approaches.

User opinions driven social recommendation system

2021 ◽  
Vol 25 (1) ◽  
pp. 21-31
Author(s):  
Lakshmikanth Paleti ◽  
P. Radha Krishna ◽  
J.V.R. Murthy
Keyword(s):  
Social Networks ◽  
Collaborative Filtering ◽  
Recommendation System ◽  
Recommendation Systems ◽  
Social Recommendation ◽  
Novel Approach ◽  
Tripartite Graphs ◽  
Content Based Filtering

Recommendation systems provide reliable and relevant recommendations to users and also enable users’ trust on the website. This is achieved by the opinions derived from reviews, feedbacks and preferences provided by the users when the product is purchased or viewed through social networks. This integrates interactions of social networks with recommendation systems which results in the behavior of users and user’s friends. The techniques used so far for recommendation systems are traditional, based on collaborative filtering and content based filtering. This paper provides a novel approach called User-Opinion-Rating (UOR) for building recommendation systems by taking user generated opinions over social networks as a dimension. Two tripartite graphs namely User-Item-Rating and User-Item-Opinion are constructed based on users’ opinion on items along with their ratings. Proposed approach quantifies the opinions of users and results obtained reveal the feasibility.

Optimized Collaborative Filtering Recommendation Based on User’s Social Relationships

2014 ◽  
Vol 1044-1045 ◽  
pp. 1484-1488
Author(s):  
Yue Kun Fan ◽  
Xin Ye Li ◽  
Meng Meng Cao
Keyword(s):  
Collaborative Filtering ◽  
Social Relationships ◽  
Digital Libraries ◽  
Social Relationship ◽  
Nearest Neighbor ◽  
Mean Absolute Error ◽  
Absolute Error ◽  
Personalized Recommendation ◽  
Recommendation Algorithm

Currently collaborative filtering is widely used in e-commerce, digital libraries and other areas of personalized recommendation service system. Nearest-neighbor algorithm is the earliest proposed and the main collaborative filtering recommendation algorithm, but the data sparsity and cold-start problems seriously affect the recommendation quality. To solve these problems, A collaborative filtering recommendation algorithm based on users' social relationships is proposed. 0n the basis of traditional filtering recommendation technology, it combines with the interested objects of user's social relationship and takes the advantage of the tags to projects marked by users and their interested objects to improve the methods of recommendation. The experimental results of MAE ((Mean Absolute Error)) verify that this method can get better quality of recommendation.

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.

scholarly journals Augmented Context-Based Conceptual User Modeling for Personalized Recommendation System in Online Social Networks

2020 ◽  
Vol 14 (3) ◽  
pp. 1-19
Author(s):  
Ammar Alnahhas ◽  
Bassel Alkhatib
Keyword(s):  
Social Networks ◽  
Online Social Networks ◽  
Recommendation System ◽  
Contextual Information ◽  
Detailed Comparison ◽  
Personalized Recommendation ◽  
User Models ◽  
Proposed Model ◽  
Recommendation Algorithms ◽  
Novel Method

As the data on the online social networks is getting larger, it is important to build personalized recommendation systems that recommend suitable content to users, there has been much research in this field that uses conceptual representations of text to match user models with best content. This article presents a novel method to build a user model that depends on conceptual representation of text by using ConceptNet concepts that exceed the named entities to include the common-sense meaning of words and phrases. The model includes the contextual information of concepts as well, the authors also show a novel method to exploit the semantic relations of the knowledge base to extend user models, the experiment shows that the proposed model and associated recommendation algorithms outperform all previous methods as a detailed comparison shows in this article.

Two Phase Recommendation Algorithm Based on Clustering User Interest and Trust

2014 ◽  
Vol 543-547 ◽  
pp. 1856-1859
Author(s):  
Xiang Cui ◽  
Gui Sheng Yin
Keyword(s):  
Social Networks ◽  
Electronic Commerce ◽  
Recommender Systems ◽  
Information Overload ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Two Phase ◽  
Rating Data ◽  
User Interests ◽  
The Future

Recommender systems have been proven to be valuable means for Web online users to cope with the information overload and have become one of the most powerful and popular tools in electronic commerce. We need a method to solve such as what items to buy, what music to listen, or what news to read. The diversification of user interests and untruthfulness of rating data are the important problems of recommendation. In this article, we propose to use two phase recommendation based on user interest and trust ratings that have been given by actors to items. In the paper, we deal with the uncertain user interests by clustering firstly. In the algorithm, we compute the between-class entropy of any two clusters and get the stable classes. Secondly, we construct trust based social networks, and work out the trust scoring, in the class. At last, we provide some evaluation of the algorithms and propose the more improve ideas in the future.

The Application of Hybrid Recommendation Algorithm in Education Cloud

2014 ◽  
Vol 551 ◽  
pp. 670-674 ◽  
Author(s):  
Gai Zhen Yang
Keyword(s):  
Cloud Computing ◽  
Recommendation System ◽  
Research Work ◽  
Operating Efficiency ◽  
Cloud Platform ◽  
Recommendation Algorithm ◽  
Development Platform ◽  
Recommendation Algorithms ◽  
Technology Applications ◽  
Cloud Development

When we face large amounts of data, how can we find the most suitable educational resources quickly has become a pressing issue. In this paper, on the basic of comparative study on traditional recommendation algorithms, we use the cloud computing to solve the traditional collaborative filtering algorithms suffer from scalability issues, the proposed algorithm is applied to the combination of recommended teaching cloud platform program, the program according to different recommended by demand different recommendation strategies; open source project Hadoop as a cloud development platform of the algorithm; recommendation algorithm, algorithm on top of Hadoop to achieve improved operating efficiency is relatively high, ideal parallel performance, fully proved the cloud platform and recommended algorithm combining the advantages. The research work on the recommendation system and teaching cloud computing technology applications to provide a useful reference.

scholarly journals Book Recommendation System using Matrix Factorization

2021 ◽  
Vol 9 (VI) ◽  
pp. 4578-4582
Author(s):  
K. Venkata Ruchitha
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Recommender System ◽  
Matrix Factorization ◽  
Recommendation System ◽  
Previous History ◽  
Speed Up ◽  
Area Unit ◽  
Content Based Filtering

In recent years, recommender systems became more and more common and area unit applied to a various vary of applications, thanks to development of things and its numerous varieties accessible, that leaves the users to settle on from bumper provided choices. Recommendations generally speed up searches and create it easier for users to access content that they're curious about, and conjointly surprise them with offers they'd haven't sought for. By victimisation filtering strategies for pre-processing the information, recommendations area unit provided either through collaborative filtering or through content-based Filtering. This recommender system recommends books supported the description and features. It identifies the similarity between the books supported its description. It conjointly considers the user previous history so as to advocate the identical book.

Sign in / Sign up

Export Citation Format

Share Document