A METHOD OF COMPUTER SIMULATION MODELING OF USER AND BOT BEHAVIOR IN A RECOMMENDATION SYSTEM USING THE GRAPH DATABASE NEO4J
DOI:
https://doi.org/10.30837/ITSSI.2021.17.023Keywords:
recommendation systems, computer modeling, simulation modeling, complex networks, social networks, social graph, bot network, profile-injection attacks, websites, databasesAbstract
The subject matter of the article is the process of computer simulation modeling of complex networks. The goal is to develop a method of computer simulation modeling of ordinary user and bot behavior in a recommendation system based on the theory of complex networks to test the accuracy and robustness of various algorithms for generating recommendations. The tasks to be solved are: to develop a computer simulation model of user and bot behavior in a recommendation system with the ability to generate datasets for testing recommendation generation algorithms. The methods used are: graph theory, theory of complex networks, statistics theory, probability theory, methods of object-oriented programming and methods of working with graph databases. Results. A method of computer simulation modeling of users and objects in a recommender system was proposed, which consists of generating the structure of the social graph of a recommender system and simulating user and bot behavior in it. A series of experiments to test the performance of the developed computer simulation model was carried out. During the experiments, working and testing datasets were generated. Based on the working datasets, the preferences of users by the method of collaborative filtering were predicted. Based on testing datasets, the accuracy of prediction predictions was checked. The results of the experiments showed that the jitter of the investigated values of the Precision, Recall and RMSE of prediction predictions in most practical cases confidently fits within the allowable fluctuation limits, and therefore the users' behavior in computer simulation model was not random and it real users' behavior with certain preferences was simulated. This confirms the reliability of the developed computer simulation model of a recommendation system. Conclusions. A method of computer simulation modeling of user and bot behavior in a recommendation system, which allows generating datasets for testing the algorithms for generating recommendations, was proposed. The developed method makes it possible to simulate the behavior of both ordinary users and bots, which makes it possible to create datasets for testing the robustness of recommender systems to information attacks, as well as for testing the effectiveness of methods for detecting and neutralizing botnets. The structure of relations between users and objects of the recommender system was modeled using the theory of complex networks. Information attacks of bots were modeled on the basis of known models of profile-injection attacks on recommender systems.
References
Segaran, Т. (2011), Programming Collective Intelligence, Translated from English, Saint Petersburg : Symbol-Plus, 368 p.
Hogan, B. (2012), "Analysis of social networks on the Internet", PostNauka website about modern fundamental science and scientists, available at : https://postnauka.ru/longreads/20259
Meleshko, Ye. V., Okhotnyi, S. M., Bosko, V. V. (2019), "Development of software for collecting and analyzing data from social networks", Collection of abstracts of the IX International scientific-practical conference "Integrated quality assurance of technological processes and systems", Vol. 2, Chernihiv, May 14-16, 2019, Chernihiv : ChNTU, P. 225–226.
Meleshko, Ye. V., Semenov, S. H., Khokh, V. D. (2018), "Research of methods of construction of recommendation systems on the Internet", Collection of scientific works "Control, navigation and communication systems", Issue 1 (47), Poltava : PNTU, P. 131–136.
"The Selenium Browser Automation Project" (2021), available at : https://www.selenium.dev/documentation/
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E. (2000), "Stochastic models for the web graph", Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS ‘00). IEEE Computer Society, Redondo Beach, CA, USA, P. 57–65. DOI: https://doi.org/10.1109/SFCS.2000.892065
Traag, V. А. (2014), "Algorithms and Dynamical Models for Communities and Reputation in Social Networks", Springer International Publishing, P. 229. DOI: https://doi.org/10.1007/978-3-319-06391-1
Li, Q. L. (2016), "Nonlinear Markov processes in big networks", Special Matrices, Vol. 4 (1), P. 202–217.
Rajgorodskij, A. M. (2012), "Mathematical models of the Internet", Jornal "Kvant", No. 4, P. 12–16, available at : https://elementy.ru/nauchno-populyarnaya_biblioteka/431792
Rajgorodskij, A. M. (2010), "Random graph models and their applications", Proceedings Moscow Institute of Physics and Technology, Vol. 2, No. 4, P. 130–140.
Suslova, V. A., Gorodov, A. A. (2015), "Methods for modeling social networks", Reshetnev readings, No. 2 (19), P. 133–134, available at : http://cyberleninka.ru/article/n/metody-modelirovaniya-sotsialnyh-setey
Gubanov, D. A., Novikov, D. A., Chhartishvili, A. G. (2009), "Influence models on social networks", Management of big systems, No. 27, P. 205–281, available at : http://cyberleninka.ru/article/n/modeli-vliyaniya-v-sotsialnyh-setyah
Gubanov, D. A., Novikov, D. A., Chhartishvili, A. G. (2010), Social networks: models of information influence, control and confrontation, Physics and Mathematics Literature Publishing House, 228 p.
Melikov, S., Musatov, D., Savvateev, A. (2013), "Social networks’ modeling", available at : https://kpfu.ru/docs/F117464271/MMS_socnet_cities.pdf
Barabási, A.-L. (2018), Network science, Cambridge University Press, 475 p., available at : http://networksciencebook.com/
Albert, R., Barabási, A.-L. (2002), "Statistical mechanics of complex networks", Reviews of Modern Physics, Vol. 74, P. 47–97. DOI: 10.1103/RevModPhys.74.47
Evin, I. A. (2010), "Introduction to the theory of complex networks", Computer Research and Modeling, Vol. 2, No. 2, P. 121–141.
Lande, D. V., Snarskij, A. A., Bezsudnov, I. V. (2009), Internetics: Navigation in complex networks: models and algorithms, Moscow : Librokom (Editorial URSS), 264 p., available at : http://dwl.kiev.ua/art/internetica/
Pasichnyk, V. V., Ivanushchak, N. M. (2010), "Research and modeling of complex networks", Eastern European Journal of Advanced Technology, Vol. 2, No. 3 (44), P. 43–48.
Snarskij, A. A., Lande, D. V. (2015), Modeling complex networks: a tutorial, Kyiv : Engineering, 212 p., available at : http://dwl.kiev.ua/art/mss/
Barabási, L.-A., Albert, R., Jeong, H. (2000), "Scale-free characteristics of random networks: the topology of the world-wide web", Physica, A281, P. 69–77.
Haidai, B., Artiukh, R., Malyeyeva, O. (2018), "Analysis and modelling the preferences of social networks users", Innovative Technologies and Scientific Solutions for Industries, No. 1 (3), P. 5–12. DOI: https://doi.org/10.30837/2522-9818.2018.3.005
Watts, D. J., Strogatz, S. H. (1998), "Collective dynamics of "small-world" networks", Nature, Vol. 393 (6684), P. 440–442, available at : https://www.nature.com/articles/30918
Gusarova, N. F. (2016), Analysis of social networks. Basic concepts and metrics, Saint Petersburg : ITMO University, 67 p.
Barabási, A.-L., Albert, R. (1999), "Emergence of scaling in random networks", Science, Vol. 286, No. 5439, P. 509–512. DOI: https://doi.org/10.1126/science.286.5439.509
Bernovskij, M. M., Kuzjurin, N. N. (2012), "Random graphs, models and generators of scaleless graphs", Proceedings of the Institute for System Programming of the Russian Academy of Sciences, Vol. 22, P. 419–432, available at : https://cyberleninka.ru/article/n/sluchaynye-grafy-modeli-i-generatory-bezmasshtabnyh-grafov
Erdös, P., Rényi, A. (1960), "On the evolution of random graphs", Publication of the Mathematical Institute of the Hungarian Academy of Sciences, Vol. 5, P. 17–61.
Bollobás, B., Borgs, C., Chayes, T., Riordan, O. M. (2003), "Directed scale-free graphs", Proceeding SODA ‘03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, P. 132–139.
Bollobás, B., Riordan, O. (2003), "Mathematical results on scale-free random graphs", Handbook of graphs and networks, Weinheim : Wiley-VCH, P. 1–34.
Meleshko, Ye. (2019), "Computer model of virtual social network with recommendation system", Innovative technologies and scientific solutions for industries, No. 2 (8), P. 80–85. DOI: https://doi.org/10.30837/2522-9818.2019.8.080
"Neo4j Documentation" (2021), Official website of the graph database Neo4j, available at : https://neo4j.com/docs/
Harper, F. M., Konstan, J. A. (2015), "The MovieLens Datasets: History and Context", ACM Transactions on Interactive Intelligent Systems (TiiS), 19 p. DOI: https://doi.org/10.1145/2827872
Chirita, P. A., Nejdl, W., Zamfir, C. (2005), "Preventing shilling attacks in online recommender systems", In Proceedings of the ACM Workshop on Web Information and Data Management, P. 67–74.
Gunes, I., Kaleli, C., Bilge, A., Polat, H. (2014), "Shilling attacks against recommender systems: a comprehensive survey", Artificial Intelligence Review, Vol. 42, P. 767–799. DOI: https://doi.org/10.1007/s10462-012-9364-9
Mobasher, B., Burke, R., Bhaumik, R.,Williams, C. (2007), "Toward trustworthy recommender systems: An analysis of attack models and algorithm robustness", ACM Transactions on Internet Technology, Vol. 7 (4), P. 41. DOI: https://doi.org/10.1145/1278366.1278372
O’Mahony, M. P., Hurley, N. J., Silvestre, G. C. M. (2002), "Promoting recommendations: An attack on collaborative filtering" DEXA, Lecture Notes in Computer Science, Vol. 2453, P. 494–503.
Ricci, F., Rokach, L., Shapira, B., Kantor, P. B. (Editors) (2011), Recommender Systems Handbook, Boston : Springer, 842 p. DOI: https://doi.org/10.1007/978-0-387-85820-3
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Our journal abides by the Creative Commons copyright rights and permissions for open access journals.
Authors who publish with this journal agree to the following terms:
Authors hold the copyright without restrictions and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (CC BY-NC-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-commercial and non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
Authors are permitted and encouraged to post their published work online (e.g., in institutional repositories or on their website) as it can lead to productive exchanges, as well as earlier and greater citation of published work.
