A Fairness Group Recommendation Algorithm Based On User Activity

Abstract

Abstract In the process of group recommendation, due to the different preferences of group members, the recommendation results cannot meet the needs of all users. How to maximize the fairness of group recommendation is still a challenge. Therefore, this paper proposes a group recommendation algorithm based on user activity. Firstly, a group discovery algorithm based on item cluster preference was used to mine potential groups. Secondly, considering the dynamic change of activity, a sliding time window is designed to investigate the recent activity of each member in the group at the time of subgroup division, and the group is divided into active subgroup and inactive subgroup. Finally, the group recommendation list was generated by aggregating the subgroup preferences by average consensus. Experimental results on the public dataset show that compared with the AGREE algorithm, the recommendation accuracy and coverage of the proposed algorithm are improved by 2.1% and 2.9%, respectively. By focusing on the preference needs of inactive users, the proposed algorithm effectively improves the recommendation satisfaction and group fairness.

Keywords

• Group recommendation
• Fairness
• Activity
• Attention mechanism