Computer Science ›› 2018, Vol. 45 ›› Issue (3): 196-203.doi: 10.11896/j.issn.1002-137X.2018.03.031

Previous Articles     Next Articles

Activity Recommendation Algorithm Based on Latent Friendships in EBSN

YU Ya-xin and ZHANG Hai-jun   

  • Online:2018-03-15 Published:2018-11-13

Abstract: EBSN(Event-based Social Networks) not only contain online social interactions in the conventional online social networks,but also include valuable offline social interactions captured in offline activities,possessing a complicated heterogeneous nature.How to use the coexistence of online and offline social interactions to improve the service quality has become a hot issue in both academic and industry domains.Besides considering basic attributes from events and users, most traditional social activity recommendation approaches recommend interesting activities to users based on explicit friendships.However,there is no explicit friendships in EBSN,which makes these traditional algorithms can’t be applied to EBSN’s event recommendation directly.In this light,a novel concept LF (Latent Friendship) was defined in this paper.LF not only takes into account the online same group relationships,but also considers the offline same activity relationships.Further,ARLF(Activity Recommendation Algorithm based on Latent Friendship)was proposed by synthesizing the influence of group and activity for activity recommendation.Meanwhile,this paper creatively applied the idea of Meta-Path to capture the latent friends,which exploits the heterogeneous information fully in EBSN.Finally,extensive experiments based on real data of Meetup show that ARLF is feasible and effective on recommending desirable and interesting activities for EBSN users.

Key words: EBSN,Online interactions,Offline interactions,Latent friendships,Meta-path,Activity recommendation

[1] LIU X,HE Q,TIAN Y,et al.Event-based social networks:lin-king the online and offline social worlds[C]∥Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.ACM,2012:1032-1040.
[2] BACKSTROM L,HUTTENLOCHER D,KLEINBERG J,etal.Group formation in large social networks:membership,growth,and evolution[C]∥Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.ACM,2006:44-54.
[3] HAN J,NIU J,CHIN A,et al.How online social network affects offline events:A case study on douban[C]∥2012 9th International Conference on Ubiquitous Intelligence & Computing and 9th International Conference on Autonomic & Trusted Computing (UIC/ATC).IEEE,2012:752-757.
[4] XU B,CHIN A,COSLEY D.On how event size and interactivity affect social networks[C]∥Extended Abstracts on Human Factors in Computing Systems(CHI’13).ACM,2013:865-870.
[5] LEE D H.Pittcult:trust-based cultural event recommender[C]∥Proceedings of the 2008 ACM Conference on Recommender Systems.ACM,2008:311-314.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!