|
Fundamentalnaya i Prikladnaya Matematika, 2016, Volume 21, Issue 3, Pages 131–139
(Mi fpm1738)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Detection of communities in graph of interactive objects
M. I. Kolomeychenkoa, I. V. Polyakovb, A. A. Chepovskiyb, A. M. Chepovskiyb a Federal Research Center "Computer Science and Control" of Russian Academy of Sciences, Moscow
b National Research University "Higher School of Economics" (HSE), Moscow
Abstract:
This article describes the problem of analysis of social network graphs and other interacting objects. It also presents community detection algorithms in social networks, their classification and analysis. In addition, it considers applicability of algorithms for real tasks in social network graph analysis.
Citation:
M. I. Kolomeychenko, I. V. Polyakov, A. A. Chepovskiy, A. M. Chepovskiy, “Detection of communities in graph of interactive objects”, Fundam. Prikl. Mat., 21:3 (2016), 131–139; J. Math. Sci., 237:3 (2019), 426–431
Linking options:
https://www.mathnet.ru/eng/fpm1738 https://www.mathnet.ru/eng/fpm/v21/i3/p131
|
Statistics & downloads: |
Abstract page: | 327 | Full-text PDF : | 251 | References: | 48 |
|