TARU PUBLICATIONS
Journal of Information and Optimization Sciences cover
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0103·ISSN (Print): 0252-2667

WoS  JIF 2026 : 0.4 (Q4)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research on topics in information and optimization sciences.

Issues up to 2022 co-published with and available at:Taylor & Francis
submissions@tarupublications.com
Open Access Research Article

Bi-clustering based recommendation system

* , ,

* Corresponding author · click or hover a name for details

pp. 1029–1039Vol. 45Issue 4May 2024DOI: 10.47974/JIOS-1625XML
Published Online:
08 Jun 2024
Article type:
Research Article
Language:
EN
Article no.:
JIOS-1625
Pages:
1029–1039

Abstract

Users in the new age have countless choices of movies to watch, which creates the need for recommendation algorithms that will suggest a list of the best movies. The Recommendation algorithms will help users select the best movie to watch based on their personal choices and movie features. The first challenge among researchers is to find the most suitable dataset for the evaluation of recommendation algorithm performance. The work in the paper introduced a new MFRISE dataset to fulfil this challenge partially. The dataset is constructed using social data like Wikipedia, YouTube and other web sources with the help of web scraping data.  The proposed algorithm uses Collaborative as well as Content-Based Filtering to produce more accurate results. This architecture is based on the biclustering technique to improve the accuracy of the predicted ratings for better recommendations. The biclustering method involves simultaneous clustering of the user, as well as movie dimensions. The biclustering method will uncover the hidden insights from the intersection of two clusters. The method has produced more relevant recommendations by reducing error values in the prediction of user ratings. The RMSE for the new algorithm is observed as 0.83, which is better than that of many popular algorithms. The paper presents several experiments for analysing the proposed bi-clustering method using meta-features of the new proposed dataset. The future development of the biclustering method is suggested at the end of our paper.

Keywords

Subject Classifications

Primary 68T99

References

[1] Mali, Mahesh, Dhirendra S. Mishra, and M. Vijayalaxmi. “Multifaceted recommender systems methods: A review.” Journal of Statistics and Management Systems 23.2 : 349-361 (2020).
[2] Chhikara, Monika & Malik, Sanjay Kumar (2023). A recommendation system for an online social semantic network using knowledge-based, content-based and collaborative filtering, Journal of Information and Optimization Sciences, 44:4, 795–806, DOI: 10.47974/JIOS-1356Mehta Y., Singhania A., Tyagi A., Shrivastava P., Mali M. (2020) 
[3] Abdulhussein, Niran A. & Obaid, Ahmed J. A landscape view of news recommendation systems based on MIND dataset, Journal of Discrete Mathematical Sciences and Cryptography, 26:6, 1705–1716 (2023).
[4] Mehta Y., Singhania A., Tyagi A., Shrivastava P., Mali M. A Comparative Study of Recommender Systems. In: Kumar A., Paprzycki M., Gunjan V. (eds) ICDSMLA 2019. Lecture Notes in Electrical Engineering, vol 601. Springer, Singapore (2020).
[5] F. Maxwell Harper and Joseph A. Konstan. 2015. The MovieLens Datasets: History and Context. A.C.M. Trans. Interact. Intell. Syst. 5, 4, Article 19 (January 2016), 19 pages. https://doi.org/10.1145/2827872
[6] F.O. Isinkaye, Y.O. Folajimi, B.A. Ojokoh, Recommendation systems: Principles, methods and evaluation, Egyptian Informatics Journal, Volume 16, Issue 3, Pages 261-273, ISSN 1110-8665, (2015).
[7] Mali, Mahesh, Dhirendra Mishra, and M. Vijayalaxmi. “Benchmarking For Recommender System (MFRISE).” 3C TIC. Cuadernos de desarrollo aplicados a las TIC, 11(2), 146-156. ISSN: 2254-6529
[8] Ricci, Francesco, Lior Rokach, and Bracha Shapira. “Recommender systems: introduction and challenges.” Recommender systems handbook. Springer, Boston, MA, 1-34 (2015).
[9] Fayyaz, Zeshan, et al. “Recommendation systems: Algorithms, challenges, metrics, and business opportunities.” Applied Sciences 10.21 : 7748 (2020). 
[10] Hug, Nicolas. “Surprise: A Python library for recommender systems.” Journal of Open Source Software 5.52 : 2174 (2020). 
[11] Ahuja, Rishabh, Arun Solanki, and Anand Nayyar. “Movie recommender system using k-means clustering and k-nearest neighbor.” 2019 9th International Conference on Cloud Computing, IEEE (2019). 
[12] Mehta, Rachana, and Keyur Rana. “A review on matrix factorisation techniques in recommender systems.” 2017 2nd International Conference on Communication Systems, Computing and I.T. Applications (CSCITA). IEEE (2017).

Views: 221Downloads: 72Citations: 0