Построение и анализ сверхбольших семантических сетей

Bibliografiske detaljer
Parent link:Перспективы развития фундаментальных наук=Prospects of Fundamental Sciences Development: сборник научных трудов XIV Международной конференции студентов, аспирантов и молодых ученых, г. Томск, 25-28 апреля 2017 г./ Национальный исследовательский Томский политехнический университет (ТПУ) ; под ред. И. А. Курзиной, Г. А. Вороновой.— , 2017
Т. 7 : IT-технологии и электроника.— 2017.— [С. 69-71]
Hovedforfatter: Лебедева Т. С.
Andre forfattere: Костюченко Е. Ю. (727), Розов А. С.
Summary:Заглавие с экрана
Within the framework of the work, an algorithm for constructing super-large semantic networks has been developed. It was tested using the Internet encyclopedia "Wikipedia" as an example. During the implementation, a parser for the syntax analysis of Wikipedia pages was developed. It finds the links between the articles. A graph based on list of articles and categories was formed. On the basis of the obtained graph analysis, algorithms for finding domains of high connectivity in a graph were proposed and tested.
Udgivet: 2017
Fag:
Online adgang:http://earchive.tpu.ru/handle/11683/45331
Format: Electronisk Book Chapter
KOHA link:https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=625683
Beskrivelse
Summary:Заглавие с экрана
Within the framework of the work, an algorithm for constructing super-large semantic networks has been developed. It was tested using the Internet encyclopedia "Wikipedia" as an example. During the implementation, a parser for the syntax analysis of Wikipedia pages was developed. It finds the links between the articles. A graph based on list of articles and categories was formed. On the basis of the obtained graph analysis, algorithms for finding domains of high connectivity in a graph were proposed and tested.