A Novel K Means Biclustering Fusion Based Collaborative Recommender System

Abstract:

Collaborative Filtering (CF) examines a consumer's interests and delivers automatic and personalized suggestions for purchasing a variety of products. Sparsity, on the other hand, is one of the approach's primary flaws. This difficulty is inherent in the system due to an ever-increasing quantity of people and things. To address the problem of sparsity, many existing techniques have been given. The user-item rating matrix can only provide minimal information to estimate unknown evaluations in both user-based and item-based instances. In scarce data contexts, they are ineffective. In sparse data situations, many clustering-based methods are useless. In sparse situations, traditional similarity measurements like cosine, pearson correlation, and jaccard similarity are ineffective. Although the system is able to analyze similarity in this scenario, there is a chance that the similarity is unreliable due to insufficient information processed. As the accuracy of prediction drops, this has an impact on the performance of a recommender system. As a result, neighbourhood formation is an important phase in collaborative filtering. As a result, a neighbourhood approach that can perform well in a sparse environment is required. A K Means biclustering fusion based technique is proposed to mitigate the sparsity problem by fusing item-based CF with user-based CF. A Mean absolute difference measure is used to find a neighbouring bicluster that has a significant partial similarity with the active user's preferences, which supports the algorithm in locating quality neighbours. The quality of the neighbours improves the accuracy of your recommendations.

• Periodical: Advances in Science and Technology (Volume 124)
• Pages: 607-616
• DOI: https://doi.org/10.4028/p-510vfd
• Online since: February 2023
• Authors: S. Saravanan*, Aravind Britto, S.M. Prabin
• Keywords: Bi Clustering, Collaborative Filtering, Fusion Based, K Means, Recommendation System

References

[1] Ahmed, M., M.T. lmtiaz, and R. Khan, 2018, Movie recommendation system using clustering and pattern recognition network,, IEEE 8th Annual Computing and Communication Workshop and Conference (CCWC) IEEE.

DOI: 10.1109/ccwc.2018.8301695

[2] Al-Bakri, N.F. and S.H. Hashim, 2018, Reducing Data Sparsity in Recommender Systems,. Al-Nahrain Journal of Science, vol. 21, no.02, p.138–147.

DOI: 10.22401/jnus.21.2.20

[3] Chen, J, 2018, An Implicit Information Based Movie Recommendation Strategy,. IEEE SmartWorld, Ubiquitous intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City innovation (SmartWorld/SCALCOM/UlC/ATC/CBDCom/lOP/SCl) IEEE.

DOI: 10.1109/smartworld.2018.00098

[4] Dhruv A, 2019, Artist Recommendation System Using Hybrid Method: A Novel Approach,, Emerging Research in Computing, Information, Communication and Applications, Springer. p.527–542.

DOI: 10.1007/978-981-13-5953-8_44

[5] C. Hongliang, Q. Xiaona, 2015, The Video Recommendation System Based on DBN,, IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing, pp.1016-1021,.

DOI: 10.1109/cit/iucc/dasc/picom.2015.154

[6] Katarya, R. O.P. Verma, 2017, An effective collaborative movie recommender system with cuckoo search,, Egyptian informatics Journal, vol.18, no.02, p.105–112. https://doi.org/10.1016/j.eij.2016.10.002.

DOI: 10.1016/j.eij.2016.10.002

[7] Kluver, D., M.D. Ekstrand, J.A. Konstan, 2018, Rating-based collaborative filtering: algorithms and evaluation,, Social Information Access, Springer. p.344–390.

DOI: 10.1007/978-3-319-90092-6_10

[8] Liao, C.-L, S.-J. Lee, 2016, A clustering based approach to improving the efficiency of collaborative filtering recommendation,, Electronic Commerce Research and Applications, vol.18, p.1–9. https://doi.org/10.1016/j.elerap.2016.05.001.

DOI: 10.1016/j.elerap.2016.05.001

[9] Lin, C.-Y., L.-C. Wang, K.-H. Tsai, 2018, Hybrid real-time matrix factorization for implicit feedback recommendation systems,, IEEE Access, vol.6, p.21369–21380. https://doi.org/10.1109/ACCESS.2018.2819428.

DOI: 10.1109/access.2018.2819428

[10] Mahata, A, 2016, Intelligent movie recommender system using machine learning,, International Conference on Intelligent Human Computer Interaction. Springer.

[11] Mishra, N, 2017, Solving Sparsity Problem in Rating-Based Movie Recommendation System,, Computational Intelligence in Data Mining, Springer. p.111–117.

DOI: 10.1007/978-981-10-3874-7_11

[12] Sappadla, P., Y. Sadhwani, P. Arora, 2017, Movie Recommender System,, Search Engine Architecture, Spring.

[13] Shrivastava, R. H. Singh, 2017, K-means clustering based solution of sparsity problem in rating based movie recommendation system,. International Journal of Engineering and Management Research (IJEMR), vol.07, no.02, p.309–314.

[14] Subramaniam, R., R. Lee, T. Matsuo, 2017, Movie Master: Hybrid Movie Recommendation,, International Conference on Computational Science and Computational Intelligence (CSCl). IEEE.

DOI: 10.1109/csci.2017.56

[15] Yi, B, 2019, Deep matrix factorization with implicit feedback embedding for recommendation systems,, IEEE Transactions on industrial informatics, vol.15, no.08, p.4591–4601. https://doi.org/10.1109/TII.2019.2893714.

DOI: 10.1109/tii.2019.2893714

[16] Zhou, T., L. Chen, J. Shen, 2017 Movie Recommendation System Employing the User-Based CF in Cloud Computing,, IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC), IEEE.

DOI: 10.1109/cse-euc.2017.194