Facebook pixel tracking

The Science and Information (SAI) Organization publishes open-access peer-reviewed journals in computer science and artificial intelligence.

Contact Info
Website thesai.org
Follow Us
Contact Info
Follow Us
Research Article | Open Access |

Temporal-based Optimization to Solve Data Sparsity in Collaborative Filtering

Author 1: Ismail Ahmed Al-Qasem Al-Hadi Author 2: Mohammad Ahmed Alomari Author 3: Eissa M. Alshari Author 4: Waheed Ali H. M. Ghanem Author 5: Safwan M Ghaleb
International Journal of Advanced Computer Science and Applications (IJACSA) · Vol. 11, No. 12 · Published 2020 · Cited by 5

DOI: https://doi.org/10.14569/IJACSA.2020.0111262

Abstract

Collaborative Filtering (CF) is a widely used technique in recommendation systems. It provides personal recommendations for users based on their preferences. However, this technique suffers from the sparsity issue which occurs due to a high proportion of missing rating scores in a rating matrix. Several factorization approaches have been used to address the sparsity issue. Such techniques have also been considered to tackle other challenges such as the overfitted predicted scores. Nevertheless, they suffer from setbacks such as drift in user preferences and items’ popularity decay. These challenges can be solved by prediction approaches that accurately learn the long-term and short-term preferences integrated with factorization features. Nonetheless, the current temporal-based factorization approaches do not accurately learn the convergence of the assigned k clusters due to a lower number of short-term periods. Additionally, the use of optimization algorithms in the learning process to reduce prediction errors is time-consuming which necessitates a faster optimization algorithm. To address these issues, a new temporal-based approach named TWOCF is proposed in this paper. TWOCF utilizes the elbow clustering method to define the optimal number of clusters for the temporal activities of both users and items. This approach deploys the whale optimization algorithm to accurately learn short-term preferences within other factorization and temporal features. Experimental results indicate that TWOCF exhibits a superior CF prediction accuracy achieved within a shorter execution time when compared to the benchmark approaches.

Keywords

How to Cite this Article

Al-Hadi, I. A. A., Alomari, M. A., Alshari, E. M., Ghanem, W. A. H. M., & Ghaleb, S. M. (2020). Temporal-based Optimization to Solve Data Sparsity in Collaborative Filtering. International Journal of Advanced Computer Science and Applications, 11(12). https://doi.org/10.14569/IJACSA.2020.0111262

Al-Hadi, Ismail Ahmed Al-Qasem, et al.. "Temporal-based Optimization to Solve Data Sparsity in Collaborative Filtering." International Journal of Advanced Computer Science and Applications, vol. 11, no. 12, 2020, https://doi.org/10.14569/IJACSA.2020.0111262.

@article{Al-Hadi2020,
  title     = {Temporal-based Optimization to Solve Data Sparsity in Collaborative Filtering},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {11},
  number    = {12},
  year      = {2020},
  publisher = {The Science and Information Organization},
  author    = {Ismail Ahmed Al-Qasem Al-Hadi and Mohammad Ahmed Alomari and Eissa M. Alshari and Waheed Ali H. M. Ghanem and Safwan M Ghaleb},
  doi       = {10.14569/IJACSA.2020.0111262},
  url       = {https://doi.org/10.14569/IJACSA.2020.0111262}
}

Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.