计算机科学 ›› 2018, Vol. 45 ›› Issue (3): 196-203.doi: 10.11896/j.issn.1002-137X.2018.03.031

• 人工智能 • 上一篇    下一篇

EBSN中基于潜在好友关系的活动推荐算法

于亚新,张海军   

  1. 东北大学计算机科学与工程学院 沈阳110169,东北大学计算机科学与工程学院 沈阳110169
  • 出版日期:2018-03-15 发布日期:2018-11-13
  • 基金资助:
    本文受国家自然科学基金项目:面向位置服务的不确定性RFID时空信息查询技术的研究(61272180)资助

Activity Recommendation Algorithm Based on Latent Friendships in EBSN

YU Ya-xin and ZHANG Hai-jun   

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

摘要: EBSN(Event-based Social Networks)与传统社交网络有所不同,它不仅包含传统社交网中的线上交互(Online Interactions),还包含颇具价值的线下交互(Offline Interactions),是一种异构型复杂社交网络。如何有效利用这种虚拟与物理相融合的交互关系来提高活动推荐服务的质量,是目前学术界和工业界共同关注的热点研究问题之一。传统社交活动推荐算法,如基于用户偏好或线上好友关系的活动推荐算法,除了考虑活动和用户的基本属性外,大多基于显式好友关系EF(Explicit Friendship)进行活动推荐,但EBSN不具备显式好友关系,因此上述算法均不能直接用于EBSN活动推荐。为此,定义了一种新的潜在好友关系LF(Latent Friendship),LF关系将线上同组、线下同活动综合纳入活动评分计算中,以体现LF对EBSN活动推荐的影响;同时,基于此提出了一种基于潜在好友关系的EBSN活动推荐算法(Activity Recommendation Algorithm based on Latent Friendships,ARLF),该算法在寻找潜在好友关系时,创新性地运用元路径思想,使得EBSN中的异构信息得到了充分利用。最后,利用Meetup事件社交网中的真实数据对ARLF算法进行了性能测试,可扩展性实验证明了该算法是可行且有效的。

关键词: EBSN,线上交互,线下交互,潜在好友关系,元路径,活动推荐

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!