%0 Journal Article %1 CPE:CPE4092 %A Li, Chenyang %A He, Kejing %D 2017 %I John Wiley & Sons, Ltd %J Concurrency and Computation: Practice and Experience %K collaborative recommender social-information-access %N 10 %P n/a--n/a %R 10.1002/cpe.4092 %T CBMR: An optimized MapReduce for item-based collaborative filtering recommendation algorithm with empirical analysis %U http://dx.doi.org/10.1002/cpe.4092 %V 29 %X Item-based collaborative filtering (CF) is a model-based algorithm for making recommendations. In the algorithm, the similarity between items are calculated by using a number of similarity measures, and then these similarity values are used to predict ratings for users. However, if the number of items and users grows to millions, the scalability and the processing efficiency of item-based CF can be hindered by some hardware constraints. To solve this problem, we propose an optimized MapReduce for item-based CF algorithm integrated with empirical analysis. Through extensive experiments on real-world datasets, we demonstrate the advantages of our approach by evaluating its execution time and by comparing its shuffle phase overhead with the conventional methods. The experimental results suggest that our approach has better performance when processing large-scale datasets.

@article{CPE:CPE4092, abstract = {Item-based collaborative filtering (CF) is a model-based algorithm for making recommendations. In the algorithm, the similarity between items are calculated by using a number of similarity measures, and then these similarity values are used to predict ratings for users. However, if the number of items and users grows to millions, the scalability and the processing efficiency of item-based CF can be hindered by some hardware constraints. To solve this problem, we propose an optimized MapReduce for item-based CF algorithm integrated with empirical analysis. Through extensive experiments on real-world datasets, we demonstrate the advantages of our approach by evaluating its execution time and by comparing its shuffle phase overhead with the conventional methods. The experimental results suggest that our approach has better performance when processing large-scale datasets.}, added-at = {2017-05-15T21:52:59.000+0200}, author = {Li, Chenyang and He, Kejing}, biburl = {https://www.bibsonomy.org/bibtex/29be6b026665dc39f94b7c615532e0b49/sdjavadi}, description = {CBMR: An optimized MapReduce for item-based collaborative filtering recommendation algorithm with empirical analysis - Li - 2017 - Concurrency and Computation: Practice and Experience - Wiley Online Library}, doi = {10.1002/cpe.4092}, interhash = {b3fc8f0e7aee6c50b513f8761edf9d38}, intrahash = {9be6b026665dc39f94b7c615532e0b49}, issn = {1532-0634}, journal = {Concurrency and Computation: Practice and Experience}, keywords = {collaborative recommender social-information-access}, number = 10, pages = {n/a--n/a}, publisher = {John Wiley & Sons, Ltd}, timestamp = {2017-05-15T21:52:59.000+0200}, title = {CBMR: An optimized MapReduce for item-based collaborative filtering recommendation algorithm with empirical analysis}, url = {http://dx.doi.org/10.1002/cpe.4092}, volume = 29, year = 2017 }