Eng During last 365 days Approved articles: 2065,   Articles in work: 293 Declined articles: 786 
Library

Back to contents

Cybernetics and programming
Reference:

The generalized centrality method for analyzing network cyberspace
Gorlushkina Natalia Nikolaevna

PhD in Technical Science

Head of the Department of Intellectual Technologies in the Humanities, St. Petersburg National Research University of Information Technologies, Mechanics and Optics

197101, Russia, g. Saint Petersburg, ul. Kronverkskii Pr., 49

nagor.spb@mail.ru
Ivanov Sergei Evgenievich

PhD in Physics and Mathematics

Associate Professor, Department of Intelligent Technologies in the Humanitarian Sphere, St. Petersburg National Research University of Information Technologies, Mechanics and Optics

197101, Russia, g. Saint Petersburg, ul. Kronverkskii Pr., 49

sivanov@mail.ifmo.ru

 

 
Ivanova Lubov Nikolaevna

graduate student, Department of Theoretical and Applied Mechanics, St. Petersburg National Research University of Information Technologies, Mechanics and Optics

197101, Russia, Saint Petersburg, Kronverkskii pr., 49, aud. 203

ln2305@yandex.ru

 

 

Abstract.

The subject of the research is the methods of network cyberspace analysis based on graph models. The analysis allows to find leaders of groups and communities, to find cohesive groups and visualize the results. The main methods of the graph theory used for cyberspace social networks are the methods of analyzing the centrality to determine the relative weight or importance of the vertices of the graph. There are known methods for analyzing centralities: by degree, by proximity, by mediation, by radiality, by eccentricity, by status, eigenvector, referential ranking. The disadvantage of these methods is that they are based only on one or several properties of the network participant. Based on the centrality analysis methods, a new generalized centrality method is proposed, taking into account such participant properties as the participant's popularity, the importance and speed of information dissemination in the cyberspace network. A mathematical model of a new method of generalized centrality has been developed. Comparison of the results of the presented method with the methods of the analysis of centralities is performed. As a visual example, a subgroup of cyberspace consisting of twenty participants, represented by a graph model, is analyzed. Comparative analysis showed the accuracy of the method of generalized centrality, taking into account at once a number of factors and properties of the network participant.

Keywords: degree centrality, weights of vertices, definition of group leaders, social networks, graph model, centrality method, community analysis methods, network cyberspace, closeness centrality, betweenness centrality

DOI:

10.25136/2306-4196.2019.2.23117

Article was received:

25-05-2017


Review date:

29-05-2017


Publish date:

27-05-2019


This article written in Russian. You can find full text of article in Russian here .

References
1.
Davern M. Social Networks and Economic Sociology: A Proposed Research Agenda for a More Complete Social Science // American Journal of Economics & Sociology. 1997. Vol. 56. Is. 3. p. 287302.
2.
Charu C. Aggarwal. Social Network Data Analytics. 2011. 520 p.
3.
Fortunato S. Community Detection in Graphs // Phys. Rep. 2010. Vol.486. No. 35. p. 75174.
4.
Wasserman S., Faust K. Social Network Analysis: Methods And Applications. N. Y.: Cambridge University Press, 1994. 825 p.
5.
Jensen D., Neville J. Data Mining in Social Networks // Proceedings of the National Academy of Sciences Symposium on Dynamic Social Network Analysis. 2002. p. 289302.
6.
Bonchi F., Castillo C., Gionis A., Jaimes A. Social Network Analysis and Mining for Business Applications // ACM TIST. 2011. Vol. 2 (3). p. 2258.
7.
Leskovec J., Backstrom L., Kumar R., Tomkins A. Microscopic Evolution of Social Networks // Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. N. Y., 2008. p. 462470.
8.
Inokuchi A., Washio T. A Fast Method to Mine Frequent Subsequences from Graph Sequence Data // Proceedings of the IEEE International Conference on Data Mining. 2008. p. 303312.
9.
Tantipathananandh C., Berger-Wolf T., Kempe D. A Framework for Community Identification in Dynamic Social Networks // Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. N. Y.: ACM Press, 2007. p. 717726.
10.
Ferlez J., Faloutsos C., Leskovec J., Mladenic D., Grobelnik M. Monitoring Network Evolution Using MDL // Proceedings of the International Conference on Data Engineering. 2008. p. 13281330.
11.
Liu Z., Yu J., Ke Y., Lin X., Chen L. Spotting Significant Changing Subgraphs in Evolving Graphs // Proceedings of the 8th International Conference on Data Mining. 2008. p. 917922.
12.
Borgwardt K. M., Kriegel H.-P., Wackersreuther P. Pattern Mining in Frequent Dynamic Subgraphs // Proceedings of the IEEE International Conference on Data Mining. 2006. p. 818822.