摘要：A composite collaborative filtering algorithm for personalized recommend will be presented to solve the original Collaborative Filtering algorithm problem including“None of User Starting ”and “Data Sparsity”, and the Spearman rank correlation coefficient will be used as a main correlation coefficient. Top-M commended is going to be used to get the final results in this paper. At last, we will validate that this algorithm is superior to the algorithm of collaborative filtering based on user and the algorithm of collaborative filtering based on item.
关键词：composite collaborative filtering algorithm;none of user starting;data sparsity;top-M
