期刊名称:International Journal of Computer Science and Information Technologies
电子版ISSN:0975-9646
出版年度:2011
卷号:2
期号:3
页码:1283-1286
出版社:TechScience Publications
摘要:Collaborative filtering algorithms (CFAs) are most popular recommender systems for collaborating one another to filter the documents they read from the last decade. CFAs have several features that make them different from other algorithms. The Cl a s s i f i c a t i on accuracy is one among them. A userbased collaborative filtering algorithm is one of the filtering algorithms, known for their simplicity and efficiency. In the present paper a steady is conducted for its implementation and its efficiency in terms of prediction complexitytack.ms.
关键词:Collaborative Filtering Algorithm; Mean Absolute;Error; Prediction Complexity.