Scalable Collaborative Filtering Based on Splitting-Merging Clustering Algorithm

Author(s):  
Nabil Belacel ◽  
Guillaume Durand ◽  
Serge Leger ◽  
Cajetan Bouchard
Author(s):  
Xuebin Wang ◽  
Zhengzhou Zhu ◽  
Jiaqi Yu ◽  
Ruofei Zhu ◽  
DeQi Li ◽  
...  

The accuracy of learning resource recommendation is crucial to realizing precise teaching and personalized learning. We propose a novel collaborative filtering recommendation algorithm based on the student’s online learning sequential behavior to improve the accuracy of learning resources recommendation. First, we extract the student’s learning events from his/her online learning process. Then each student’s learning events are selected as the basic analysis unit to extract the feature sequential behavior sequence that represents the student’s learning behavioral characteristics. Then the extracted feature sequential behavior sequence generates the student’s feature vector. Moreover, we improve the H-[Formula: see text] clustering algorithm that clusters the students who have similar learning behavior. Finally, we recommend learning resources to the students combine similarity user clusters with the traditional collaborative filtering algorithm based on user. The experiment shows that the proposed algorithm improved the accuracy rate by 110% and recall rate by 40% compared with the traditional user-based collaborative filtering algorithm.


Author(s):  
AMIRA ABDELWAHAB ◽  
HIROO SEKIYA ◽  
IKUO MATSUBA ◽  
YASUO HORIUCHI ◽  
SHINGO KUROIWA

Collaborative filtering (CF) is one of the most prevalent recommendation techniques, providing personalized recommendations to users based on their previously expressed preferences and those of other similar users. Although CF has been widely applied in various applications, its applicability is restricted due to the data sparsity, the data inadequateness of new users and new items (cold start problem), and the growth of both the number of users and items in the database (scalability problem). In this paper, we propose an efficient iterative clustered prediction technique to transform user-item sparse matrix to a dense one and overcome the scalability problem. In this technique, spectral clustering algorithm is utilized to optimize the neighborhood selection and group the data into users' and items' clusters. Then, both clustered user-based and clustered item-based approaches are aggregated to efficiently predict the unknown ratings. Our experiments on MovieLens and book-crossing data sets indicate substantial and consistent improvements in recommendations accuracy compared to the hybrid user-based and item-based approach without clustering, hybrid approach with k-means and singular value decomposition (SVD)-based CF. Furthermore, we demonstrated the effectiveness of the proposed iterative technique and proved its performance through a varying number of iterations.


2017 ◽  
Vol 10 (2) ◽  
pp. 474-479
Author(s):  
Ankush Saklecha ◽  
Jagdish Raikwal

Clustering is well-known unsupervised learning method. In clustering a set of essentials is separated into uniform groups.K-means is one of the most popular partition based clustering algorithms in the area of research. But in the original K-means the quality of the resulting clusters mostly depends on the selection of initial centroids, so number of iterations is increase and take more time because of that it is computationally expensive. There are so many methods have been proposed for improving accuracy, performance and efficiency of the k-means clustering algorithm. This paper proposed enhanced K-Means Clustering approach in addition to Collaborative filtering approach to recommend quality content to its users. This research would help those users who have to scroll through pages of results to find important content.


2014 ◽  
Vol 513-517 ◽  
pp. 416-419 ◽  
Author(s):  
Jian Jun Li ◽  
Zheng De Zhao ◽  
Geng Geng Peng

Considering the relationship among user-to-user, service-to-service, user-to-service, This paper use clustering algorithm to cluster the data, and then re-use model which is based on the population-based recommendation, the content-based recommendation, and collaborative filtering recommendation absorb their benefits and overcome their shortcomings, This paper proposed multi-personalized recommendation service model which is based on the full understanding between interrelated users and services. It can provide users with accurate and personalized service. We verified the model through experiments and carried out the proposed recommendation model drawn feasible.


Sign in / Sign up

Export Citation Format

Share Document