Name
Abstract | ||
|---|---|---|
AbstractPredicting the popularity of web contents in online social networks is essential for many applications. However, existing works are usually under non-incremental settings. In other words, they have to rebuild models from scratch when new data occurs, which are inefficient in big data environments. It leads to an urgent need for incremental prediction, which can update previous results with new data and conduct prediction incrementally. Moreover, the promising direction of group-level popularity prediction has not been well treated, which explores fine-grained information while keeping a low cost. To this end, we identify the problem of incremental group-level popularity prediction, and propose a novel model IGPP to address it. We first predict the group-level popularity incrementally by exploiting the incremental CANDECOMP/PARAFCAC (CP) tensor decomposition algorithm. Then, to reduce the cumulative error by incremental prediction, we propose three strategies to restart the CP decomposition. To the best of our knowledge, this is the first work that identifies and solves the problem of incremental group-level popularity prediction. Extensive experimental results show significant improvements of the IGPP method over other works both in the prediction accuracy and the efficiency. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1145/3461839 | ACM Transactions on Internet Technology |
Keywords | DocType | Volume |
Group level, incremental approach, information diffusion, online social networks, popularity prediction, tensor analysis | Journal | 22 |
Issue | ISSN | Citations |
1 | 1533-5399 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jingjing Wang | 1 | 1 | 1.36 |
| Wenjun Jiang | 2 | 356 | 24.25 |
| Kenli Li | 3 | 1389 | 124.28 |
| Guojun Wang | 4 | 0 | 0.34 |
| Keqin Li | 5 | 0 | 0.34 |