A Generalized Fractional Program for Maximizing Content Popularity in Online Social Networks
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...