Aug 2026· International Workshop on Artificial Intelligence and Cognition· pp. 238-245· 0 citations· 18 references
Abstract
The Recommendation system has now evolved to be an integral part of current e-commerce, media streaming, online learning, and social networking sites where the system recommends suitable products and content according to the past behavior of the user. Conventional collaborative filtering algorithms face issues related to sparsity of the data, scalability, and cold start problem which could adversely impact the quality of recommendations. This paper proposes an exhaustive implementation methodology using Singular Value Decomposition (SVD) in collaborative filtering, along with data pre-processing and evaluation of performance. The framework includes data cleansing, duplicates elimination, treatment of missing values, rating scaling, formation of user-item rating matrix and feature extraction to enhance the quality of the data before training the algorithm.The proposed framework is tested by using traditional recommendation system performance metrics such as RMSE (Root Mean Squared Error), MAE (Mean Absolute Error), Precision, Recall, and F1-Score. Experimental results have shown that systematic preprocessing coupled with SVD (singular value decomposition) based collaborative filtering method offers robust recommendation results while retaining efficiency. Proposed implementation framework can be used for many different recommendation domains including e-commerce, movies/media recommendations, review websites, and even learning systems among others.
A systematic, cross-domain characterisation of data processing practices for the offline evaluation of recommender systems is provided, identifying substantial heterogeneity in how auxiliary information is prepared and represented, as well as inconsistencies in the specification of data splitting protocols.
Alberto Carlo Maria Mancino, Angela Di Fazio, Danilo Danese et al.· arXiv.org· 0 citations
In order to realize personalized recommendations in university library borrowing systems, this study constructs a multi-dimensional implicit interest model based on borrowing duration, total borrowing frequency, and renewal records. To address the severe data sparsity of the user-item borrowing matrix, a hybrid collabo...
Feng-Tao Zhao· 2026 9th International Confe...· 0 citations
Most of the time, recommendation systems are evaluated using accuracy metrics like RMSE and MAE, but these accuracy values do not guarantee the generation of relevant recommendation lists for users. This study explains the difference by experiment with varied cross-paradigm comparison of User-Based Collaborative Filter...
Howard Frelindo Goh, Rakha Adinata Zavier, Alexander Christian Suryanto Linggodigdo et al.· International Conferences on...· 0 citations
Personalized recommender systems have become essential in modern e-commerce by improving product discovery and enhancing user experience. However, recommendation performance is often limited by sparse user–item interactions and cold-start scenarios, where insufficient historical data reduces personalization accuracy. T...
Nermeen Kashef, Ola Ahmed Ali, El-Sayed M. E. Mostafa et al.· Applied Sciences· 0 citations
Today, the availability of huge amounts of data over the internet and the retrieval of necessary data, e-learning content, or a movie review can result in a condition of information overload. In order to achieve some positive feedback from the users, a recommendation has to be personalized. There are hybrid recommender...
S. Rajalakshmi, G. Gurumoorthy, R. Bhuvaneswari et al.· Journal of Circuits, Systems...· 0 citations
An ensemble system that uses dynamically weighted user profiles to generate personalised recommendations under sparse rating conditions demonstrates a structured approach to combining dynamic user profiling with multiple machine-learning techniques.
T. Omodunbi, A. Amoo, G. Alilu et al.· Current Journal of Applied S...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.