Open AccessShortest path algorithm for graphs in instances of semantic optimization
Author(s) -
Oksana Yu. Lavlinskaya,
T. V. Kurchenkova,
Oksana V. Kuripta
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1479/1/012036
Subject(s) - computer science , shortest path problem , adjacency matrix , shortest path faster algorithm , adjacency list , graph , algorithm , theoretical computer science , k shortest path routing
This article discusses an example of using the algorithm for finding the shortest path to determine the strength of the connection between different words and phrases of the subject area in the tasks of Internet marketing, such as website promotion, thematic traffic, contextual advertising. The input data is words and phrases obtained from search queries and the frequency of their use in the network. Based on the initial data, a weighted graph is constructed, a adjacency matrix is drawn up. The shortest path is determined by the algorithm Floyd-Warshall. The algorithm finds links between words and the force of communication. This approach allows you to find unique semantic combinations and make the necessary search queries. Based on the analysis of the adjacency matrix and the definition of the coherence of words, marketers get a unique tool for solving problems in the field of digital marketing.