摘要： [Display omitted] ► This paper examines clustering ensembles in collaborative filtering. ► k-means and SOM clustering algorithms are used and compared. ► The ensemble methods are based on CSPA, HGAP and majority voting. ► Clustering ensembles significantly outperform single clustering techniques. Recommender systems, which recommend items of information that are likely to be of interest to the users, and filter out less favored data items, have been developed. Collaborative filtering is a widely used recommendation technique. It is based on the assumption that people who share the same preferences on some items tend to share the same preferences on other items. Clustering techniques are commonly used for collaborative filtering recommendation. While cluster ensembles have been shown to outperform many single clustering techniques in the literature, the performance of cluster ensembles for recommendation has not been fully examined. Thus, the aim of this paper is to assess the applicability of cluster ensembles to collaborative filtering recommendation. In particular, two well-known clustering techniques (self-organizing maps (SOM) and k-means), and three ensemble methods (the cluster-based similarity partitioning algorithm (CSPA), hypergraph partitioning algorithm (HGPA), and majority voting) are used. The experimental results based on the Movielens dataset show that cluster ensembles can provide better recommendation performance than single clustering techniques in terms of recommendation accuracy and precision. In addition, there are no statistically significant differences between either the three SOM ensembles or the three k-means ensembles. Either the SOM or k-means ensembles could be considered in the future as the baseline collaborative filtering technique. 出版者： Elsevier B.V 出版日期： 2012-04-01 出處： Applied soft computing, 2012-04, Vol.12 (4), p.1417-1425 版權： 2011 Elsevier B.V. 識別號： ISSN: 1568-4946 識別號： EISSN: 1872-9681 識別號： DOI: 10.1016/j.asoc.2011.11.016
