Graph-based recommendation algorithm for personalized suggestions

Singh, Rashmi; Alam, Khursheed; Bhardwaj, Neha

doi:10.47974/JDMSC-2204

Open Access Research Article

Graph-based recommendation algorithm for personalized suggestions

Rashmi Singhrsingh7@amity.eduDepartment of Mathematics Amity Institute of Applied Sciences Amity UniversityNoida, Uttar Pradesh, 201301, IndiaView full profile → , Khursheed Alamkhursheed.alam@sharda.ac.inDepartment of Mathematics Sharda School of Basic Sciences & Research Sharda UniversityNoida, Uttar Pradesh, 201310, IndiaView full profile → , ^*Neha BhardwajCorresponding authornehabhr1807@gmail.comDepartment of Mathematics Sharda School of Basic Sciences & Research Sharda UniversityNoida, Uttar Pradesh, 201310, IndiaView full profile →

* Corresponding author · click or hover a name for details

pp. 931–944Vol. 28Issue 3April 2025DOI: 10.47974/JDMSC-2204 Crossmark XML

Received:: 11 Jun 2024
Published Online:: 18 Apr 2025
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-2204
Pages:: 931–944

Abstract

In the present study, we put forward a graph-based recommendation algorithm designed to provide personalized suggestions to users. By leveraging principles from graph theory, our algorithm utilizes the inherent structure for the recommendation system. We consider user preferences and item similarities to construct a graph representation of the recommendation network. Through a combination of graph traversal and similarity analysis techniques, our algorithm identifies relevant items for each user based on their preferences and the connections between items. The personalized suggestions generated by our algorithm aim to improve the overall user experience by offering tailored recommendations that align with individual interests.We gave a case study and for the understanding of our algorithm that may also help in comparing it against existing recommendation methods. This research contributes to the field of recommendation systems by employing graph theory principles to enhance the accuracy and personalization of the recommendation process. Also, we discuss graph homomorphism and graph isomorphism protocols to create encryption methods in cryptography.

Keywords

Graph based recommendation Graph theory Graph traversal

Subject Classifications

94C1568P25

References

[1] A. Shumam Khaleel, “A Study of Graph Theory Applications in IT Security,” Iraqi Journal of Science, vol. 61, no. 10, pp. 2705–2714 (2020).
[2] K. Kuk, M. Petar, M. Spalevi, and M. Goci, “Algorithm design in python for cybersecurity,” Electrotechnical and Computer Science Conference, ERK, Slovenia (2019).
[3] A. Sheth, S. Bhosale, F. Kurupkar, and Asst. Prof., “Research paper on cyber security,” Contemporary Research, pp. 2231–2137 (2021).
[4] Y. Li, H. Voos, M. Darouach, and C. Hua, “An application of linear algebra theory in networked control systems: stochastic cyber-attacks detection approach,” IMA Journal of Mathematical Control and Information, vol. 33, no. 4, pp. 1081–1102 (2016).
[5] D. K. Saini, “Cyber Defense: Mathematical Modeling and Simulation,” International Journal of Applied Physics and Mathematics, vol. 2, no. 5, pp. 1–8 (2012).
[6] S. Pandey, “Modern Network Security: Issues and Challenges,” International Journal of Engineering Science and Technology (IJEST), vol. 3, no. 5, pp. 1–10 (2011).
[7] A. Kumar and S. Kumar Sharma, “Information cryptography using cellular automata and digital image processing,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 25, no. 4, pp. 1105–1111 (2022).
[8] M. A. Hassan and A. Chickade, “A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods,” Wireless Ad Hoc Networks and Sensor Networks, pp. 3–13 (2011).
[9] H. O. Abdullah and M. Eftekhari, “Cryptanalysis and Improvements on Some Graph-Based Authentication Schemes,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 16, no. 4-5, pp. 297–306 (2013).
[10] S. Sen and S. Samanta, “Network Security Using Graph Theory,” IJIRT, vol. 1, no. 4, pp. 223–230 (2014).
[11] N. Ghadbane, “On public key cryptosystem based on the word problem in a group,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 25, no. 6, pp. 1563–1568 (2022).
[12] R. Singh and A. K. Umrao, “On Finite Order Nearness in Soft Set Theory,” WSEAS Transactions on Mathematics, vol. 18, pp. 118–122 (2019).
[13] R. S. H. Mah, “Application of graph theory to process design and analysis,” Computers & Chemical Engineering, vol. 7, no. 6, pp. 599–612 (1983).
[14] K. Thulasiraman and M. N. S. Swamy, Graphs: Theory and Algorithms, John Wiley & Sons (2011).
[15] B. Pragathi, B. K. Karunakar Rao, L. Shanmukha Rao, and A. Kumar, “Cryptography algorithms for enhancing security in IoT based MAFLYMPPT system under partial shading conditions,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 7, pp. 1991–2003 (2024).
[16] G. N. Kannaiyan, B. Pappula, and R. Veerubommu, “RETRACTED: A Review on Graph Theory in Network and Artificial Intelligence,” Journal of Physics: Conference Series, vol. 1831, no. 1, p. 12002 (2021).
[17] C. Berge, The Theory of Graphs and Its Applications, Methuen (1963).
[18] P. Amudha, A. C. Charles Sagayaraj, and A. C. Shantha Sheela, “An application of graph theory in cryptography,” International Journal of Pure and Applied Mathematics, vol. 119, no. 13, pp. 375–383 (2018).
[19] P. A. S. D. Perera and G. S. Wijesiri, “Encryption and decryption algorithms in symmetric key cryptography using graph theory,” Psychology and Education Journal, vol. 58, no. 1, pp. 3420–3427 (2021).
[20] A. Pius and D. Kirubaharan, “An effective analysis of cryptography and importance of implementing cryptography in fuzzy graph theory,” in Proceedings of International Conference on Communication and Artificial Intelligence: ICCAI 2021, pp. 317–327, Springer (2022).
[21] M. Khare and R. Singh, “Complete α-grills and (l, n)-merotopies,” Fuzzy Sets and Systems, vol. 159, no. 5, pp. 620–628 (2008).
[22] M. Khare and R. Singh, “L-contiguities and their order structure,” Fuzzy Sets and Systems, vol. 158, no. 4, pp. 399–408 (2007).
[23] X. Chen, P. Yadav, R. Singh, and S. M. N. Islam, “ES Structure based on soft J-subset,” Mathematics, vol. 853, pp. 1–11 (2023).

Views: 147Downloads: 7Citations: 1