TSL:predicting popularity of Facebook content based on tie strength
The rapid development of online social networks leads to an explosion of information,however,there are great differences in the popularity of different messages,and accurate prediction is always a great difficulty is the current study.Popularity prediction of online content aims to predict the popul...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2019-10-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2019207/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The rapid development of online social networks leads to an explosion of information,however,there are great differences in the popularity of different messages,and accurate prediction is always a great difficulty is the current study.Popularity prediction of online content aims to predict the popularity in the future based on its early diffusion status.Existing models for popularity prediction were mostly based on discovering network features or fitting the equation into a varying time function that the accuracy of current popularity prediction model was not high enough.Therefore,with the help of the weak ties theory in sociology,the concept of tie strength was introduced and a multilinear regression equation was constructed combined with the early popularity.A TSL model to predict the popularity of Facebook’s well-known pages was proposed.The main contribution of this article was to solve the problem and few or no work based on sociology.A high linear correlation between the proportion of faithful fans was existed in Facebook homepage with frequent shares in the early and the future popularity.Compared with other baseline models,an experimental study of Facebook (including 1.54 million shares) illustrates the effectiveness of the proposed TSL model,and the performance is better than the existing similar methods. |
|---|---|
| ISSN: | 1000-436X |