Meme ranking to maximize posts virality in microblogging platforms

Francesco Bonchi, Carlos Castillo, Dino Ienco

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Microblogging is a modern communication paradigm in which users post bits of information, or "memes" as we call them, that are brief text updates or micromedia such as photos, video or audio clips. Once a user post a meme, it become visible to the user community. When a user finds a meme of another user interesting, she can eventually repost it, thus allowing memes to propagate virally trough the social network. In this paper we introduce the meme ranking problem, as the problem of selecting which k memes (among the ones posted by their contacts) to show to users when they log into the system. The objective is to maximize the overall activity of the network, that is, the total number of reposts that occur. We deeply characterize the problem showing that not only exact solutions are unfeasible, but also approximated solutions are prohibitive to be adopted in an on-line setting. Therefore we devise a set of heuristics and we compare them trough an extensive simulation based on the real-world Yahoo! Meme social graph, using parameters learnt from real logs of meme propagations. Our experimentation demonstrates the effectiveness and feasibility of these methods.

Original languageEnglish
Pages (from-to)211-239
Number of pages29
JournalJournal of Intelligent Information Systems
Volume40
Issue number2
DOIs
Publication statusPublished - 1 Apr 2013
Externally publishedYes

Fingerprint

Communication

Keywords

  • Feed ranking
  • Information propagation
  • Social network analysis

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications
  • Software

Cite this

Meme ranking to maximize posts virality in microblogging platforms. / Bonchi, Francesco; Castillo, Carlos; Ienco, Dino.

In: Journal of Intelligent Information Systems, Vol. 40, No. 2, 01.04.2013, p. 211-239.

Research output: Contribution to journalArticle

Bonchi, Francesco ; Castillo, Carlos ; Ienco, Dino. / Meme ranking to maximize posts virality in microblogging platforms. In: Journal of Intelligent Information Systems. 2013 ; Vol. 40, No. 2. pp. 211-239.
@article{a5bf5b2c765f4ee285aad4c3d5dce2e7,
title = "Meme ranking to maximize posts virality in microblogging platforms",
abstract = "Microblogging is a modern communication paradigm in which users post bits of information, or {"}memes{"} as we call them, that are brief text updates or micromedia such as photos, video or audio clips. Once a user post a meme, it become visible to the user community. When a user finds a meme of another user interesting, she can eventually repost it, thus allowing memes to propagate virally trough the social network. In this paper we introduce the meme ranking problem, as the problem of selecting which k memes (among the ones posted by their contacts) to show to users when they log into the system. The objective is to maximize the overall activity of the network, that is, the total number of reposts that occur. We deeply characterize the problem showing that not only exact solutions are unfeasible, but also approximated solutions are prohibitive to be adopted in an on-line setting. Therefore we devise a set of heuristics and we compare them trough an extensive simulation based on the real-world Yahoo! Meme social graph, using parameters learnt from real logs of meme propagations. Our experimentation demonstrates the effectiveness and feasibility of these methods.",
keywords = "Feed ranking, Information propagation, Social network analysis",
author = "Francesco Bonchi and Carlos Castillo and Dino Ienco",
year = "2013",
month = "4",
day = "1",
doi = "10.1007/s10844-011-0181-4",
language = "English",
volume = "40",
pages = "211--239",
journal = "Journal of Intelligent Information Systems",
issn = "0925-9902",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - Meme ranking to maximize posts virality in microblogging platforms

AU - Bonchi, Francesco

AU - Castillo, Carlos

AU - Ienco, Dino

PY - 2013/4/1

Y1 - 2013/4/1

N2 - Microblogging is a modern communication paradigm in which users post bits of information, or "memes" as we call them, that are brief text updates or micromedia such as photos, video or audio clips. Once a user post a meme, it become visible to the user community. When a user finds a meme of another user interesting, she can eventually repost it, thus allowing memes to propagate virally trough the social network. In this paper we introduce the meme ranking problem, as the problem of selecting which k memes (among the ones posted by their contacts) to show to users when they log into the system. The objective is to maximize the overall activity of the network, that is, the total number of reposts that occur. We deeply characterize the problem showing that not only exact solutions are unfeasible, but also approximated solutions are prohibitive to be adopted in an on-line setting. Therefore we devise a set of heuristics and we compare them trough an extensive simulation based on the real-world Yahoo! Meme social graph, using parameters learnt from real logs of meme propagations. Our experimentation demonstrates the effectiveness and feasibility of these methods.

AB - Microblogging is a modern communication paradigm in which users post bits of information, or "memes" as we call them, that are brief text updates or micromedia such as photos, video or audio clips. Once a user post a meme, it become visible to the user community. When a user finds a meme of another user interesting, she can eventually repost it, thus allowing memes to propagate virally trough the social network. In this paper we introduce the meme ranking problem, as the problem of selecting which k memes (among the ones posted by their contacts) to show to users when they log into the system. The objective is to maximize the overall activity of the network, that is, the total number of reposts that occur. We deeply characterize the problem showing that not only exact solutions are unfeasible, but also approximated solutions are prohibitive to be adopted in an on-line setting. Therefore we devise a set of heuristics and we compare them trough an extensive simulation based on the real-world Yahoo! Meme social graph, using parameters learnt from real logs of meme propagations. Our experimentation demonstrates the effectiveness and feasibility of these methods.

KW - Feed ranking

KW - Information propagation

KW - Social network analysis

UR - http://www.scopus.com/inward/record.url?scp=84879694782&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84879694782&partnerID=8YFLogxK

U2 - 10.1007/s10844-011-0181-4

DO - 10.1007/s10844-011-0181-4

M3 - Article

VL - 40

SP - 211

EP - 239

JO - Journal of Intelligent Information Systems

JF - Journal of Intelligent Information Systems

SN - 0925-9902

IS - 2

ER -