Social Recommendation Algorithm Research Articles

An E-Commerce Personalized Recommendation Algorithm Based on Multiple Social Relationships

Environmental e-commerce is a sustainability-oriented e-commerce model. To address the problem of data sparsity and the lack of diversity in traditional e-commerce recommendation algorithms, a new collaborative filtering recommendation algorithm based on multiple social relationships is proposed in environmental e-commerce. In real social networks, there were many relationships between users. On the basis of the traditional matrix decomposition model, the proposed algorithm integrates multiple social relationships between users into the user feature matrix, and then the multiple social relationships between users and the user rating preference similarity were used to jointly predict the user’s rating value for commodity, thus the personalized recommendation for users was achieved. In order to verify the superiority of the proposed algorithm, in this paper, two open datasets were used to compare the performance of several recommendation algorithms. The experimental results show that compared with the traditional social recommendation algorithms, the proposed algorithm improves recommendation accuracy and diversity. In real environmental e-commerce recommendation systems, the proposed algorithm can provide users with more personalized recommendation results, and reduce the arbitrariness of customer purchases and frequent returns in reality.

Using Graph Neural Networks for Social Recommendations

Recommender systems have revolutionized the way users discover and engage with content. Moving beyond the collaborative filtering approach, most modern recommender systems leverage additional sources of information, such as context and social network data. Such data can be modeled using graphs, and the recent advances in Graph Neural Networks have led to the prominence of a new family of graph-based recommender system algorithms. In this work, we propose the RelationalNet algorithm, which not only models user–item, and user–user relationships but also item–item relationships with graphs and uses them as input to the recommendation process. The rationale for utilizing item–item interactions is to enrich the item embeddings by leveraging the similarities between items. By using Graph Neural Networks (GNNs), RelationalNet incorporates social influence and similar item influence into the recommendation process and captures more accurate user interests, especially when traditional methods fall short due to data sparsity. Such models improve the accuracy and effectiveness of recommendation systems by leveraging social connections and item interactions. Results demonstrate that RelationalNet outperforms current state-of-the-art social recommendation algorithms.

The application of social recommendation algorithm integrating attention model in movie recommendation

To improve the accuracy of recommendations, alleviate sparse data problems, and mitigate the homogenization of traditional socialized recommendations, a gated recurrent neural network is studied to construct a relevant user preference model to mine user project preferences. Through the Preference Attention Model Based on Social Relations (PASR), this study extracts user social influence preferences, performs preference fusion, and obtains a Recommendation Algorithm Based on User Preference and Social Influence (UPSI). The study demonstrates that the UPSI algorithm outperforms other methods like the SocialMF algorithm, yielding improved recommendation results, higher HR values, and larger NDCG values. Notably, when the K value equals 25 in Top-K recommendation and using the CiaoDVDs dataset, the NDCG value of the UPSI algorithm is 0.267, which is 0.120 higher than the SocialMF algorithm's score. Considering the user's interaction with the project and their social relationships can enhance the effectiveness of recommendations. Unlike other variants, the UPSI algorithm achieves a maximum hit rate HR value of 0.3713 and NDCG value of 0.2108 in the Douban dataset. In the CiaoDVDs dataset, the maximum hit rate HR value of UPSI is 0.4856, 0.0333 higher than UPS-A, 0.0601 higher than UPS, and 0.0901 higher than UP. Research methods can effectively improve the homogenization problem of traditional socialized recommendations, increase algorithm hit rates and NDCG values. Compared to previous studies, research methods can more fully explore the preference correlation between users, making recommended movies more in line with user requirements.

Do Trust based Social Recommendation Algorithms Work as Intended?

Recommender systems are powerful tools that filter and recommend content/information relevant to a given user. Collaborative filtering is the most popular technique used in building recommender systems and it has been successfully incorporated in many applications. These conventional recommendation systems require a minimum number of users, items, and ratings in order to provide effective recommendations. This results in the infamous cold-start problem where the system is not able to produce effective recommendations for new users. Recently, there has been an escalation in the popularity and usage of social networks, which persuades people to share their experiences in the form of reviews and ratings on social media. The components of social media such as the influence of friends, interests, and enjoyment create the opportunities to develop solutions for sparsity and cold start problems of recommendation systems. This paper aims to observe these patterns and analyze three of the existing social recommendation systems, SocialMF, SocialFD, and GraphRec. SocialMF and SocialFD algorithms are based on matrix factorization and distance metric learning respectively whereas GraphRec is an attention based deep learning model. Through extensive experimentation with the datasets that these algorithms were tested on and one new dataset, we compared the results based on evaluation metrics including Root Mean Squared Error (RMSE) and Mean Absolute Error (MAE). To investigate how trust impacts the performance of these models, we evaluated them by modifying the trust and social component. Experimental results show that there is no conclusive evidence that trust propagation plays a major part in these models. Moreover, these models show a slightly improved performance in the absence of trust statements.

A heterogeneous graph neural recommendation model with hierarchical social trust

In traditional social recommendation algorithms, methods based on Graph Neural Networks (GNNs) representation of social networks are widely used, but the increasing sparsity of data and the tendency of users’ social influence to be complex make it difficult for the algorithms to improve the recommendation quality efficiently. To address the issues, a heterogeneous graph neural recommendation model with hierarchical social trust (GraphNON) is proposed. The algorithm is improved by fully exploiting user-friend relationships and modeling different propagation channels of social influence in multiple ways respectively. Firstly, different types of potential friends are mined based on user-user social graph and user-item rating graph respectively. Different dynamic influences of direct friends and indirectly friends among users are modeled through hierarchical influence propagation. Secondly, associations between items are mined from user-item rating graph, and influence transmission among items is modeled through hierarchical influence propagation. Finally, updated user characteristics and item characteristics are used to predict whether a user is interested in an item or not. It is shown on both datasets that the model has significant improvement in both hit rate (HR) and normalized discounted cumulative gain (NDCG) metrics compared to the optimal benchmark model. For a potential feature dimension of 64, the HR of the Yelp dataset improved by 18.3% and the NDCG by 29.3%, while the HR of the Flickr dataset improved by 31.4% and the NDCG by 37.1%.

Social recommendation algorithm based on collaborative filter algorithms

For traditional collaborative filter recommendation algorithm technology, this paper combines the collaborative filtering recommendation algorithm with the community division technology of social networks, use the Louvain community to divide algorithms, divide the recommendation users to a community of similar users, and use the collaborative filter algorithm based on the user similarity formula within the community to recommend. In order to verify the effectiveness and accuracy of the algorithm in this paper, based on the introduction of the Douban dataset and the evaluation criteria used, a variety of comparative experiments are carried out on the Douban dataset with a variety of recommendation algorithms to verify the effectiveness of the proposed algorithm

A Graph Neural Network Social Recommendation Algorithm Integrating the Multi-Head Attention Mechanism

Collaborative filtering recommendation systems are facing the data sparsity problem associated with interaction data, and social recommendations introduce user social information to alleviate this problem. Existing social recommendation methods cannot express the user interaction interest and social influence deeply, which limits the recommendation performance of the system. To address this problem, in this paper we propose a graph neural network social recommendation algorithm integrating multi-head attention mechanism. First, based on the user-item interaction graph and social network graph, the graph neural network is used to learn the high-order relationship between users and items and deeply extract the latent features of users and items. In the process of learning user embedding vector representation based on the social network graph, the multi-head attention mechanism is introduced to increase the importance of friends with high influence. Then, we make rating predictions for the target users according to the learned user embedding vector representation and item embedding vector. The experimental results on the Epinions dataset show that the proposed method outperforms the existing methods in terms of both Recall and Normalized Discounted Cumulative Gain.

Graph-Augmentation-Free Self-Supervised Learning for Social Recommendation

Social recommendation systems can improve recommendation quality in cases of sparse user–item interaction data, which has attracted the industry’s attention. In reality, social recommendation systems mostly mine real user preferences from social networks. However, trust relationships in social networks are complex and it is difficult to extract valuable user preference information, which worsens recommendation performance. To address this problem, this paper proposes a social recommendation algorithm based on multi-graph contrastive learning. To ensure the reliability of user preferences, the algorithm builds multiple enhanced user relationship views of the user’s social network and encodes multi-view high-order relationship learning node representations using graph and hypergraph convolutional networks. Considering the effect of the long-tail phenomenon, graph-augmentation-free self-supervised learning is used as an auxiliary task to contrastively enhance node representations by adding uniform noise to each layer of encoder embeddings. Three open datasets were used to evaluate the algorithm, and it was compared to well-known recommendation systems. The experimental studies demonstrated the superiority of the algorithm.

Social Recommendation Algorithm Based on Self-Supervised Hypergraph Attention

Social network information has been widely applied to traditional recommendations that have received significant attention in recent years. Most existing social recommendation models tend to use pairwise relationships to explore potential user preferences, but overlook the complexity of real-life interactions between users and the fact that user relationships may be higher order. These approaches also ignore the dynamic nature of friend influence, which leads the models to treat different friend influences equally in different ways. To address this, we propose a social recommendation algorithm that incorporates graph embedding and higher-order mutual information maximization based on the consideration of social consistency. Specifically, we use the graph attention model to build higher-order information among users for deeper mining of their behavioral patterns on the one hand; while on the other hand, it models user embedding based on the principle of social consistency to finally achieve finer-grained inference of user interests. In addition, to alleviate the problem of losing its own hierarchical information after fusing different levels of hypergraphs, we use self-supervised learning to construct auxiliary branches that fully enhance the rich information in the hypergraph. Experimental results conducted on two publicly available datasets show that the proposed model outperforms state-of-the-art methods.

User Bias Drift Social Recommendation Algorithm based on Metric Learning

User Bias Drift Social Recommendation Algorithm based on Metric Learning

Design of Graph Neural Network Social Recommendation Algorithm Based on Coupling Influence

With the explosively growing amount of online information, recommender system becomes an important tool to help users efficiently find their desired information. In this paper, we propose a Graph Neural Network Social Recommendation Based on Coupled Influence by analyzing the social influence of 2-level friends (CI-GNNSR). First, we mine the user’s historical rating information and second-degree social information. Then, to learn the feature representation of users and movies, multiple Graph Attention Networks (GAT) are used to model the user-movie Graph and social network Graph. Our algorithm uses an attention-based memory network to learn the interest influence representation between users and their collaborative friends, which can distinguish the related factors among different users’ friends. The experiment results show that CI-GNNSR enhances the accuracy of recommendation by considering users’ social influence factors from multiple perspectives.

Graph Neural Network Social Recommendation Algorithm Integrating Static and Dynamic Features

In recent years, the study of social-based recommender systems has become an active research topic. We incorporate a combination of static and dynamic interest characteristics to predict users’ real-time dynamic interests, which has rarely been considered in previous studies. In this paper, we propose a graph neural network social recommendation model that integrates static and dynamic feature relationships (FSDFR-GNNSR). The model uses a graph embedding algorithm to extract static features of users and movies, and takes the static features as input to gated recurrent unit (GRU), so that the model can take static features into consideration while modeling user dynamic behavior. Finally, we use graph attention networks to represent the dynamic influence of friends, simplify the update strategy of second-order neighbor nodes. We apply graph pooling operations to improve the generalization ability of the algorithm. Empirical analyses on real datasets show that the proposed approach achieves superior performance to existing approaches.

Research on social recommendation algorithm based on fuzzy subjective trust

In order to resist malicious attacks and improve recommendation accuracy, this paper proposes a collaborative filtering recommendation algorithm based on fuzzy subjective trust based on the subjectivity and fuzziness of trust. Firstly, the trust matrix is constructed by calculating the trust degree between users based on fuzzy subjective trust model and set of trusted users. Then, based on the traditional collaborative filtering recommendation algorithm, the user hybrid recommendation matrix is obtained through user similarity matrix and trust matrix to form recommendations for target users. Experimental results show that this method can effectively improve the resistance to malicious attacks and improve the accuracy of the recommendation system.

Implicit social recommendation algorithm based on multilayer fuzzy perception similarity

Implicit social recommendation algorithm based on multilayer fuzzy perception similarity

ETBRec: a novel recommendation algorithm combining the double influence of trust relationship and expert users

The recommendation system has become the primary tool used by many Internet application platforms to solve the problem of information overload, and it faces issues such as data sparsity, cold start, and scalability. At present, most social recommendation algorithms only consider the influence of the trust relationship on the user’s feature vector, which indirectly affects the predicted rating, or consider directly trusting friends as neighbor users, which directly affects the predicted rating, but does not consider the direct influence and indirect combining influences to make rating predictions. Therefore, this paper proposes a collaborative filtering recommendation algorithm (ETBRec), which not only considers the trust difference between users but also proposes the definition of experts and considers the direct impact of expert users on prediction ratings and the trustees’ indirect impact of ratings. Among them, the trust difference is realized through trust metrics, including direct trust metrics and indirect trust metrics; the selection of expert users takes into account the user’s degree of trust and user rating attitude; experimental comparisons with various social recommendation algorithms and related recommendation algorithms on the Ciao and Douban datasets. The experimental results show that the ETBRec algorithm performs better on some evaluation indexes such as mean absolute error (MAE) and root mean squared error (RMSE).

Research on Collaborative Filtering Recommendation Based on Trust Relationship and Rating Trust

In the Internet age, how to dig out useful information from massive data has become a research hotspot. The emergence of recommendation algorithms effectively solves the problem of information overload, but traditional recommendation algorithms face problems such as data sparseness, cold start, and low accuracy. Later social recommendation algorithms usually only use a single social trust information for recommendation, and the integration of multiple trust relationships lacks an efficient model, which greatly affects the accuracy and reliability of recommendation. This paper proposes a trust-based approach. Recommended algorithm. First, use social trust data to calculate user trust relationships, including user local trust and user global trust. Further based on the scoring data, an implicit trust relationship is calculated, called rating trust, which includes scoring local trust and scoring global trust. Then set the recommendation weight, build the preference relationship between users through user trust and rating trust, and form a comprehensive trust relationship. The trust relationship of social networks is integrated into the probability matrix decomposition model to form an efficient and unified trusted recommendation model TR-PMF. This algorithm is compared with related algorithms on the Ciao and FilmTrust datasets, and the results prove that our method is competitive with other recommendation algorithms.

Multi-criteria recommender system based on social relationships and criteria preferences

Multi-criteria recommender systems have garnered considerable interests from researchers and practitioners. In this paper, we study the optimization of the accuracy and scalability of multi-criteria recommendation systems using social relationships and criteria preferences information. We firstly construct a hybrid social recommendation algorithm to investigate the advantages of social relationships, and extend the application scope of the algorithm by an implicit social relationship inference technique. Then the nonlinear aggregate functions are adopted to uncover the relationship between criteria and the overall rating. Besides, we cluster users and train the aggregate function for each user group with a much smaller sample size, which is useful for improving the training efficiency. Finally, we validate the proposed approaches on TripAdvisor multi-criteria rating data sets with different sparsity. The proposed social recommendation model outperforms traditional approaches for both active and cold start users in predicting criteria ratings. Multi-criteria ratings enhance accuracy on the condition that criteria ratings can be accurately predicted. Our results also confirm the benefits from nonlinear aggregate functions and cluster analysis, especially when the data set is extremely sparse.

Matrix Factorization Recommendation Algorithm Based on Multiple Social Relationships

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.

Adaptive Learning User Implicit Trust Behavior Based on Graph Convolution Network

In the existing social recommendation algorithms, the performance of the algorithms is bothered by the problem of noise and sparsity in social information. In the past few years, researchers have usually focused on solving noise problem or sparse problem, but ignored a key problem, that is if only solving the noise problem, the sparse problem will become more serious, similarly, if only solving the sparse problem, the noise problem will become more serious. Recently, a few studies attempt to solve both noise and sparse problems, usually using explicit trust features to filter trust information and generate implicit trust friends, but this will depend heavily on the quality of explicit trust features. Therefore, in this paper, we propose an adaptive algorithm based on graph convolution network, The main idea is to learn users' implicit trust behavior adaptively. Briefly, we use Jaccard similarity coefficient to filter out unnecessary trust information, the reliable trust information will be the users' trust attributes, then put into the graph convolution network, because of the good feature extraction ability of graph convolution network, we can use adaptive network to learn implicit trust features based on users' features, the trust features can infer the trust attributes for all users. In order to achieve the best effect of learning, we use iterative repetition of the above process, to mining the implicit influence of user trust behavior, so as to alleviate noise and sparsity problems. Experimental result shows that, on three open datasets: LastFM, Douban and Gowalla, the recommendation performance is improved, which proves the effectiveness of the algorithm.

A Novel Intelligent Recommendation Algorithm Based on Mass Diffusion

Social recommendation algorithm is a common tool for recommending interesting or potentially useful items to users amidst the sea of online information. The users usually have various relationships, each of which has its unique impact on the recommendation results. It is unlikely to make accurate recommendations solely based on one relationship. Based on user-item bipartite graph, this paper establishes a multisubnet composited complex network (MSCCN) of multiple user relationships and then extends the mass diffusion (MD) algorithm into a novel intelligent recommendation algorithm. Two public online datasets, namely, Epinions and FilmTrust, were selected to verify the effect of the proposed algorithm. The results show that the proposed intelligent recommendation algorithm with two types of relationships made much more accurate recommendations than that with a single relationship and the traditional MD algorithm.