Abstract

As users in event-based social networks (EBSNs) usually participate in events together with friends, classmates, colleagues, or family members, recommending events to a group of users is attracting increasing attention in EBSNs recent years. However, existing studies are lack of attention to the fact that groups in EBSNs may have potential desires for participating in the unexperienced events. In order to deal with the challenges, including mining implicit friendships between users, simulating the consulting process between users and their friends outside the groups, and simulating the negotiating process among members inside the groups, we propose a t wo- p hase g roup e vent r ecommendation (2PGER) model for EBSNs. First, we leverage information, such as online social behaviors, users’ event participation records, and topological structures of EBSNs to establish a global trust network among users and establish egotrust networks of all users. Then, we perform random walks on the pre-built egotrust network for each user to acquire the user’s predicted preferences on the unexperienced events. Third, we adopt a random walk with restarts (RWR) method to aggregate users’ preferences and recommend top N events to groups. In the end, we compare 2PGER with several baseline approaches on real datasets from Meetup. The results show that 2PGER outperforms baselines.

Highlights

  • Event-based social networks (EBSNs) applications, such as Meetup.com, Plancast.com and Douban.com, have gained rapid developments

  • Let t be the number of random walks that have been performed, and rui0,e be the returned opinion on the unexperienced event e by the ith (1 ≤ i ≤ t) random walk with start node u0, ωue,0i be the weight of rui0,e, the final predicted preference of u0 on e is calculated as follows: t ru0,e =

  • The above model can be regarded as a personalized PageRank algorithm [34] with nonuniform preference vector pg. When it is used for event-based social networks (EBSNs) group recommendation, it has the following shortcomings: (1) the characteristic of heterogeneous structure of EBSNs is not considered; (2) the opinions of friends outside the group are not exploited; and (3) the influence of consistency between member preferences and group preferences is not considered when measuring the weights of nodes in a given group

Read more

Summary

INTRODUCTION

Event-based social networks (EBSNs) applications, such as Meetup.com, Plancast.com and Douban.com, have gained rapid developments. All three members get together to discuss and negotiate to reach a consensus This two-phase decision making process motivates us the group event recommendation problem considering unexperienced events for EBSNs, which exhibits following three challenges: Challenge 1 (Mining Implicit Friendships): An EBSN does not provide the function of adding friends, but it contains abundant online and offline network information. How to utilize this information to discover implicit friendships is the primary problem need to be solved. The last section concludes this paper and points out our future work

RELATED WORKS
MODEL FRAMEWORK
PREFERENCES PREDICTION BASED ON RANDOM WALKS
MULTIPLE RANDOM WALKS
PREFERENCE AGGREGATION BASED ON RANDOM WALK WITH RESTARTS
GROUP RECOMMENDATION MODEL BASED ON RANDOM WALK WITH RESTARTS
SETTING OF THE RESTART VECTOR
TOP-N EVENT RECOMMENDATION TO GROUPS
COMPARISON METHODS
Findings
CONCLUSION

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.