Telegram Messenger Data Import Models
https://doi.org/10.25205/1818-7900-2022-20-2-60-71
Abstract
In this paper, an algorithm to import data from the messenger Telegram and to build weighted graphs of interacting objects is described. To import data, the given Telegram-channels are taken as a basis. Then, channels which had any of the recorded three interactions with previous ones are iteractively revealed: common external links, mentions of each other, reposts. Further, the algorithm focuses on the given configuration and uses it to calculate the weights on the edges of the resulting graph. The configuration takes into account the type of interaction of channels with each other. The authors introduce the concept of (U, M, R)-model of information interaction. The authors describe the developed algorithm and implemented software for constructing weighted graphs. The paper shows the example of weighted graph of interacting objects that was built by the described algorithm according to the (U, M, R)-model.
About the Authors
V. A. PopovRussian Federation
Popov A. Vladimir, master’s student, National Research University Higher School of Economics
Moscow
A. A. Chepovskiy
Russian Federation
Alexander A. Chepovskiy – Ph.D. (mathematics), Associate Professor
Moscow
References
1. Leschyov D. A., Suchkov D. V., Khaykova S. P., Chepovskiy A. A. Algorithms to reveal communication groups // Voprosy kiberbezopasnosti. 2019. 32(4). P. 61–71. (in Russ.). DOI 10.21681/2311-3456-2019-4-61-71.
2. Sokolova T. V., Chepovskij A. A. Analiz profilej soobshhestv social`ny`x setej // Sistemy` vy`sokoj dostupnosti. 2018. T. 14, № 3. P. 82–86. (in Russ.)
3. Kolomejchenko M. I., PolyakovI. V., Chepovskij A. A., Chepovskij A. M. Vy`delenie soobshhestv v grafe vzaimodejstvuyushhix ob``ektov // Fundamental`naya i prikladnaya matematika. 2016. Vol. 21. №3. P. 131–139. (in Russ.)
4. Roth M., Ben-David A., Deutscher D. Suggesting Friends Using the Implicit Social Graph – KDD’10, July 25–28, 2010, Washington, DC, USA., 2010.
5. Girvan M., Newman M. Community structure in social and biological networks. Proceedings of the National Academy of Sciences. 2002. Vol. 99. No 12. P. 7821–7826.
6. Blondel V. D., Guillaume J. L., Lambiotte R., Lefebvre E. Fast unfolding of communities in large networks // Journal of Statistical Mechanics: Theory and Experiment. 2008. No 10. P10008. 12 p.
7. Rosvall. M. The map equation / M. Rosvall, D. Axelsson, C. T. Bergstrom // The European Physical Journal Special Topics. – 2009.
8. Chepovskiy A. A., Leshchev D. A., Khaykova S. P. Core Method for Community Detection, in: Complex Networks & Their Applications IX. Volume 1: Proceedings of the Ninth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2020. Springer, 2021. P. 38–50. DOI 10.1007/978-3-030-65347-7_4.
9. Popov V. A., Chepovskiy A. A. Twitter Data Import Models // Vestnik NSU. Series: Information Technologies. 2021. Vol. 19. No. 2. P. 76–91. (in Russ.). DOI 10.25205/1818-7900-2021-19-276-91.
10. Building graph for Telegram chats, channels and their neighbors. URL: https://ntwrk.today/2020/04/09/building-telegram-graph.html.
11. Tikhomirova K., Makarov I. Community Detection Based on the Nodes Role in a Network: The Telegram Platform Case, in: 9th International Conference, AIST 2020, Skolkovo, Moscow, Russia, October 15–16, 2020, Revised Selected Papers.
12. TGStat. URL: https://tgstat.ru/.
13. Telegram API. URL: https://core.telegram.org/api.
14. Python Telethon. URL: https://docs.telethon.dev/en/stable/.
15. Mitchell R. Web Scraping with Python. Sebastopol: O’Reilly Media, 2015.
16. Python Beautiful Soup. URL: https://www.crummy.com/software/BeautifulSoup/.
17. Que X., Checconi F., Petrini F., Gunnels J. Scalable Community Detection with the Louvain Algorithm // 29th IEEE International Parallel & Distributed Processing Symposium, May 25–29, 2015.
Review
For citations:
Popov V.A., Chepovskiy A.A. Telegram Messenger Data Import Models. Vestnik NSU. Series: Information Technologies. 2022;20(2):60-71. (In Russ.) https://doi.org/10.25205/1818-7900-2022-20-2-60-71