The dynamic competitive recommendation algorithm in social network services

摘要

As the number of Twitter users exceeds 175 million and the scale of social network increases, it is facing with a challenge to how to help people find right people and information conveniently. For this purpose, current social network services are adopting personalized recommender systems. Existing recommendation algorithms largely depend on one of content-based algorithm, collaborative filtering, or influential ranking analysis. However, these algorithms tend to suffer from the performance fluctuation phenomenon in common whenever an active user changes, and it is due to the diversities of personal characteristics such as the local social graph size, the number of followers, or sparsity of profile content. To overcome this limitation and to provide consistent and stable recommendation in social networks, this study proposes the dynamic competitive recommendation algorithm based on the competition of multiple component algorithms. This study shows that it outperforms previous approaches through performance evaluation on actual Twitter dataset.