An Efficient Adaptive Attention Neural Network for Social Recommendation

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.

With the rise of e-commerce, personalized recommendation algorithms have received much attention in recent years. Meanwhile, multimodal recommendation algorithms have become the next competitive track of personalized recommendation. The current mainstream recommendation algorithms (e.g., NeuMF, NGCF) rely too much on empirical data and do not effectively utilize multimodal information to model user preferences, while there is the problem of sparsity of user preference data. Secondly, they are still limited to using the same weights to fuse the item features of different modalities, and have the problem of inaccurate recommendation. For this reason, this paper proposes Multi-Modal Self-Supervised Learning Algorithm Based Product Recommendation (MMSLRec). (1) Data augmentation by self-supervised adversarial perturbation generation learning is performed to supplement the missing interaction information of tailed products to solve the common data sparsity problem in product recommendation. (2) A multimodal representation learning module is introduced to capture deep features in image and text modalities using AlexNet and Bert, respectively, in order to avoid the recommendation accuracy degradation problem caused by insufficient data feature learning. (3) Learning the user's perceived strength in different modalities, using the user co-occurrence matrix to fuse the features and make recommendations. Experiments on Amazon-Electronics, Amazon-Clothing, and Amazon-Baby, with different degrees of data sparsity verify the effectiveness of our MMSLRec in solving the data sparsity problem and the multimodal user preference modeling problem, and compared to the state-of-the-art baseline recommendation model on the three datasets, the Recall@20 improved by 9.26%, 3.11% and 2.92%, respectively.

To enhance students’ English writing ability, English creative writing has become a common course offered by colleges and universities. English reference is an indispensable tool for creative English writing. How to choose appropriate English references is an important guarantee to complete good work. Therefore, this paper proposes a Deep Semantic Mining-based Recommendation (DSMR) algorithm for English writing reference selection and recommendation to assist the completion of high-quality English creative writing works. The model can extract user features and document attributes more accurately by deeply mining semantic information of literature content and user needs, so as to achieve more accurate recommendations. First, the Bidirectional Encoder Representation from Transformers (BERT) pretraining model is adopted to process literature content and user requirement documents. Through in-depth mining of user characteristics and literature attributes, the problems of data sparsity and cold start of items are effectively alleviated. Then, the forward long short-term memory (LSTM) network was used to focus on the changes in user preferences over time, resulting in more accurate recommendations. The experimental results show that the use of heterogeneous information can significantly improve the recommendation performance, and the additional use of user attribute information can also improve the recommendation performance. Compared with other benchmark models, the recommendation quality of this model is greatly improved.

The goal of the recommender system is to understand the user's preferences and make appropriate recommendations for certain behaviors. Similarity is an important part of recommendation algorithm. However, most current recommendation algorithms ignore the social relation on users, and the most similarity calculations are based on the common object, which does not fully exploit the implicit information. For these challenges, firstly, an adaptive approach which takes both trust and rating into account is proposed to measure the implicit similarity between a user and his friends when the user as a truster and a trustee, respectively. Secondly, a recommendation algorithm combining trust and ratings is proposed, which also takes the biases of users and items, and the user's implicit feedback into account to enhance the accuracy of the algorithm. Finally, the social regularization recommendation algorithm is modified. The experimental results on two different datasets show that the proposed algorithm is able to not only outperform the traditional recommendation algorithm, but also effectively alleviate the data sparsity and cold start problems.

Delayed evolutionary game clustering-based recommendation algorithm via latent information and user preference

Recommender systems commonly encounter with the problems of data sparsity and cold start. Recently, social recommendation has emerged with the rapid expansion of social platforms, offering an opportunity to alleviate such two obstacles. Nevertheless, there are still two key limitations in existing studies. From the perspective of model design, previous social recommenders only consider the influence of a user's direct friends or uniformly treat the influences from different friends. From the perspective of model learning, most of them apply a sampling‐based optimization strategy, which requires high‐quality positive and negative samples. In light of the aforementioned limitations, we propose a new probabilistic method, named Graph Attentive Matrix Factorization (GAMF). Our method not only explicitly captures high‐order social relationships, but also adopts an attention mechanism to automatically pick up different influences between friends. Moreover, we develop an efficient optimization algorithm to learn model parameters in a non‐sampling manner. Extensive experiments on four large‐scale datasets show the superiority of GAMF over state‐of‐the‐art recommenders, especially under the cold start scenario.

Collaborative filtering (CF)-based recommendation systems that rely on user-item history interactions often suffer from the data sparsity problem. Social-based recommendation methods have become one of the successful methods to address this problem. However, few works have focused on the sparsity problem of social data. As real-world social networks are usually sparse, the observed relationships in social networks can only represent a limited part of a person's real social network. The sparse social data will degrade the performance of the existing social-based algorithms. Also, the influence of a user's friends on their friends is dynamic: even the same friend may impact the target user in different decision-making processes. It is difficult for an the end-to-end deep learning-based model to provide underlying reasons for the recommendation results. To this end, we propose a novel deep learning-based model to extract useful missing links as auxiliary social information to enrich the users' features for item recommendation. The framework is composed of two major components: a missing links identifier module that generates useful social links from a heterogeneous information network to enrich the user's social profile and enhance the social-based recommendation model, and an attention-based recommendation module that assigns different scores for each friend with regard to different candidate items to adaptively evaluate the quality of different social links. An attention-based fusion strategy is proposed to improve the interpretability of the recommendation system by assigning non-uniform weight to different factors. Extensive experiments on three published datasets show that our proposed method achieves better performance than other state-of-the-art methods.

Recommender systems play an important role in most modern e-commerce applications. They have allowed users to become aware of the myriad choices available to them. The ease of information and the abundance of options have helped users make educated decisions. A recommender system studies a user's preferences and continues learning the user's changing interests, so as to suggest items that incline with the user's interests. In cases where a user is new to the application, or the user prefers not to discourse preferences, the recommender system is unable to gather the user's preference on any item. This is called the cold start problem; wherein the system can make valid recommendations only once the user starts informing the system about his/her choices. In this paper, we discuss the challenges faced by the cold start problem and how this problem may be alleviated using social media. We suggest an approach where we collect public information from users' social media accounts and analyze this information to understand their preferences. In particular, we gather the new user's information using their Twitter profile; i.e., the user's interest and preferences are extracted from his/her Twitter profile by analyzing his/her tweets. These interests will help the system understand what kind of movies the user will be most interested in. We compare these preferences with the metadata about the individual items. Using this approach, we develop a movie recommendation system wherein we produce top-N movie recommendations for a user. We used the MovieTweetings dataset to model the application. Two sets of results have been produced. In the first, smaller set of 770 users, 72.67% of users have received 100% accurate movie recommendations while nearly 80% of users got more than 75% accuracy. For the second, larger set of more than 3,500 users, 53 % of users have received 100% accurate recommendations while 72% of users got more than 75% accuracy. These encouraging results have demonstrated that the approach is effectively in alleviating cold start problems in recommendation systems, and may be applicable to many other e-commerce applications.

Social recommendation, which utilizes social relations to enhance recommender systems, has been gaining increasing attention recently with the rapid development of online social network. Existing social recommendation methods are based on the fact that users preference or decision is influenced by their social friends' behaviors. However, they assume that the influences of social relation are always the same, which violates the fact that users are likely to share preference on diverse products with different friends. In this paper, we present a novel CSR (short for Characterized Social Regularization) model by designing a universal regularization term for modeling variable social influence. Our proposed model can be applied to both explicit and implicit iteration. Extensive experiments on a real-world dataset demonstrate that CSR significantly outperforms state-of-the-art social recommendation methods.

Context-aware Recommender Systems aim to provide users with the most adequate recommendations for their current situation. However, an exact context obtained from a user could be too specific and may not have enough data for accurate rating prediction. This is known as the data sparsity problem. Moreover, often user preference representation depends on the domain or the specific recommendation approach used. Therefore, a big effort is required to change the method used. In this paper we present a new approach for contextual pre-filtering (i.e. using the current context to select a relevant subset of data). Our approach can be used with existing recommendation algorithms. It is based on two ontologies: Recommender System Context ontology, which represents the context, and Contextual Ontological User Profile ontology, which represents user preferences. We evaluated our approach through an offline study which showed that when used with well-known recommendation algorithms it can significantly improve the accuracy of prediction.

Intimate partner violence (IPV) is a prevalent problem worldwide. Friends of perpetrators may be in a unique position to support or affect change. However, little is known about the influence of friendship with a perpetrator on responses to IPV. Social identity theory describes an ingroup bias whereby ingroup perpetrators of violence are viewed as less personally responsible than outgroup perpetrators. This bias has been consistently found for impersonal ingroup relationships, but there is limited research in relation to friends of perpetrators. Drawing on social psychological theories, this study aimed to explore the impact of friendship with a perpetrator on responses to IPV-specifically, on attributions of causality and social rejection. A fictional vignette depicting IPV perpetrated by either a friend or a stranger was presented to 174 university students, who then completed a questionnaire on attributions and social rejection. Results indicated that participants attributed high blame to the perpetrator regardless of their relationship, but friends of the perpetrator were significantly more likely than strangers to attribute the cause of the violence to external factors. Friends of perpetrators were likely to continue the friendship, though social rejection was significantly more likely when the perpetrator was attributed high blame and internal causality. Ingroup bias was not consistently present across all outcomes, demonstrating the complexity of social relationships and IPV. The findings suggest expectancy based on past behavior may influence attributions for violence in existing relationships. The combination of high blame, external attributions, and low social rejection was discussed in relation to opportunities for friends to intervene to prevent IPV. The multifaceted influence of friendship on responses to IPV perpetration suggests the need to consider relationship factors when designing violence prevention campaigns and bystander intervention programs.

Modeling user preferences from users' historical sequences is one of the core problems of sequential recommendation. Previous studies only considered transition patterns between user-items, ignoring transition patterns between item features and item-item interactions. Recently, there has been interest in integrating knowledge graphs as auxiliary information into sequential recommendation. Most of the existing methods deal with the heterogeneous information in the knowledge graph in a coarse-grained manner. We believe that fine-grained processing of information in knowledge graphs can help recommendation systems understand changes in user preferences, i.e. dividing hetero-geneous information into item-to-item relationships and item-to-attribute relationships. In this paper, we propose a dual-level self-attention network for sequential recommendation. Specifically, we divide the knowledge graph heterogeneous information about items into relation level and attribute level, representing item-item relationship and item-attribute relationship, respectively. Afterwards, the self-attention network is used to learn user preferences at dual-level, respectively. Then, the outputs of the above dual levels are integrated for next item recommendation. Based on extensive experiments on three real-world data sets, our model achieves significant improvements compared to state-of-the-art baseline methods.

A point-of-interest(POI) recommendation aims to mine a user’s visiting history and find her/his potentially preferred places. The decision process when choosing a POI is complex and can be influenced by numerous factors, including personal preferences, geographical considerations, and user social relations. While latent factor models have been proven effective and are widely used for recommendations, adopting them to POI recommendations requires delicate consideration of the unique characteristics of location-based social networks (LBSNs). To this end, in this paper, we propose a joint convolution matrix factorization model, named the Review Geographical Social (ReGS) which strategically takes various factors into consideration. Specifically, this model captures geographical influences from a user’s check-in behaviour, and user social relations can be effectively leveraged in the recommendation model. The reviews information available on LBSNs could be related to a user’s check-in action, providing a unique opportunity for a POI recommendation. We model above three types of information under a unified POI recommendation framework based on convolution matrix factorization which integrates a convolutional neural network into a probability matrix factorization. Finally, we conduct a comprehensive performance evaluation for the ReGS using two real-world datasets collected from Foursquare. Experimental results show that the ReGS achieves significantly superior precision and recall rates to other state-of-the-art recommendation models.

A microblog recommendation method based on tag correlation and user social relation is proposed via analyzing microblog features and the deficiencies of existing microblog recommendation algorithm. Specifically, a tag retrieval strategy is established to add tags for unlabeled users and users with few tags, and the user-tag matrix is then built and user-tag weights are then obtained. In order to solve the problem of sparsity of the matrix, the correlation between the tags is investigated to update the user-tag matrix. Considering the significance of user social relation for microblog recommendation, a user-user social relation similarity matrix is constructed and a mechanism is designed to iteratively obtain user interest. Experimental results show that the algorithm is effective for microblog recommendation.

The advancements in wearable technology, where embedded accelerometers, gyroscopes and other sensors enable the users to actively monitor their activity have made it easier for individuals to pursue a healthy lifestyle. However, most of the existing applications expect continuous commitment from the end users, who need to proactively interact with the application in order to connect with friends and attain their goals. These applications fail to engage and motivate users who have busy schedules, or are not as committed and self-motivated. In this work, we present PRO-Fit, a personalized assistant application that employs machine learning and recommendation algorithms in order to smartly track and identify user's activity, synchronizes with the user's calendar, recommends personalized workout sessions based on the user's preferences, goals, and availability. Moreover, PRO-Fit integrates with the user's social network and recommends fitness buddies with similar preferences and availability.