In this paper, we build a recommender system for a new study area: social commerce, which combines rich information about social network users and products on an e-commerce platform. The idea behind this recommender system is that a social network contains abundant information about its users which could be exploited to create profiles of the users. For social commerce, the quality of the profiles of potential consumers determines whether the recommender system is a success or a failure. In our work, not only the user’s textual information but also the tags and the relationships between users have been considered in the process of building user profiling model. A topic model has been adopted in our system, and a feedback mechanism also been design in this paper. Then, we apply a collative filtering method and a clustering algorithm in order to obtain a high recommendation accuracy. We do an empirical analysis based on real data collected on a social network and an e-commerce platform. We find that the social network has an impact on e-commerce, so social commerce could be realized. Simulations show that our topic model has a better performance in topic finding, meaning that our profile-building model is suitable for a social commerce recommender system.
Due to the growing interconnections of social networks, the problem of influence maximization has been extended from a single social network to multiple social networks. However, a critical challenge of influence maximization in multi-social networks is that some initial seed nodes may be unable to be active, which obviously leads to a low performance of influence spreading. Therefore, finding substitute nodes for mitigating the influence loss of uncooperative nodes is extremely helpful in influence maximization. In this paper, we propose three substitute mining algorithms for influence maximization in multi-social networks, namely for the Greedy-based substitute mining algorithm, pre-selected-based substitute mining algorithm, and similar-users-based substitute mining algorithm. The simulation results demonstrate that the existence of the uncooperative seed nodes leads to the range reduction of information influence. Furthermore, the viability and performance of the proposed algorithms are presented, which show that three substitute node mining algorithms can find suitable substitute nodes for multi-social networks influence maximization, thus achieves better influence.