Onto Proximality in Non Negative Matrix Factorization for Recommender Systems
Recommender Systems have become integral to most e-commerce applications and online platforms. The recommended suggestions heavily impact customer retention and business performance. One of the essential parameters in large-scale recommender systems is the time required to present a recommendation....
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10949215/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850138800990191616 |
|---|---|
| author | Rachana Mehta Shakti Mishra Snehanshu Saha |
| author_facet | Rachana Mehta Shakti Mishra Snehanshu Saha |
| author_sort | Rachana Mehta |
| collection | DOAJ |
| description | Recommender Systems have become integral to most e-commerce applications and online platforms. The recommended suggestions heavily impact customer retention and business performance. One of the essential parameters in large-scale recommender systems is the time required to present a recommendation. The more time it takes, the more it loses the customer’s attention and interest. It is currently necessary for recommenders to be time-efficient and optimal. Collaborative filtering-based Matrix Factorization approaches have proven to be powerful for recommender systems. The standard approach uses the Singular Value Decomposition-based recommender systems with Gradient Descent optimizer and its advanced variants. These models provide good accuracy for recommenders. However, they are time-intensive. To alleviate these issues, the proximal gradient descent optimizer-based Nonnegative Matrix Factorization model is adapted for recommender systems to improve their performance in terms of time and accuracy. There has been no research on integrating proximal descent models in Nonnegative matrix factorization for recommender systems. These novel adaptations are analyzed with six other baseline recommender models on two datasets. The experimental analysis proves that these novel recommender models are the preferable choice for online recommenders and work well when the data is not smooth. |
| format | Article |
| id | doaj-art-4928e0765c0f4807a890ebb78d97e85d |
| institution | OA Journals |
| issn | 2169-3536 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj-art-4928e0765c0f4807a890ebb78d97e85d2025-08-20T02:30:30ZengIEEEIEEE Access2169-35362025-01-0113674766748710.1109/ACCESS.2025.355794510949215Onto Proximality in Non Negative Matrix Factorization for Recommender SystemsRachana Mehta0https://orcid.org/0000-0001-9683-6643Shakti Mishra1Snehanshu Saha2https://orcid.org/0000-0002-8458-604XComputer Science and Engineering Department, School of Technology, Pandit Deendayal Energy University, Gandhinagar, IndiaComputer Science and Engineering Department, School of Technology, Pandit Deendayal Energy University, Gandhinagar, IndiaDepartment of Computer Science and Information Systems and APPCAIR, BITS Pilani, K.K. Birla Goa Campus, Zuarinagar, Goa, IndiaRecommender Systems have become integral to most e-commerce applications and online platforms. The recommended suggestions heavily impact customer retention and business performance. One of the essential parameters in large-scale recommender systems is the time required to present a recommendation. The more time it takes, the more it loses the customer’s attention and interest. It is currently necessary for recommenders to be time-efficient and optimal. Collaborative filtering-based Matrix Factorization approaches have proven to be powerful for recommender systems. The standard approach uses the Singular Value Decomposition-based recommender systems with Gradient Descent optimizer and its advanced variants. These models provide good accuracy for recommenders. However, they are time-intensive. To alleviate these issues, the proximal gradient descent optimizer-based Nonnegative Matrix Factorization model is adapted for recommender systems to improve their performance in terms of time and accuracy. There has been no research on integrating proximal descent models in Nonnegative matrix factorization for recommender systems. These novel adaptations are analyzed with six other baseline recommender models on two datasets. The experimental analysis proves that these novel recommender models are the preferable choice for online recommenders and work well when the data is not smooth.https://ieeexplore.ieee.org/document/10949215/Lipschitz continuitynonnegative matrix factorizationrecommender systemssingular value decompositionstochastic proximal gradient descent |
| spellingShingle | Rachana Mehta Shakti Mishra Snehanshu Saha Onto Proximality in Non Negative Matrix Factorization for Recommender Systems IEEE Access Lipschitz continuity nonnegative matrix factorization recommender systems singular value decomposition stochastic proximal gradient descent |
| title | Onto Proximality in Non Negative Matrix Factorization for Recommender Systems |
| title_full | Onto Proximality in Non Negative Matrix Factorization for Recommender Systems |
| title_fullStr | Onto Proximality in Non Negative Matrix Factorization for Recommender Systems |
| title_full_unstemmed | Onto Proximality in Non Negative Matrix Factorization for Recommender Systems |
| title_short | Onto Proximality in Non Negative Matrix Factorization for Recommender Systems |
| title_sort | onto proximality in non negative matrix factorization for recommender systems |
| topic | Lipschitz continuity nonnegative matrix factorization recommender systems singular value decomposition stochastic proximal gradient descent |
| url | https://ieeexplore.ieee.org/document/10949215/ |
| work_keys_str_mv | AT rachanamehta ontoproximalityinnonnegativematrixfactorizationforrecommendersystems AT shaktimishra ontoproximalityinnonnegativematrixfactorizationforrecommendersystems AT snehanshusaha ontoproximalityinnonnegativematrixfactorizationforrecommendersystems |