Presentation of the paper Event Recommendation in Event-based Social Networks at the 1st International Workshop on Social Personalisation (SP 2014) co-located with the 25th ACM Conference on Hypertext and Social Media
Event Recommendation in Event-based Social Networks
1. Event Recommendation in Event-Based Social
Networks
Augusto Queiroz and Leandro Balby Marinho
Information Systems and Database Group
Federal University of Campina Grande (UFCG)
1st International Workshop on Social Personalisation (SP 2014)
Co-located with the 25th ACM Conference on Hypertext and Social Media
L. B. Marinho 1 / 21 SP'14
2. Event-Based Social Networks (EBSN)
People can create events of any kind and share it with other users.
L. B. Marinho 2 / 21 SP'14
3. Recommending in EBSN
I Problem: Among the large number of events available in
EBSNs, which ones best match the user's preferences?
I More challenging than traditional domains (why?)
L. B. Marinho 3 / 21 SP'14
8. ltering algorithms?
I In which point of the event life time users tend to provide
RSVPs?
I How the geographic distance between the users home and
active events aect their decision on attending these events?
I How simple and state-of-the-art algorithms compare in this
domain?
L. B. Marinho 7 / 21 SP'14
9. Related Work
I [Liu et al. KDD'12]: Recommendation of users to events in
Meetup.
I [Khrouf et al. RecSys'13]: Recommendation of events in
Last.fm.
I Restricted domain: music concerts and festivals.
I Use of linked-open data on the domain of interest.
I Our Work:
I Recommendation of generic events.
I Experiments under the true level of sparsity found on EBSN.
I Investigation of previously unexplored features of EBSN.
L. B. Marinho 8 / 21 SP'14
10. Data Collection
I Data collected from Meetup.com Data from January, 2010 to
December, 2011
I Cities Collected: Phoenix, Chicago and San Jose
City #Users #Events #RSVPs Sparsity
Phoenix 589 K 215 K 1.5 M 99.998%
Chicago 719 K 220 K 1,3 M 99.999%
San Jose 281 K 242 K 1.7 M 99.997%
L. B. Marinho 9 / 21 SP'14
11. RSVP Analysis
45% of the
events have at
most 1 RSVP
90% of the
events have at
most 10 RSVPs
L. B. Marinho 10 / 21 SP'14
12. Event Lifespan
80% of the
events have a
life time of at
most 100 days
L. B. Marinho 11 / 21 SP'14
13. When do RSVPs Occur?
The more Yes
RSVPs, the
later it will be
L. B. Marinho 12 / 21 SP'14
14. When do RSVPs Occur?
75% of the
RSVPs are
received during
the last 20% of
event life time.
L. B. Marinho 13 / 21 SP'14
15. Distance Distribution
50% of the
RSVPs are to
events within
10 Km of users
home
95% of the
RSVPs are to
events within
100 Km.
L. B. Marinho 14 / 21 SP'14
16. Data Preparation
Timed split: 6 time stamps, equally spaced in 6 months.
L. B. Marinho 15 / 21 SP'14
17. Compared Algorithms
I Random
I Most-Popular
I Location-Aware
I BPR-MF
I User-KNN and Item-KNN
I Logistic-Regression: hybrid will all above (except random)
I Evaluation Metric: NDCG@20
L. B. Marinho 16 / 21 SP'14
18. Results
KNNs have the
power.
Location-aware
as an alterantive
for full-cold
start.
NDCG@20 0.3
L. B. Marinho 17 / 21 SP'14
19. Sparsity Analysis of the Test Set
Majority of
events in Test
have no Yes
RSVP in Train!
L. B. Marinho 18 / 21 SP'14
21. Conclusions and Future Works
I The largest majority of events are cold-start.
I RSVPs tend to be given close to the occurrence of the event.
I Despite the high sparsity of RSVP data, KNN-based
algorithms appear as the best single alternative.
I Matrix-factorization does not perform as well in this domain
as it does in other more typical domains.
I For future work: use categories, description and social
networks.
L. B. Marinho 20 / 21 SP'14
22. References
Event-based social networks: linking the online and oine
social worlds. Proceedings of the 18th ACM SIGKDD
international conference on Knowledge discovery and data
mining, 2012.
Hybrid Event Recommendation Using Linked Data and User
Diversity. Proceedings of the 7th ACM Conference on
Recommender Systems, 2013.
L. B. Marinho 21 / 21 SP'14