scholarly journals A Group Recommendation Algorithm Based on Group Members' Weights and Project Popularity

Author(s):  
Min Li ◽  
Chunming Wu ◽  
Li Ye
2021 ◽  
Vol 11 (12) ◽  
pp. 5416
Author(s):  
Yanheng Liu ◽  
Minghao Yin ◽  
Xu Zhou

The purpose of POI group recommendation is to generate a recommendation list of locations for a group of users. Most of the current studies first conduct personal recommendation and then use recommendation strategies to integrate individual recommendation results. Few studies consider the divergence of groups. To improve the precision of recommendations, we propose a POI group recommendation method based on collaborative filtering with intragroup divergence in this paper. Firstly, user preference vector is constructed based on the preference of the user on time and category. Furthermore, a computation method similar to TF-IDF is presented to compute the degree of preference of the user to the category. Secondly, we establish a group feature preference model, and the similarity of the group and other users’ feature preference is obtained based on the check-ins. Thirdly, the intragroup divergence of POIs is measured according to the POI preference of group members and their friends. Finally, the preference rating of the group for each location is calculated based on a collaborative filtering method and intragroup divergence computation, and the top-ranked score of locations are the recommendation results for the group. Experiments have been conducted on two LBSN datasets, and the experimental results on precision and recall show that the performance of the proposed method is superior to other methods.


Author(s):  
Rong Pu ◽  
Bin Wang ◽  
Xiaoxu Song ◽  
Xinqiang Xie ◽  
Jing Qin

2018 ◽  
Vol 29 (1) ◽  
pp. 1092-1108 ◽  
Author(s):  
Ritu Meena ◽  
Sonajharia Minz

Abstract Recommender systems have focused on algorithms for a recommendation for individuals. However, in many domains, it may be recommending an item, for example, movies, restaurants etc. for a group of persons for which some remarkable group recommender systems (GRSs) has been developed. GRSs satisfy a group of people optimally by considering the equal weighting of the individual preferences. We have proposed a multi-expert scheme (MES) for group recommendation using genetic algorithm (GA) MES-GRS-GA that depends on consensus techniques to further improve group recommendations. In order to deal with this problem of GRS, we also propose a consensus scheme for GRSs where consensus from multiple experts are brought together to make a single recommended list of items in which each expert represents an individual inside the group. The proposed GA based consensus scheme is modeled as many consensus schemes within two phases. In the consensus phase, we have applied GA to obtain the maximum utility offer for each expert and generated the most appropriate rating for each item in the group. In the recommendation generation phase, again GA has been employed to produce the resulting group profile, i.e. the list of ratings with the minimum sum of distances from the group members. Finally, the results of computational experiments that bear close resemblance to real-world scenarios are presented and compared to baseline GRS techniques that illustrate the superiority of the proposed model.


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.


Author(s):  
Wenkai Ma ◽  
Gui Li ◽  
Zhengyu Li ◽  
Ziyang Han ◽  
Keyan Cao

2008 ◽  
Vol 34 (3) ◽  
pp. 2082-2090 ◽  
Author(s):  
Yen-Liang Chen ◽  
Li-Chen Cheng ◽  
Ching-Nan Chuang

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Xiangshi Wang ◽  
Lei Su ◽  
Qihang Zhou ◽  
Liping Wu

With the development of the Internet of Things (IoT), the group recommender system has also been extended to the field of IoT. The entities in the IoT are linked through social networks, which constitute massive amounts of data. In group activities such as group purchases and group tours, user groups often exhibit common interests and hobbies, and it is necessary to make recommendations for certain user groups. This idea constitutes the group recommender system. However, group members’ preferences are not fully considered in group recommendations, and how to use trusted social networks based on their preferences remains unclear. The focus of this paper is group recommendation based on an average strategy, where group members have preferential differences and use trusted social networks to correct for their preferences. Thus, the accuracy of the group recommender system in the IoT and big data environment is improved.


2022 ◽  
Vol 40 (1) ◽  
pp. 1-27
Author(s):  
Lei Guo ◽  
Hongzhi Yin ◽  
Tong Chen ◽  
Xiangliang Zhang ◽  
Kai Zheng

Group recommendation aims to recommend items to a group of users. In this work, we study group recommendation in a particular scenario, namely occasional group recommendation, where groups are formed ad hoc and users may just constitute a group for the first time—that is, the historical group-item interaction records are highly limited. Most state-of-the-art works have addressed the challenge by aggregating group members’ personal preferences to learn the group representation. However, the representation learning for a group is most complex beyond the aggregation or fusion of group member representation, as the personal preferences and group preferences may be in different spaces and even orthogonal. In addition, the learned user representation is not accurate due to the sparsity of users’ interaction data. Moreover, the group similarity in terms of common group members has been overlooked, which, however, has the great potential to improve the group representation learning. In this work, we focus on addressing the aforementioned challenges in the group representation learning task, and devise a hierarchical hyperedge embedding-based group recommender, namely HyperGroup. Specifically, we propose to leverage the user-user interactions to alleviate the sparsity issue of user-item interactions, and design a graph neural network-based representation learning network to enhance the learning of individuals’ preferences from their friends’ preferences, which provides a solid foundation for learning groups’ preferences. To exploit the group similarity (i.e., overlapping relationships among groups) to learn a more accurate group representation from highly limited group-item interactions, we connect all groups as a network of overlapping sets (a.k.a. hypergraph), and treat the task of group preference learning as embedding hyperedges (i.e., user sets/groups) in a hypergraph, where an inductive hyperedge embedding method is proposed. To further enhance the group-level preference modeling, we develop a joint training strategy to learn both user-item and group-item interactions in the same process. We conduct extensive experiments on two real-world datasets, and the experimental results demonstrate the superiority of our proposed HyperGroup in comparison to the state-of-the-art baselines.


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.


Sign in / Sign up

Export Citation Format

Share Document