Identification of key players of social graph with Kendall–Wei ranking
DOI: 10.21293/1818-0442-2018-21-1-80-85
DOI: 10.21293/1818-0442-2018-21-1-80-85
Abstract: The paper considers feasibility of Kendall-Wei ranking application to identify the subset of social network users, referred as subject matter experts. Authors have performed the comparison of the procedure under consideration with widely known distance based methods, such as information entropy assessment and Borgatti centrality measure. Based on analysis of model experiment results, authors claim that Kendall–Wei ranking matches existing methods in problem-solving capability, while having simpler software implementation.
Keywords: social graph, key players, distance-based methods, oriented graph, ranking
For citation:
Efremov A. A., Luneva E. E., Banokin P. I., Kochegurova E. A. Identification of key players of social graph with Kendall–Wei ranking. Doklady Tomskogo gosudarstvennogo universiteta sistem upravleniya i radioelektroniki, 2018, vol. 21, no. 1, pp. 80–85. DOI: 10.21293/1818-0442-2018-21-1-80-85
Authors and copyright holders:
—
Executive Secretary of the Editor’s Office
Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia
Phone / Fax: + 7 (3822) 701-582
Viktor N. Maslennikov
Executive Secretary of the Editor’s Office
Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia
Phone / Fax: + 7 (3822) 51-21-21 / 51-43-02