<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">ntv</journal-id><journal-title-group><journal-title xml:lang="ru">Научно-технический вестник информационных технологий, механики и оптики</journal-title><trans-title-group xml:lang="en"><trans-title>Scientific and Technical Journal of Information Technologies, Mechanics and Optics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2226-1494</issn><issn pub-type="epub">2500-0373</issn><publisher><publisher-name>Университет ИТМО</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.17586/2226-1494-2023-23-2-340-351</article-id><article-id custom-type="elpub" pub-id-type="custom">ntv-380</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ИСКУССТВЕННЫЙ ИНТЕЛЛЕКТ И КОГНИТИВНЫЕ ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>ARTIFICIAL INTELLIGENCE AND COGNITIVE INFORMATION TECHNOLOGIES</subject></subj-group></article-categories><title-group><article-title>Выделение ролей в сетях общественного транспорта с атрибутами узлов: описание модели</article-title><trans-title-group xml:lang="en"><trans-title>Role discovery in node-attributed public transportation networks: the model description</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-8140-010X</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Лыткин</surname><given-names>Ю. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Lytkin</surname><given-names>Y. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Лыткин Юрий Всеволодович — кандидат физико-математических наук, старший научный сотрудник</p><p>Санкт-Петербург, 197101</p><p>sc 57155292900</p></bio><bio xml:lang="en"><p>Yuri V. Lytkin — PhD (Physics &amp; Mathematics), Senior Researcher</p><p>Saint Petersburg, 197101</p><p>sc 57155292900</p></bio><email xlink:type="simple">jurasicus@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-8169-8436</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Чунаев</surname><given-names>П. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Chunaev</surname><given-names>P. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Чунаев Петр Владимирович — кандидат физико-математических наук, старший научный сотрудник</p><p>Санкт-Петербург, 197101</p><p>sc 36522457300</p></bio><bio xml:lang="en"><p>Petr V. Chunaev — PhD (Physics &amp; Mathematics), Senior Researcher</p><p>Saint Petersburg, 197101</p><p>sc 36522457300</p></bio><email xlink:type="simple">chunaev@itmo.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-2537-4087</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Градов</surname><given-names>Т. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Gradov</surname><given-names>T. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Градов Тимофей Алексеевич — инженер</p><p>Санкт-Петербург, 197101</p><p>sc 57221121540</p></bio><bio xml:lang="en"><p>Timofey A. Gradov — Engineer</p><p>Saint Petersburg, 197101</p><p>sc 57221121540</p></bio><email xlink:type="simple">timagradov@yahoo.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-8343-2519</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Бойцов</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Boytsov</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Бойцов Антон Алексеевич — инженер</p><p>Санкт-Петербург, 197101</p><p> </p></bio><bio xml:lang="en"><p>Anton A. Boytsov — Engineer</p><p>Saint Petersburg, 197101</p></bio><email xlink:type="simple">aboytsov@itmo.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-2805-1323</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Саитов</surname><given-names>И. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Saitov</surname><given-names>I. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Саитов Ирек Аликович — инженер</p><p>Санкт-Петербург, 197101</p><p>sc 57215429754 </p></bio><bio xml:lang="en"><p>Irek A. Saitov — Engineer</p><p>Saint Petersburg, 197101</p><p>sc 57215429754</p></bio><email xlink:type="simple">xanilegendx@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Университет ИТМО</institution><country>Россия</country></aff><aff xml:lang="en"><institution>ITMO University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>21</day><month>12</month><year>2024</year></pub-date><volume>23</volume><issue>2</issue><fpage>340</fpage><lpage>351</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Лыткин Ю.В., Чунаев П.В., Градов Т.А., Бойцов А.А., Саитов И.А., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Лыткин Ю.В., Чунаев П.В., Градов Т.А., Бойцов А.А., Саитов И.А.</copyright-holder><copyright-holder xml:lang="en">Lytkin Y.V., Chunaev P.V., Gradov T.A., Boytsov A.A., Saitov I.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://ntv.elpub.ru/jour/article/view/380">https://ntv.elpub.ru/jour/article/view/380</self-uri><abstract><p>Предмет исследования. Моделирование систем общественного транспорта с позиций теории сложных сетей имеет большое значение для повышения их эффективности и надежности. При этом важной задачей является анализ ролей узлов и взвешенных связей в сети, моделирующих группы остановок общественного транспорта и связывающие их маршруты. В настоящее время данная задача решена на основе только топологической и геопространственной информации о наличии маршрутов между остановками и их географическом положении. Такое ограничение приводит к проблеме неинтерпретируемости выделенных ролей. Для решения проблемы определения ролей в сетях в предложенной модели транспорта дополнительно учтена информация о социальной инфраструктуре вокруг остановок, а также осуществлено выделение совместно топологических, геопространственных и инфраструктурных ролей. Метод. Система общественного транспорта смоделирована с помощью специальной взвешенной сети — с атрибутами узлов. При этом узлы — непересекающиеся группы остановок, объединенные по геопространственному положению, атрибуты узлов — векторы, содержащие сведения о социальной инфраструктуре вокруг остановок, а взвешенные связи интегрируют информацию о расстоянии и количестве пересадок в маршрутах между остановками. Для идентификации модели достаточно использовать только открытые городские данные о системе общественного транспорта. Выделение ролей остановок выполнено путем кластеризации узлов сети в соответствии с их топологическими и атрибутивными признаками. Основные результаты. Предложена обобщенная модель системы общественного транспорта. Представлен новый подход решения задачи выделения ролей остановок, обеспечивающий интерпретируемость с топологической, геопространственной и инфраструктурной точек зрения. Модель идентифицирована на открытых данных Санкт-Петербурга об остановках подземного, троллейбусного и автобусного транспорта, а также организациях и предприятиях вокруг остановок. На основе данных найдены сбалансированные параметры объединения остановок, назначения весов связей и построения векторов атрибутов для последующего использования в задаче выделения ролей. Практическая значимость. Результаты исследования могут быть использованы для определения транспортных и инфраструктурных недостатков реальных систем общественного транспорта, которые следует учитывать для улучшения функционирования этих систем в будущем.</p></abstract><trans-abstract xml:lang="en"><p>Modeling public transport systems from the standpoint of the theory of complex networks is of great importance to improve their efficiency and reliability. An important task here is to analyze the roles of nodes and weighted links in the network, respectively modeling groups of public transport stops and their linking routes. In previous works, this problem was solved based on only topological and geospatial information about the presence of routes between stops and their geographical location which led to the problem of uninterpretability of the discovered roles. In this article, to solve the problem, the model additionally considers information about the social infrastructure around the stops and discovers topological, geospatial, and infrastructure roles jointly. The public transport system is modeled using a special weighted network — with node attributes where nodes are non-overlapping groups of stops united by geospatial location, node attributes are vectors containing information about the social infrastructure around stops, and weighted links integrate information about the distance and number of transfers in routes between stops. To identify the model, it is sufficient to use only open urban data on the public transport system. Role discovery for stops is carried out by clustering network nodes in accordance with their topological and attributive features. An extended model of the public transport system and a new approach to solving the problem of discovering the roles of stops, providing interpretability from the topological, geospatial and infrastructural points of view, are proposed. The model was identified on the open data of Saint Petersburg about metro stations, trolleybus and bus stops as well as organizations and enterprises around the stations and stops. Based on the data, balanced parameters for grouping stops, assigning link weights and constructing attribute vectors are found for further use in the role discovery task. The results of the study can be used to identify transport and infrastructure shortcomings of real public transport systems which should be considered to improve the functioning of these systems in the future.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>сеть с атрибутами узлов</kwd><kwd>сеть общественного транспорта</kwd><kwd>выделение ролей</kwd><kwd>классификация узлов сети</kwd><kwd>топология сети</kwd><kwd>социальная инфраструктура</kwd></kwd-group><kwd-group xml:lang="en"><kwd>node-attributed network</kwd><kwd>public transportation network</kwd><kwd>role discovery</kwd><kwd>network node classification</kwd><kwd>network topology</kwd><kwd>social infrastructure</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Исследование выполнено за счет гранта Российского научного фонда (проект № 17-71-30029) при софинансировании ПАО «Банк Санкт-Петербург»</funding-statement><funding-statement xml:lang="en">This study is supported by the Russian Science Foundation, Agreement No. 17-71-30029, with co-financing of the “Bank Saint Petersburg”.</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Sen P., Dasgupta S., Chatterjee A., Sreeram P.A., Mukherjee G., Manna S.S. Small-world properties of the indian railway network // Physical Review E. 2003. V. 67. N 3. P. 036106. https://doi.org/10.1103/physreve.67.036106</mixed-citation><mixed-citation xml:lang="en">Sen P., Dasgupta S., Chatterjee A., Sreeram P.A., Mukherjee G., Manna S.S. Small-world properties of the indian railway network. Physical Review E, 2003, vol. 67, no. 3, pp. 036106. https://doi.org/10.1103/physreve.67.036106</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Sienkiewicz J., Hołyst J. Statistical analysis of 22 public transport networks in Poland // Physical Review E. 2005. V. 72. N 4. P. 046127. https://doi.org/10.1103/physreve.72.046127</mixed-citation><mixed-citation xml:lang="en">Sienkiewicz J., Hołyst J. Statistical analysis of 22 public transport networks in Poland. Physical Review E, 2005, vol. 72, no. 4, pp. 046127. https://doi.org/10.1103/physreve.72.046127</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Haznagy A., Fi I., London A., Nemeth T. Complex network analysis of public transportation networks: A comprehensive study // Proc. of the 2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS). 2015. P. 371–378. https://doi.org/10.1109/mtits.2015.7223282</mixed-citation><mixed-citation xml:lang="en">Haznagy A., Fi I., London A., Nemeth T. Complex network analysis of public transportation networks: A comprehensive study. Proc. of the 2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS), 2015, pp. 371–378. https://doi.org/10.1109/mtits.2015.7223282</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Yang X.-H., Chen G., Chen S.-Y., Wang W.-L., Wang L. Study on some bus transport networks in china with considering spatial characteristics // Transportation Research Part A: Policy and Practice. 2014. V. 69. N 1. P. 1–10. https://doi.org/10.1016/j.tra.2014.08.004</mixed-citation><mixed-citation xml:lang="en">Yang X.-H., Chen G., Chen S.-Y., Wang W.-L., Wang L. Study on some bus transport networks in china with considering spatial characteristics. Transportation Research Part A: Policy and Practice, 2014, vol. 69, no. 1, pp. 1–10. https://doi.org/10.1016/j.tra.2014.08.004</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Zhang J., Zhao M., Liu H., Xu X. Networked characteristics of the urban rail transit networks // Physica A: Statistical Mechanics and its Applications. 2013. V. 392. N 6. P. 1538–1546. https://doi.org/10.1016/j.physa.2012.11.036</mixed-citation><mixed-citation xml:lang="en">Zhang J., Zhao M., Liu H., Xu X. Networked characteristics of the urban rail transit networks. Physica A: Statistical Mechanics and its Applications, 2013, vol. 392, no. 6, pp. 1538–1546. https://doi.org/10.1016/j.physa.2012.11.036</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Wang L.-N., Wang K., Shen J.-L. Weighted complex networks in urban public transportation: Modeling and testing // Physica A: Statistical Mechanics and its Applications. 2020. V. 545. P. 123498. https://doi.org/10.1016/j.physa.2019.123498</mixed-citation><mixed-citation xml:lang="en">Wang L.-N., Wang K., Shen J.-L. Weighted complex networks in urban public transportation: Modeling and testing. Physica A: Statistical Mechanics and its Applications, 2020, vol. 545, pp. 123498. https://doi.org/10.1016/j.physa.2019.123498</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Shanmukhappa T., Ho I.W.-H., Chi K.T. Spatial analysis of bus transport networks using network theory // Physica A: Statistical Mechanics and its Applications. 2018. V. 502. P. 295–314. https://doi.org/10.1016/j.physa.2018.02.111</mixed-citation><mixed-citation xml:lang="en">Shanmukhappa T., Ho I.W.-H., Chi K.T. Spatial analysis of bus transport networks using network theory. Physica A: Statistical Mechanics and its Applications, 2018, vol. 502, pp. 295–314. https://doi.org/10.1016/j.physa.2018.02.111</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Wang Y., Deng Y., Ren F., Zhu R., Wang P., Du T., Du Q. Analysing the spatial configuration of urban bus networks based on the geospatial network analysis method // Cities. 2020. V. 96. P. 102406. https://doi.org/10.1016/j.cities.2019.102406</mixed-citation><mixed-citation xml:lang="en">Wang Y., Deng Y., Ren F., Zhu R., Wang P., Du T., Du Q. Analysing the spatial configuration of urban bus networks based on the geospatial network analysis method. Cities, 2020, vol. 96, pp. 102406. https://doi.org/10.1016/j.cities.2019.102406</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Lantseva A., Ivanov S. Modeling transport accessibility with open data: Case study of st. Petersburg // Procedia Computer Science. 2016. V. 101. P. 197–206. https://doi.org/10.1016/j.procs.2016.11.024</mixed-citation><mixed-citation xml:lang="en">Lantseva A., Ivanov S. Modeling transport accessibility with open data: Case study of st. Petersburg. Procedia Computer Science, 2016, vol. 101, pp. 197–206. https://doi.org/10.1016/j.procs.2016.11.024</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Bothorel C., Cruz J., Magnani M., Micenková B. Clustering attributed graphs: Models, measures and methods // Network Science. 2015. V. 3. N 3. P. 408–444. https://doi.org/10.1017/nws.2015.9</mixed-citation><mixed-citation xml:lang="en">Bothorel C., Cruz J., Magnani M., Micenková B. Clustering attributed graphs: Models, measures and methods. Network Science, 2015, vol. 3, no. 3, pp. 408–444. https://doi.org/10.1017/nws.2015.9</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Chunaev P. Community detection in node-attributed social networks: A survey // Computer Science Review. 2020. V. 37. P. 100286. https://doi.org/10.1016/j.cosrev.2020.100286</mixed-citation><mixed-citation xml:lang="en">Chunaev P. Community detection in node-attributed social networks: A survey. Computer Science Review, 2020, vol. 37, pp. 100286. https://doi.org/10.1016/j.cosrev.2020.100286</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Atzmueller M., Günnemann S., Zimmermann A. Mining communities and their descriptions on attributed graphs: a survey // Data Mining and Knowledge Discovery. 2021. V. 35. N 3. P. 661–687. https://doi.org/10.1007/s10618-021-00741-z</mixed-citation><mixed-citation xml:lang="en">Atzmueller M., Günnemann S., Zimmermann A. Mining communities and their descriptions on attributed graphs: a survey. Data Mining and Knowledge Discovery, 2021, vol. 35, no. 3, pp. 661–687. https://doi.org/10.1007/s10618-021-00741-z</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Rossi R.A., Ahmed N.K. Role discovery in networks // IEEE Transactions on Knowledge and Data Engineering. 2015. V. 27. N 4. P. 1112–1131. https://doi.org/10.1109/tkde.2014.2349913</mixed-citation><mixed-citation xml:lang="en">Rossi R.A., Ahmed N.K. Role discovery in networks. IEEE Transactions on Knowledge and Data Engineering, 2015, vol. 27, no. 4, pp. 1112–1131. https://doi.org/10.1109/tkde.2014.2349913</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Ahmed N.K., Rossi R.A., Willke T.L., Zhou R. Revisiting role discovery in networks: From node to edge roles // ArXiv. 2016. arXiv:1610.00844. https://doi.org/10.48550/arXiv.1610.00844</mixed-citation><mixed-citation xml:lang="en">Ahmed N.K., Rossi R.A., Willke T.L., Zhou R. Revisiting role discovery in networks: From node to edge roles. ArXiv, 2016, arXiv:1610.00844. https://doi.org/10.48550/arXiv.1610.00844</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Martínez V., Berzal F., Cubero J.-C. An automorphic distance metric and its application to node embedding for role mining // Complexity. 2021. V. 2021. P. 1–17. https://doi.org/10.1155/2021/5571006</mixed-citation><mixed-citation xml:lang="en">Martínez V., Berzal F., Cubero J.-C. An automorphic distance metric and its application to node embedding for role mining. Complexity, 2021, vol. 2021, pp. 1–17. https://doi.org/10.1155/2021/5571006</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Gupte P.V., Ravindran B., Parthasarathy S. Role discovery in graphs using global features: Algorithms, applications and a novel evaluation strategy // Proc. of the IEEE 33rd International Conference on DataEngineering (ICDE). 2017. P. 771–782. https://doi.org/10.1109/icde.2017.128</mixed-citation><mixed-citation xml:lang="en">Gupte P.V., Ravindran B., Parthasarathy S. Role discovery in graphs using global features: Algorithms, applications and a novel evaluation strategy. Proc. of the IEEE 33 rd International Conference on Data Engineering (ICDE), 2017, pp. 771–782. https://doi.org/10.1109/icde.2017.128</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Revelle M., Domeniconi C., Johri A. Persistent roles in online social networks // Lecture Notes in Computer Science. 2016. V. 9852. P. 47–62. https://doi.org/10.1007/978-3-319-46227-1_4</mixed-citation><mixed-citation xml:lang="en">Revelle M., Domeniconi C., Johri A. Persistent roles in online social networks. Lecture Notes in Computer Science, 2016, vol. 9852, pp. 47–62. https://doi.org/10.1007/978-3-319-46227-1_4</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Rossi R.A., Gallagher B., Neville J., Henderson K. Modeling dynamic behavior in large evolving graphs // Proc. of the Sixth ACM International Conference on Web Search and Data Mining (WSDM’13). 2013. P. 667–676. https://doi.org/10.1145/2433396.2433479</mixed-citation><mixed-citation xml:lang="en">Rossi R.A., Gallagher B., Neville J., Henderson K. Modeling dynamic behavior in large evolving graphs. Proc. of the Sixth ACM International Conference on Web Search and Data Mining ( W S D M ’ 1 3 ) , 2 0 1 3 , p p . 6 6 7 – 6 7 6 . https://doi.org/10.1145/2433396.2433479</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Vega D., Meseguer R., Freitag F., Magnani M. Role and position detection in networks: Reloaded // Proc. of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). 2015. P. 320–325. https://doi.org/10.1145/2808797.2809412</mixed-citation><mixed-citation xml:lang="en">Vega D., Meseguer R., Freitag F., Magnani M. Role and position detection in networks: Reloaded. Proc. of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2015, pp. 320–325. https://doi.org/10.1145/2808797.2809412</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Yang Z., Algesheimer R., Tessone C.J. A comparative analysis of community detection algorithms on artificial networks // Scientific Reports. 2016. V. 6. N 1. P. 30750. https://doi.org/10.1038/srep30750</mixed-citation><mixed-citation xml:lang="en">Yang Z., Algesheimer R., Tessone C.J. A comparative analysis of community detection algorithms on artificial networks. Scientific Reports, 2016, vol. 6, no. 1, pp. 30750. https://doi.org/10.1038/srep30750</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Fortunato S. Community detection in graphs // Physics Reports. 2010. V. 4 8 6 . N 3-5 . P. 7 5 – 1 7 4 . https://doi.org/10.1016/j.physrep.2009.11.002</mixed-citation><mixed-citation xml:lang="en">Fortunato S. Community detection in graphs. Physics Reports, 2010, vol. 486, no. 3-5, pp. 75–174. https://doi.org/10.1016/j.physrep.2009.11.002</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Souravlas S., Sifaleras A., Tsintogianni M., Katsavounis S. A classification of community detection methods in social networks: a survey // International Journal of General Systems. 2021. V. 50. N 1. P. 63–91. https://doi.org/10.1080/03081079.2020.1863394</mixed-citation><mixed-citation xml:lang="en">Souravlas S., Sifaleras A., Tsintogianni M., Katsavounis S. A classification of community detection methods in social networks: a survey. International Journal of General Systems, 2021, vol. 50, no. 1, pp. 63–91. https://doi.org/10.1080/03081079.2020.1863394</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Bartal A., Ravid G. Member behavior in dynamic online communities: Role affiliation frequency model // IEEE Transactions on Knowledge and Data Engineering. 2020. V. 32. N 9. P. 1773–1784. https://doi.org/10.1109/tkde.2019.2911067</mixed-citation><mixed-citation xml:lang="en">Bartal A., Ravid G. Member behavior in dynamic online communities: Role affiliation frequency model. IEEE Transactions on Knowledge and Data Engineering, 2020, vol. 32, no. 9, pp. 1773–1784. https://doi.org/10.1109/tkde.2019.2911067</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Ni W., Guo H., Liu T., Zeng Q. Automatic role identification for research teams with ranking multi-view machines // Knowledge and Information Systems. 2020. V. 62. N 12. P. 4681–4716. https://doi.org/10.1007/s10115-020-01504-w</mixed-citation><mixed-citation xml:lang="en">Ni W., Guo H., Liu T., Zeng Q. Automatic role identification for research teams with ranking multi-view machines. Knowledge and Information Systems, 2020, vol. 62, no. 12, pp. 4681–4716. https://doi.org/10.1007/s10115-020-01504-w</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Liu S., Toriumi F., Nishiguchi M., Usui S. Multiple role discovery in complex networks // Studies in Computational Intelligence. 2022. V. 1016. P. 415–427. https://doi.org/10.1007/978-3-030-93413-2_35</mixed-citation><mixed-citation xml:lang="en">Liu S., Toriumi F., Nishiguchi M., Usui S. Multiple role discovery in complex networks. Studies in Computational Intelligence, 2022, vol. 1016, pp. 415–427. https://doi.org/10.1007/978-3-030-93413-2_35</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">Liu Y., Du F., Sun J., Silva T., Jiang Y., Zhu T. Identifying social roles using heterogeneous features in online social networks // Journal of the Association for Information Science and Technology. 2019. V. 70. N 7. P. 660–674. https://doi.org/10.1002/asi.24160</mixed-citation><mixed-citation xml:lang="en">Liu Y., Du F., Sun J., Silva T., Jiang Y., Zhu T. Identifying social roles using heterogeneous features in online social networks. Journal of the Association for Information Science and Technology, 2019, vol. 70, no. 7, pp. 660–674. https://doi.org/10.1002/asi.24160</mixed-citation></citation-alternatives></ref><ref id="cit27"><label>27</label><citation-alternatives><mixed-citation xml:lang="ru">Zhang L., Lu J., Fu B., Li S. A review and prospect for the complexity and resilience of urban public transit network based on complex network theory // Complexity. 2018. V. 2018. P. 1–36. https://doi.org/10.1155/2018/2156309</mixed-citation><mixed-citation xml:lang="en">Zhang L., Lu J., Fu B., Li S. A review and prospect for the complexity and resilience of urban public transit network based on complex network theory. Complexity, 2018, vol. 2018, pp. 1–36. https://doi.org/10.1155/2018/2156309</mixed-citation></citation-alternatives></ref><ref id="cit28"><label>28</label><citation-alternatives><mixed-citation xml:lang="ru">Shanmukhappa T., Ho I.W.-H., Tse C.K., Leung K.K. Recent development in public transport network analysis from the complex network perspective // IEEE Circuits and Systems Magazine. 2019. V. 19. N 4. P. 39–65. https://doi.org/10.1109/mcas.2019.2945211</mixed-citation><mixed-citation xml:lang="en">Shanmukhappa T., Ho I.W.-H., Tse C.K., Leung K.K. Recent development in public transport network analysis from the complex network perspective. IEEE Circuits and Systems Magazine, 2019, vol. 19, no. 4, pp. 39–65. https://doi.org/10.1109/mcas.2019.2945211</mixed-citation></citation-alternatives></ref><ref id="cit29"><label>29</label><citation-alternatives><mixed-citation xml:lang="ru">Xu Q., Mao B., Bai Y. Network structure of subway passenger flows // Journal of Statistical Mechanics: Theory and Experiment. 2016. V. 2016. N 3. P. 033404. https://doi.org/10.1088/1742-5468/2016/03/033404</mixed-citation><mixed-citation xml:lang="en">Xu Q., Mao B., Bai Y. Network structure of subway passenger flows. Journal of Statistical Mechanics: Theory and Experiment, 2016, vol. 2016, no. 3, pp. 033404. https://doi.org/10.1088/1742-5468/2016/03/033404</mixed-citation></citation-alternatives></ref><ref id="cit30"><label>30</label><citation-alternatives><mixed-citation xml:lang="ru">Feng J., Li X., Mao B., Xu Q., Bai Y. Weighted complex network analysis of the beijing subway system: Train and passenger flows // Physica A: Statistical Mechanics and its Applications. 2017. V. 474. P. 213–223. https://doi.org/10.1016/j.physa.2017.01.085</mixed-citation><mixed-citation xml:lang="en">Feng J., Li X., Mao B., Xu Q., Bai Y. Weighted complex network analysis of the beijing subway system: Train and passenger flows. Physica A: Statistical Mechanics and its Applications, 2017, vol. 474, pp. 213–223. https://doi.org/10.1016/j.physa.2017.01.085</mixed-citation></citation-alternatives></ref><ref id="cit31"><label>31</label><citation-alternatives><mixed-citation xml:lang="ru">Faust K., Wasserman S. Blockmodels: Interpretation and evaluation // Social Networks. 1992. V. 14. N 1. P. 5–61. https://doi.org/10.1016/0378-8733(92)90013-w</mixed-citation><mixed-citation xml:lang="en">Faust K., Wasserman S. Blockmodels: Interpretation and evaluation. Social Networks, 1992, vol. 14, no. 1, pp. 5–61. https://doi.org/10.1016/0378-8733(92)90013-w</mixed-citation></citation-alternatives></ref><ref id="cit32"><label>32</label><citation-alternatives><mixed-citation xml:lang="ru">Batagelj V., Mrvar A., Ferligoj A., Doreian P. Generalized blockmodeling with Pajek // Metodološki zvezki. 2004. V. 1. N 2. P. 455–467. https://doi.org/10.51936/ofaw1880</mixed-citation><mixed-citation xml:lang="en">Batagelj V., Mrvar A., Ferligoj A., Doreian P. Generalized blockmodeling with Pajek. Metodološki zvezki, 2004, vol. 1, no. 2, pp. 455–467. https://doi.org/10.51936/ofaw1880</mixed-citation></citation-alternatives></ref><ref id="cit33"><label>33</label><citation-alternatives><mixed-citation xml:lang="ru">Luczkovich J., Borgatti S., Johnson J.C., Everett M.G. Defining and measuring trophic role similarity in food webs using regular equivalence // Journal of theoretical biology. 2003. V. 220. N 3. P. 303–21. https://doi.org/10.1006/jtbi.2003.3147</mixed-citation><mixed-citation xml:lang="en">Luczkovich J., Borgatti S., Johnson J.C., Everett M.G. Defining and measuring trophic role similarity in food webs using regular equivalence. Journal of theoretical biology, 2003, vol. 220, no. 3, pp. 303–21. https://doi.org/10.1006/jtbi.2003.3147</mixed-citation></citation-alternatives></ref><ref id="cit34"><label>34</label><citation-alternatives><mixed-citation xml:lang="ru">Ma H., Zhou D., Liu C., Lyu M.R., King I. Recommender systems with social regularization // Proc. of the Fourth ACM International Conference on Web Search and Data Mining (WSDM’11). 2011. P. 287–296. https://doi.org/10.1145/1935826.1935877</mixed-citation><mixed-citation xml:lang="en">Ma H., Zhou D., Liu C., Lyu M.R., King I. Recommender systems with social regularization. Proc. of the Fourth ACM International Conference on Web Search and Data Mining (WSDM’11), 2011, pp. 287–296. https://doi.org/10.1145/1935826.1935877</mixed-citation></citation-alternatives></ref><ref id="cit35"><label>35</label><citation-alternatives><mixed-citation xml:lang="ru">Golder S.A., Donath J. Social roles in electronic communities // Internet Research. 2004. V. 5.</mixed-citation><mixed-citation xml:lang="en">Golder S.A., Donath J. Social roles in electronic communities. Internet Research, 2004, vol. 5.</mixed-citation></citation-alternatives></ref><ref id="cit36"><label>36</label><citation-alternatives><mixed-citation xml:lang="ru">Yue H., Guan Q., Pan Y., Chen L., Lv J., Yao Y. Detecting clusters over intercity transportation networks using k-shortest paths and hierarchical clustering: a case study of mainland China // International Journal of Geographical Information Science. 2019. V. 33. N 5. P. 1082–1105. https://doi.org/10.1080/13658816.2019.156655137.</mixed-citation><mixed-citation xml:lang="en">Yue H., Guan Q., Pan Y., Chen L., Lv J., Yao Y. Detecting clusters over intercity transportation networks using k-shortest paths and hierarchical clustering: a case study of mainland China. International Journal of Geographical Information Science, 2019, vol. 33, no. 5, pp. 1082–1105. https://doi.org/10.1080/13658816.2019.1566551</mixed-citation></citation-alternatives></ref><ref id="cit37"><label>37</label><citation-alternatives><mixed-citation xml:lang="ru">Bereznyi D., Qutbuddin A., Her Y., Yang K. Node-attributed spatial graph partitioning // Proc. of the 28 th International Conference on Advances in Geographic Information Systems (SIGSPATIAL’20). 2020. P. 58–67. https://doi.org/10.1145/3397536.3422198</mixed-citation><mixed-citation xml:lang="en">Bereznyi D., Qutbuddin A., Her Y., Yang K. Node-attributed spatial graph partitioning. Proc. of the 28 th International Conference on Advances in Geographic Information Systems (SIGSPATIAL’20), 2020, pp. 58–67. https://doi.org/10.1145/3397536.3422198</mixed-citation></citation-alternatives></ref><ref id="cit38"><label>38</label><citation-alternatives><mixed-citation xml:lang="ru">MacQueen J. Some methods for classification and analysis of multivariate observations // Proc. of the Fifth Berkeley Symposium on Mathematical Statistics and Probability. V. 1. Statistics. 1967. P. 281–297</mixed-citation><mixed-citation xml:lang="en">MacQueen J. Some methods for classification and analysis of multivariate observations. Proc. of the Fifth Berkeley Symposium on Mathematical Statistics and Probability. V. 1. Statistics, 1967, pp. 281–297.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
