?
Архитектура и инструменты программного комплекса для визуализации и анализа графов
С. 32–37.
In book
Протвино: Изд-во ИФТИ, 2014.
Loshkareva M. E., Matveeva N., Вестник Томского государственного университета. История 2026 № 100 С. 112–118
This research is an endeavor to apply social network analysis (SNA) to the study of a medieval narrative source. The authors suppose that the use of network analysis may offer new possibilities in the study of the history of regions characterized by some political fragmentation. Authors tried to construct networks of historical interactions from 1193 ...
Added: May 22, 2026
Chepovskiy A., М.: Национальный открытый университет «ИНТУИТ», 2022.
В монографии рассмотрены различные математические модели для решения задач анализа сетей взаимодействующих объектов систем телекоммуникаций. Предназначена для разработчиков информационных систем, специалистов в области анализа данных. ...
Added: November 18, 2022
Makarov I., Makarov M., Kiselev D., PeerJ Computer Science 2021 Vol. 7 Article e526
Today, increased attention is drawn towards network representation learning, a technique that maps nodes of a network into vectors of a low-dimensional embedding space. A network embedding constructed this way aims to preserve nodes similarity and other specific network properties. Embedding vectors can later be used for downstream machine learning problems, such as node classification, ...
Added: March 31, 2021
Nesterenko A., , in: Supplementary Proceedings of the 5th International Conference on Analysis of Images, Social Networks and Texts (AIST-SUP 2016), Yekaterinburg, Russia, April 7-9, 2016.Vol. 1710.: Aachen: CEUR Workshop Proceedings, 2016.
Added: November 3, 2020
Polyakov I. V., Chepovskiy A., Chepovskiy A., Journal of Mathematical Sciences 2020 Vol. 245 P. 197–201
In this paper we propose an approach for compact storage of big graphs. We
propose the preprocessing algorithms of a certain type of graphs which can
signi cantly increase the data density on the disc and increase performance
of fundamental operations with graphs. ...
Added: January 30, 2020
Chepovskiy A., Lobanova S., Business Informatics 2017 Vol. 42 No. 4 P. 64–73
A method for detecting intersecting and nested communities in graphs of interacting objects of different nature is proposed and implemented. For this, two classical algorithms are taken: a hierarchical agglomerate and based on the search for k -cliques. The presented combined method is based on their consistent application. In addition, parametric options are developed that ...
Added: August 2, 2019
Polyakov I. V., Полякова В. О., Chepovskiy A., Системы высокой доступности 2018 Т. 14 № 3 С. 63–67
In this paper we propose different approaches for compact storaging of big socialgraphs. The joint use of two types of storages makes it possible to obtain a flexible scheme that is oriented both to the fast completion of the graph and to fast searches for the paths and extracting of subgraphs. ...
Added: October 28, 2018
Polyakov I. V., Chepovskiy A., Chepovskiy A., Фундаментальная и прикладная математика 2016 Т. 21 № 4 С. 125–132
В статье рассматриваются методы сжатия данных для хранения графов больших размеров. Предлагаются алгоритмы препроцессинга графа специальной структуры для повышения плотности записи данных и повышения эффективности выполнения базовых операций с графами. ...
Added: December 23, 2017
Polyakov I. V., Chepovskiy A., В кн.: Труды Международной научной конференции Московского физико-технического института (государственного университета) и Института физико-технической информатики (SCVRT1516).: М., Протвино: Институт физико-технической информатики, 2016. С. 76–78.
In this paper we propose an approach for compact storaging of a certain type of graphs. We use preprocessing algorithms which can significantly increase the data density on the disc and reduce the required number of disk accesses required to perform fundamental operations with the graph. ...
Added: November 20, 2016
Коломейченко М. И., Polyakov I. V., Chepovskiy A., В кн.: Труды Международной научной конференции Московского физико-технического института (государственного университета) и Института физико-технической информатики (SCVRT1516).: М., Протвино: Институт физико-технической информатики, 2016. С. 93–97.
This paper describes an automatic graph layout ”peacock’s tail”, which is based on force-directed graph drawing algorithm. Also presented its modified faster version called ”fast peacock’s tail.” This approach proved its efficiency on big social network graphs. ...
Added: November 20, 2016
Fursov K., Kadyrova A., , in: Supplementary Proceedings of the 5th International Conference on Analysis of Images, Social Networks and Texts (AIST-SUP 2016), Yekaterinburg, Russia, April 7-9, 2016.Vol. 1710.: Aachen: CEUR Workshop Proceedings, 2016. P. 51–61.
The term of advanced technology is primarily associated with computer electronics and microelectronics actively developing since 1960s. Although there is no single conventional definition of the notion or specific class of technology that is associated with it, discussions on what may be considered as technical advancements in the current perspective evolve over time. As long ...
Added: October 24, 2016
Коломейченко М. И., Polyakov I. V., Chepovskiy A. et al., М.: Национальный открытый университет «ИНТУИТ», 2016.
В учебном пособии представлены программные средства, методы и алгоритмы автоматизации средств визуализации графов. Предназначено для аналитиков, студентов, аспирантов и научных работников, изучающих алгоритмы анализа графов и методы анализа социальных сетей. ...
Added: October 17, 2016
Fursov K., Kadyrova A., Scientometrics 2017 Vol. 111 No. 3 P. 1947–1963
Since early 1960s, there has been a growing interest in the emergence and development of new technologies accompanied by a strong wish from decision makers to govern related processes at the corporate and national levels. One of the key categories that appeared to set up analytical and regulatory frameworks was the ‘advanced technology’ category. Primarily ...
Added: October 15, 2016
Коломейченко М. И., Chepovskiy A., В кн.: 26-я Международная конференция GraphiCon2016. Труды Международной научной конференции.: Н. Новгород: ННГАСУ, 2016. С. 332–333.
В работе описывается разработанный программный комплекс, позволяющий хранить, визуализировать и анализировать графы социальных сетей больших размеров. Приводится как общая схема реализованной архитектуры, так и всех ее компонент по отдельности. Большое внимание уделяется разнообразным алгоритмам авторазмещения сетей на плоскости, в том числе базирующихся на основе алгоритма вы-деления сообществ. ...
Added: September 19, 2016
Родин И. В., Artemova E., Dubov M. et al., , in: Proceedings of TextGraphs-10: the Workshop on Graph-based Methods for Natural Language Processing.: Stroudsburg, PA: Association for Computational Linguistics, 2016. P. 34–38.
We present a tool for dynamic reference graph visualization. A reference graph is a graph based on key phrases retrieved from a timeindexed natural language text corpus. This tool may be useful for the analysis of connected pairs of latent topics, changes in the significance of these topics as well as in the relationship between ...
Added: July 7, 2016
Коломейченко М. И., Polyakov I. V., Chepovskiy A. et al., В кн.: Труды Международной научной конференции по физико-технической информатике (CPT2015).: М., Протвино: Институт физико-технической информатики, 2016. С. 175–178.
Рассматривается задача анализа графа социальной сети. Представлена специализированная структура данных, предназначенная для хранения и обработки графов социальных сетей больших объемов. Предложена архитектура хранилища графа социальной сети больших объемов. ...
Added: May 11, 2016
Kutuzov A. B., , in: Information Retrieval. 9th Russian Summer School, RuSSIR 2015, Saint Petersburg, Russia, August 24-28, 2015, Revised Selected PapersVol. 573.: Switzerland: Springer, 2016. Ch. 6 P. 320–331.
The present paper deals with word sense induction from lexical co-occurrence graphs. We construct such graphs on large Russian corpora and then apply the data to cluster the results of Mail.ru search according to meanings in the query. We compare different methods of performing such clustering and different source corpora. Models of applying distributional semantics ...
Added: December 25, 2015
Kolomeychenko M. I., Chepovskiy A.A., Chepovskiy A.M., Journal of Mathematical Sciences 2015 Vol. 211 No. 3 P. 310–318
In this paper we propose an algorithm for finding subgraphs with adjusted properties of large social networks. The description of computational experi-ment which confirms the effectiveness of the proposed algorithm is given. ...
Added: October 24, 2015
Polyakov I.V., Chepovskiy A.A., Chepovskiy A.M., Journal of Mathematical Sciences 2015 Vol. 211 No. 3 P. 413–417
Various approaches for data storing and processing are investigated in the article. New algorithm to find paths in a huge graph is introduced. ...
Added: October 23, 2015