|
This article is cited in 2 scientific papers (total in 2 papers)
Applied mathematics
Cooperative game theory methods for text ranking
V. V. Mazalovab, V. A. Khitrayaab, A. V. Khitryia a Federal Research Center ``Karelian Research Center
of the Russian Academy of Sciences’’, 11, Pushkinskaya ul., Petrozavodsk,
185910, Russian Federation
b Petrozavodsk State University, 33, ul. Lenina, Petrozavodsk,
185910, Russian Federation
Abstract:
A method of ranking the corpus of texts of a news portal, based on measures of graph centrality, is proposed. Each text is assigned a vertex of a certain graph, and its structure is determined based on the semantic connectivity of the texts. As a measure of centrality, the Myerson value is used in a cooperative game on a graph, where the number of simple paths in a subgraph of a certain length m is chosen as a characteristic function For different values of m, the ranking based on the Myerson value will be different. For the final ranking, it is proposed to use the ranking procedure based on the tournament matrix. The operation of the ranking algorithm is illustrated by numerical examples related to a specific news porta.
Keywords:
text corpus of news, graph, centrality measure, Myerson value, tournament matrix, ranking procedure.
Received: August 21, 2021 Accepted: February 1, 2022
Citation:
V. V. Mazalov, V. A. Khitraya, A. V. Khitryi, “Cooperative game theory methods for text ranking”, Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 18:1 (2022), 63–78
Linking options:
https://www.mathnet.ru/eng/vspui515 https://www.mathnet.ru/eng/vspui/v18/i1/p63
|
Statistics & downloads: |
Abstract page: | 150 | Full-text PDF : | 27 | References: | 39 | First page: | 4 |
|