A Fast Recommendation Algorithm for Social Tagging Systems : A Delicious Case
arXiv:1512.08325 · doi:10.1016/j.physa.2017.04.131
Abstract
The tripartite graph is one of the commonest topological structures in social tagging systems such as Delicious, which has three types of nodes (i.e., users, URLs and tags). Traditional recommender systems developed based on collaborative filtering for the social tagging systems bring very high demands on CPU time cost. In this paper, to overcome this drawback, we propose a novel approach that extracts non-overlapping user clusters and corresponding overlapping item clusters simultaneously through coarse clustering to accelerate the user-based collaborative filtering and develop a fast recommendation algorithm for the social tagging systems. The experimental results show that the proposed approach is able to dramatically reduce the processing time cost greater than and relatively enhance the accuracy in comparison with the ordinary user-based collaborative filtering algorithm.
arXiv comment20 pages, 7 figures
References in corpus (13)
- How to project a bipartite network?
- Recommender Systems
- Solving the apparent diversity-accuracy dilemma of recommender systems
- Heat Conduction Process on Community Networks as a Recommendation Model
- Personalized Recommendation via Integrated Diffusion on User-Item-Tag Tripartite Graphs
- Tag-Aware Recommender Systems: A State-of-the-art Survey
- Information filtering via biased heat conduction
- Collaborative filtering with diffusion-based similarity on tripartite graphs
- Solving the accuracy-diversity dilemma via directed random walks
- Information Filtering via Collaborative User Clustering Modeling
- An improved HeatS+ProbS hybrid recommendation algorithm based on heterogeneous initial resource configurations
- Personalized recommendation with corrected similarity
- Ultra accurate collaborative information filtering via directed user similarity