Abstract
Since online electronic books have become popular, book recommendation systems have been invented and challenged to handle the high demand from users in the digital era. This study aimed to develop and evaluate a book recommendation model using data mining techniques through RapidMiner Studio. The datasets used were comprised of 981,756 user ratings. Before conducting the data analytics, the data was pre-processed to eliminate duplicates and retain only the highest ratings. Collaborative Filtering (CF) techniques, particularly k-Nearest Neighbours (k-NN) and Matrix Factorization (KF), were employed to elicit insightful information for development and to highlight their capabilities in handling enormous datasets. Furthermore, statistical analysis, visualization, elementary modelling, and model combinations were investigated to compare their performance. To reinforce creditability, modelling techniques and parameter adjustments were integrated to optimize the performance of the algorithms, since the results indicated that different model settings and data partitions impacted the effectiveness of the recommendation system. Additionally, these results demonstrated the potential of hybrid models in improving the accuracy and efficiency of recommendation systems and highlighted the trade-off between algorithmic approaches and dataset characteristics that interplay in optimizing the performance of recommendation systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Telecommunications and the Digital Economy
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.