A Generalized Fractional Program for Maximizing Content Popularity in Online Social Networks

Abstract : In this paper, we consider a "generalized" fractional program in order to solve a popularity optimization problem in which a source of contents controls the topics of her contents and the rate with which posts are sent to a time line. The objective of the source is to maximize its overall popularity in an Online Social Network (OSN). We propose an efficient algorithm that converges to the optimal solution of the Popularity maximization problem.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01907060
Contributor : Eitan Altman <>
Submitted on : Sunday, October 28, 2018 - 11:45:24 AM
Last modification on : Thursday, October 17, 2019 - 12:36:59 PM
Long-term archiving on : Tuesday, January 29, 2019 - 12:14:25 PM

File

generalized-fractional-program...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01907060, version 1

Citation

Alexandre Reiffers-Masson, Yezekael Hayel, Eitan Altman, Guillaume Marrel. A Generalized Fractional Program for Maximizing Content Popularity in Online Social Networks. International Symposium on Foundations and Applications of Big Data Analytics (FAB), Aug 2018, Barcelona, Spain. ⟨hal-01907060⟩

Share

Metrics

Record views

73

Files downloads

114