Advanced search
2 files | 2.47 MB

Performance characterization of game recommendation algorithms on online social network sites

Philip Leroux (UGent) , Bart Dhoedt (UGent) , Piet Demeester (UGent) and Filip De Turck (UGent)
Author
Organization
Abstract
Since years, online social networks have evolved from profile and communication websites to online portals where people interact with each other, share and consume multimedia-enriched data and play different types of games. Due to the immense popularity of these online games and their huge revenue potential, the number of these games increases every day, resulting in a current offering of thousands of online social games. In this paper, the applicability of neighborhood-based collaborative filtering (CF) algorithms for the recommendation of online social games is evaluated. This evaluation is based on a large dataset of an online social gaming platform containing game ratings (explicit data) and online gaming behavior (implicit data) of millions of active users. Several similarity metrics were implemented and evaluated on the explicit data, implicit data and a combination thereof. It is shown that the neighborhood-based CF algorithms greatly outperform the content-based algorithm, currently often used on online social gaming websites. The results also show that a combined approach, i.e., taking into account both implicit and explicit data at the same time, yields overall good results on all evaluation metrics for all scenarios, while only slightly performing worse compared to the strengths of the explicit or implicit only approaches. The best performing algorithms have been implemented in a live setup of the online game platform.
Keywords
IMPLICIT FEEDBACK, mining method and algorithm, IBCN, data mining, personalization

Downloads

  • 5489 i.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 626.86 KB
  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 1.85 MB

Citation

Please use this url to cite or link to this publication:

Chicago
Leroux, Philip, Bart Dhoedt, Piet Demeester, and Filip De Turck. 2012. “Performance Characterization of Game Recommendation Algorithms on Online Social Network Sites.” Journal of Computer Science and Technology 27 (3): 611–623.
APA
Leroux, P., Dhoedt, B., Demeester, P., & De Turck, F. (2012). Performance characterization of game recommendation algorithms on online social network sites. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 27(3), 611–623.
Vancouver
1.
Leroux P, Dhoedt B, Demeester P, De Turck F. Performance characterization of game recommendation algorithms on online social network sites. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY. 2012;27(3):611–23.
MLA
Leroux, Philip et al. “Performance Characterization of Game Recommendation Algorithms on Online Social Network Sites.” JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 27.3 (2012): 611–623. Print.
@article{3234636,
  abstract     = {Since years, online social networks have evolved from profile and communication websites to online portals where people interact with each other, share and consume multimedia-enriched data and play different types of games. Due to the immense popularity of these online games and their huge revenue potential, the number of these games increases every day, resulting in a current offering of thousands of online social games. In this paper, the applicability of neighborhood-based collaborative filtering (CF) algorithms for the recommendation of online social games is evaluated. This evaluation is based on a large dataset of an online social gaming platform containing game ratings (explicit data) and online gaming behavior (implicit data) of millions of active users. Several similarity metrics were implemented and evaluated on the explicit data, implicit data and a combination thereof. It is shown that the neighborhood-based CF algorithms greatly outperform the content-based algorithm, currently often used on online social gaming websites. The results also show that a combined approach, i.e., taking into account both implicit and explicit data at the same time, yields overall good results on all evaluation metrics for all scenarios, while only slightly performing worse compared to the strengths of the explicit or implicit only approaches. The best performing algorithms have been implemented in a live setup of the online game platform.},
  author       = {Leroux, Philip and Dhoedt, Bart and Demeester, Piet and De Turck, Filip},
  issn         = {1000-9000},
  journal      = {JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY},
  keywords     = {IMPLICIT FEEDBACK,mining method and algorithm,IBCN,data mining,personalization},
  language     = {eng},
  number       = {3},
  pages        = {611--623},
  title        = {Performance characterization of game recommendation algorithms on online social network sites},
  url          = {http://dx.doi.org/10.1007/s11390-012-1248-6},
  volume       = {27},
  year         = {2012},
}

Altmetric
View in Altmetric
Web of Science
Times cited: