A Social Recommendation Model Based on Basic Spatial Mapping and Bilateral Generative Adversarial Networks.

Social recommender systems are expected to improve recommendation quality by incorporating social information when there is little user-item interaction data. Therefore, how to effectively fuse interaction information and social information becomes a hot research topic in social recommendation, and how to mine and exploit the heterogeneous information in the interaction and social space becomes the key to improving recommendation performance. In this paper, we propose a social recommendation model based on basic spatial mapping and bilateral generative adversarial networks (MBSGAN). First, we propose to map the base space to the interaction and social space, respectively, in order to overcome the issue of heterogeneous information fusion in two spaces. Then, we construct bilateral generative adversarial networks in both interaction space and social space. Specifically, two generators are used to select candidate samples that are most similar to user feature vectors, and two discriminators are adopted to distinguish candidate samples from high-quality positive and negative examples obtained from popularity sampling, so as to learn complex information in the two spaces. Finally, the effectiveness of the proposed MBSGAN model is verified by comparing it with both eight social recommendation models and six models based on generative adversarial networks on four public datasets, Douban, FilmTrust, Ciao, and Epinions.

Accurate and scalable social recommendation using mixed-membership stochastic block models.

With increasing amounts of information available, modeling and predicting user preferences-for books or articles, for example-are becoming more important. We present a collaborative filtering model, with an associated scalable algorithm, that makes accurate predictions of users' ratings. Like previous approaches, we assume that there are groups of users and of items and that the rating a user gives an item is determined by their respective group memberships. However, we allow each user and each item to belong simultaneously to mixtures of different groups and, unlike many popular approaches such as matrix factorization, we do not assume that users in each group prefer a single group of items. In particular, we do not assume that ratings depend linearly on a measure of similarity, but allow probability distributions of ratings to depend freely on the user's and item's groups. The resulting overlapping groups and predicted ratings can be inferred with an expectation-maximization algorithm whose running time scales linearly with the number of observed ratings. Our approach enables us to predict user preferences in large datasets and is considerably more accurate than the current algorithms for such large datasets.

Graph neural networks for preference social recommendation.

Social recommendation aims to improve the performance of recommendation systems with additional social network information. In the state of art, there are two major problems in applying graph neural networks (GNNs) to social recommendation: (i) Social network is connected through social relationships, not item preferences, i.e., there may be connected users with completely different preferences, and (ii) the user representation of current graph neural network layer of social network and user-item interaction network is the output of the mixed user representation of the previous layer, which causes information redundancy. To address the above problems, we propose graph neural networks for preference social recommendation. First, a friend influence indicator is proposed to transform social networks into a new view for describing the similarity of friend preferences. We name the new view the Social Preference Network. Next, we use different GNNs to capture the respective information of the social preference network and the user-item interaction network, which effectively avoids information redundancy. Finally, we use two losses to penalize the unobserved user-item interaction and the unit space vector angle, respectively, to preserve the original connection relationship and widen the distance between positive and negative samples. Experiment results show that the proposed PSR is effective and lightweight for recommendation tasks, especially in dealing with cold-start problems.

Recommendation model based on generative adversarial network and social reconstruction.

Social relations can effectively alleviate the data sparsity problem in recommendation, but how to make effective use of social relations is a difficulty. However, the existing social recommendation models have two deficiencies. First, these models assume that social relations are applicable to various interaction scenarios, which does not match the reality. Second, it is believed that close friends in social space also have similar interests in interactive space and then indiscriminately adopt friends' opinions. To solve the above problems, this paper proposes a recommendation model based on generative adversarial network and social reconstruction (SRGAN). We propose a new adversarial framework to learn interactive data distribution. On the one hand, the generator selects friends who are similar to the user's personal preferences and considers the influence of friends on users from multiple angles to get their opinions. On the other hand, friends' opinions and users' personal preferences are distinguished by the discriminator. Then, the social reconstruction module is introduced to reconstruct the social network and constantly optimize the social relations of users, so that the social neighborhood can assist the recommendation effectively. Finally, the validity of our model is verified by experimental comparison with multiple social recommendation models on four datasets.

Signaling effect in social network and charity crowdfunding: Empirical analysis of charity crowdfunding of Sina MicroBlog in China.

With the increasing number of online charity donations, research on the influencing factors of individual donation behavior has become an important topic. Social interaction information in crowdfunding has become an essential basis for potential backers to make decisions. It provides new research space for charity crowdfunding and social capital theory. The primary purpose of this study is to explore the influence of social capital, social recommendation, and other signals on charity crowdfunding performance. We obtain 4,780 project information on the charity crowdfunding of Sina MicroBlog through data collection procedures. Our research found that both external social capital and internal capital can significantly improve the fundraising performance of crowdfunding projects. Projects with more social recommendations are more likely to obtain financial support. In the case of Medical aid crowdfunding projects, the positive promotion effect of social recommendations on project fundraising ability is enhanced. To get more effective support for crowdfunding projects, it is necessary to pay attention to the construction of social capital and the cultivation of its reputation to obtain the recognition of potential backers.