Recommendation Systems Using Event-Based Temporal Data Model
Keywords:
Recommendation systems include dynamic recommender systems, time series analysis, algorithmsAbstract
Despite challenges like concept drifts, or temporal dynamics in RS, RS has grown in popularity due to its usefulness in meeting customers' needs by helping them find things they might like based on past purchases and interests. Despite their great effectiveness in generating recommendations, conventional RS techniques fall short when it comes to providing accurate ideas due to problems with concept drift. The development of temporal models to account for concept drifts and guarantee more accurate recommendations has been the focus of a lot of research in the wake of these issues, giving rise to dynamic recommender systems (DRSs). However, the bulk of the effort needed to address the drift of interest is put in developing long-term and short-term models for users. It is not possible to dynamically track users' changing interests. We express doubts in this position paper about the practice of computing evaluation metrics for recommender systems as single numbers since these values only represent average effectiveness over a very long time period (for example, a year or longer). This approach only provides a vague, unchanging picture of the facts. To better understand the performance of recommender systems, we propose that researchers compute metrics across time series such as weeks or months and present the results visually, using a line chart, for instance. Insightful forecasts about an algorithm's future performance can be made with the use of results that show how an algorithm's effectiveness evolves over time. As a result, we'll be able to make more informed selections about which algorithms to utilize in a recommender system by collecting more data on an algorithm's performance over time, spotting trends, and developing more accurate forecasts about an algorithm's future performance.
Downloads
References
Casillo, M.; Gupta, B.B.; Lombardi, M.; Lorusso, A.; Santaniello, D.; Valentino, C. Context Aware Recommender Systems: A Novel Approach Based on Matrix Factorization and Contextual Bias. Electronics 2022, 11, 1003.
Shanmugasundar, G.; Fegade, V.; Mahdal, M.; Kalita, K. Optimization of Variable Stiffness Joint in Robot Manipulator Using a Novel NSWOA-MARCOS Approach. Processes 2022, 10, 1074.
Kalita, K.; Ghadai, R.K. Optimization of Plasma Enhanced Chemical Vapor Deposition Process Parameters for Hardness improvement of Diamond Like Carbon Coatings. Sci. Iran. 2022.
Kalita, K.; Ghadai, R.K.; Chakraborty, S. Parametric optimization of CVD process for DLC Thin film coatings: A comparative analysis. S¯adhan¯a 2022, 47, 57.
Kalita, K.; Ghadai, R.K.; Bansod, A. Sensitivity Analysis of GFRP Composite Drilling Parameters and Genetic Algorithm-Based Optimisation. Int. J. Appl. Metaheuristic Comput. 2022, 13, 1–17.
60. Shankar, R.; Ganesh, N.; Cˇ ep, R.; Narayanan, R.C.; Pal, S.; Kalita, K. Hybridized Particle Swarm—Gravitational Search Algorithm for Process Optimization. Processes 2022, 10, 616.
61. Rajendran, S.; Ganesh, N.; Cˇ ep, R.; Narayanan, R.C.; Pal, S.; Kalita, K. A Conceptual Comparison of Six Nature-Inspired Metaheuristic Algorithms in Process Optimization. Processes 2022, 10, 197.
62. Kalita, K.; Pal, S.; Haldar, S.; Chakraborty, S. A Hybrid TOPSIS-PR-GWO Approach for Multi-objective Process Parameter Optimization. Process Integr. Optim. Sustain. 2022, 1–16.
63. Joshi, M.; Ghadai, R.K.; Madhu, S.; Kalita, K.; Gao, X.-Z. Comparison of NSGA-II, MOALO and MODA for Multi-Objective Optimization of Micro-Machining Processes. Materials 2021, 14, 5109.
64. Pal, S.; Kalita, K.; Haldar, S. Genetic Algorithm-Based Fundamental Frequency Optimization of Laminated Composite Shells Carrying Distributed Mass. J. Inst. Eng. Ser. C 2022, 103, 389–401.
33. Ge, Y.; Zhao, S.; Zhou, H.; Pei, C.; Sun, F.; Ou, W.; Zhang, Y. Understanding echo chambers in e-commerce recommender systems. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, Xi’an, China, 25–30 July 2020.
Himeur, Y.; Sayed, A.; Alsalemi, A.; Bensaali, F.; Amira, A.; Varlamis, I.; Eirinaki, M.; Sardianos, C.; Dimitrakopoulos, G. Blockchain-based recommender systems: Applications, challenges and future opportunities. Comput. Sci. Rev. 2022, 43, 100439.
Singh, M. Scalability and sparsity issues in recommender datasets: A survey. Knowl. Inf. Syst. 2018, 62, 1–43.
Vellaichamy, V.; Kalimuthu, V. Hybrid Collaborative Movie Recommender System Using Clustering and Bat Optimization. Int. J. Intell. Eng. Syst. 2017, 10, 38–47.
Wang, Q.; Ma, Y.; Zhao, K.; Tian, Y. A Comprehensive Survey of Loss Functions in Machine Learning. Ann. Data Sci. 2020, 9, 187–212.
Farashah, M.V.; Etebarian, A.; Azmi, R.; Dastjerdi, R.E. A hybrid recommender system based-on link prediction for movie baskets analysis. J. Big Data 2021, 8, 32.
Ortega, F.; Mayor, J.; López-Fernández, D.; Lara-Cabrera, R. CF4J 2.0: Adapting Collaborative Filtering for Java to new challenges of collaborative filtering based recommender systems. Knowl. Based Syst. 2020, 215, 106629.
Al-Bakri, N.F.; Hashim, S.H. Reducing Data Sparsity in Recommender Systems. Al-Nahrain J. Sci. 2018, 21, 138–147.
Shen, J.; Zhou, T.; Chen, L. Collaborative filtering-based recommendation system for big data. Int. J. Comput. Sci. Eng. 2020, 21, 219–225.
Kalita, K.; Dey, P.; Joshi, M.; Haldar, S. A response surface modelling approach for multi-objective optimization of composite plates. Steel Compos. Struct. 2019, 32, 455–466.
Katarya, R.; Verma, O.P. An effective collaborative movie recommender system with cuckoo search. Egypt. Inform. J. 2017, 18, 105–112.
Kumar, B.; Sharma, N. Approaches, Issues and Challenges in Recommender Systems: A Systematic Review. Indian J. Sci. Technol. 2016, 9, 1–12.
Colomo-Palacios, R.; García-Peñalvo, F.J.; Stantchev, V.; Misra, S. Towards a social and context-aware mobile recommendation system for tourism. Pervasive Mob. Comput. 2017, 38, 505–515.
Alyari, F.; Navimipour, N.J. Recommender systems: A systematic review of the state of the art literature and suggestions for future research. Kybernetes 2018, 47, 985.
Caro-Martinez, M.; Jimenez-Diaz, G.; Recio-Garcia, J.A. A theoretical model of explanations in recommender systems. In Proceedings of the ICCBR, Stockholm, Sweden, 9–12 July 2018.
Gupta, S. A Literature Review on Recommendation Systems. Int. Res. J. Eng. Technol. 2020, 7, 3600–3605.
Abdulla, G.M.; Borar, S. Size recommendation system for fashion e-commerce. In Proceedings of the KDD Workshop on Machine Learning Meets Fashion, Halifax, NS, Canada, 14 August 2017.
Aggarwal, C.C. An Introduction to Recommender Systems. In Recommender Systems; Springer: Berlin/Heidelberg, Germany, 2016; pp. 1–28.
Jóhann, Þorvaldsson, Koskinen, P., Meer, P. van der, Steiner, M., & Keller, T. Improving Graduation Rates in Engineering Programs Using Machine Learning. Kuwait Journal of Machine Learning, 1(1). Retrieved from http://kuwaitjournals.com/index.php/kjml/article/view/110
Chaudhury, S., Dhabliya, D., Madan, S., Chakrabarti, S. Blockchain technology: A global provider of digital technology and services (2023) Building Secure Business Models Through Blockchain Technology: Tactics, Methods, Limitations, and Performance, pp. 168-193.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.