101. Predicting online news popularity based on machine learning.
- Author
-
Tsai, Min-Jen and Wu, You-Qing
- Subjects
- *
ELECTRONIC newspapers , *NEWS websites , *POPULARITY , *CLASSIFICATION algorithms , *PRINCIPAL components analysis , *RANDOM forest algorithms , *DATA distribution , *MACHINE learning - Abstract
• A UCI online news popularity dataset was utilized in this study, and the quality of the dataset was improved after using data pre-processing methods such as normalization and principal component analysis. The number of shares was transformed into a popularity or unpopularity classification problem. • The experimental results show that using a single-class classification algorithm is better than a two-class classification algorithm when the data is unbalanced. • The contribution of this paper is to modify the classification boundaries from 1400 to 50,000 in order to form imblanced data distributions and attempt to combine an Autoencoder and One-Class SVM algorithms to overcome the problem of imbalanced data. Due to its fast transmission and easy accessibility features, the Internet has replaced traditional newspapers and magazines as the main channel for delivering public news. Hence, predicting the popularity of Internet news has become an essential topic. This research is based on a UCI dataset, the primary source of which is Mashable News, one of the major blogs in the world. The number of shared articles is used as a predictor of the popularity of the news, and the four types of machine learning algorithms utilized are Random Forest, LightGBM, XGBoost, and One-Class SVM. The best prediction method is One-Class SVM with 88% accuracy. This result indicates that combining Autoencoder and One-Class algorithm will optimize the prediction while detecting anomalies within imbalanced data. One-class SVM algorithm based on an autoencoder adopted in this study outperforms other algorithms, namely Random Forest, XGBoost, and LightGBM, in the category of the accuracy, the precision, the recall, and F1 scores. [Display omitted] [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF