A Tag-Based Group Recommendation Algorithm

Author(s):  
Wenkai Ma ◽  
Gui Li ◽  
Zhengyu Li ◽  
Ziyang Han ◽  
Keyan Cao
Author(s):  
Rong Pu ◽  
Bin Wang ◽  
Xiaoxu Song ◽  
Xinqiang Xie ◽  
Jing Qin

2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Junjie Jia ◽  
Yewang Yao ◽  
Zhipeng Lei ◽  
Pengtao Liu

The rapid development of social networks has led to an increased desire for group entertainment consumption, making the study of group recommender systems a hotspot. Existing group recommender systems focus too much on member preferences and ignore the impact of member activity level on recommendation results. To this end, a dynamic group recommendation algorithm based on the activity level of members is proposed. Firstly, the algorithm predicts the unknown preferences of members using a time-series-oriented rating prediction model. Secondly, considering the dynamic change of member activity level, the group profile is generated by designing a sliding time window to investigate the recent activity level of each member in the group at the recommended moment, and preference is aggregated based on the recent activity level of members. Finally, the group recommendations are generated based on the group profile. The experimental results show that the algorithm in this paper achieves a better recommendation result.


2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Hanyi Wang ◽  
Kun He ◽  
Ben Niu ◽  
Lihua Yin ◽  
Fenghua Li

Group activities on social networks are increasing rapidly with the development of mobile devices and IoT terminals, creating a huge demand for group recommendation. However, group recommender systems are facing an important problem of privacy leakage on user’s historical data and preference. Existing solutions always pay attention to protect the historical data but ignore the privacy of preference. In this paper, we design a privacy-preserving group recommendation scheme, consisting of a personalized recommendation algorithm and a preference aggregation algorithm. With the carefully introduced local differential privacy (LDP), our personalized recommendation algorithm can protect user’s historical data in each specific group. We also propose an Intra-group transfer Privacy-preserving Preference Aggregation algorithm (IntPPA). IntPPA protects each group member’s personal preference against either the untrusted servers or other users. It could also defend long-term observation attack. We also conduct several experiments to measure the privacy-preserving effect and usability of our scheme with some closely related schemes. Experimental results on two datasets show the utility and privacy of our scheme and further illustrate its advantages.


Author(s):  
K Sobha Rani

Collaborative filtering suffers from the problems of data sparsity and cold start, which dramatically degrade recommendation performance. To help resolve these issues, we propose TrustSVD, a trust-based matrix factorization technique. By analyzing the social trust data from four real-world data sets, we conclude that not only the explicit but also the implicit influence of both ratings and trust should be taken into consideration in a recommendation model. Hence, we build on top of a state-of-the-art recommendation algorithm SVD++ which inherently involves the explicit and implicit influence of rated items, by further incorporating both the explicit and implicit influence of trusted users on the prediction of items for an active user. To our knowledge, the work reported is the first to extend SVD++ with social trust information. Experimental results on the four data sets demonstrate that our approach TrustSVD achieves better accuracy than other ten counterparts, and can better handle the concerned issues.


Sign in / Sign up

Export Citation Format

Share Document