PROBLEM OF CLASSIFICATION OF SEMANTIC KERNELS OF WEB RESOURCE
DOI:
https://doi.org/10.20998/2079-0023.2022.01.09Keywords:
semantic kernel, keyword, Ford – Fulkerson method, K-applicantAbstract
The article presents a new theoretical basis for solving the problem of situational management of semantic cores identified on the basis of WEB content. Such a task arises within the framework of a new phenomenon called virtual promotion. Its essence lies in the fact that a real product can exist in two realities: online and offline. According to marketing theory, the lifetime in two realities is the same. However, in the online mode, the goods exist independently and in accordance with the laws of the use of Internet technologies. Therefore, based on the concept of a marketing channel, it was proposed to consider a message in such a channel as a semantic core. The core is a specially selected set of keywords that briefly describe the product and the corresponding need. It has been proposed that each need forms a so-called class of need. Therefore, the product description will either belong to this class or not. In addition, a product can be described by a different set of keywords, which means that different descriptions of the same product or several products, if there are any for sale in the enterprise, will fall into the demand class. As a result, in this work, it was proposed to consider the center of this class as the so-called K-candidate. It is the K-applicant that will be the semantic core that will be considered at the current iteration of the situational management process. In addition, in order to move from one situation to another, in other words, from one core to another, it is required to have such an alternative core. It can be safely taken either from the neighborhood of the need class center (K-applicant), or the center of another class (another K-applicant), if the product can cover several needs of a potential buyer. Then the actual task is to classify the classes of needs based on the text corpus in HTML format. Having a text corpus at the first stage, the task of synthesizing semantic cores is realized, and then the classification task itself. This article proposes the formulation of the classification problem, taking into account the features that the Internet technologies contribute to search engine optimization. In particular, it is proposed to use four metrics from the category of WEB statistics. And then it is proposed to use the clustering method to identify classes of needs, taking into account the fact that the K-applicant is presented as a semantic network or as a graph.
References
Aggarwal C. C., Zhai C. X. A survey of text classification algorithms. Mining Text Data. Berlin: Springer Science-Business Media LLC Publ., 2012, pp. 163–222.
Ostapez А. А. Reshayuschie pravila dlya ansamblya iz zepey veroyatnostnuh klassifikatorov pri reshenii zadach klasifikazii s peresekayuschimisya klassami. [Decision rules for an ensemble of chains of probabilistic classifiers in solving classification problems with intersecting classes] Machine learning and data analysis. Moscow: MFTI Publ., 2016, vol. 2, no. 3, pp. 276–285.
Pospelov D. А. Situazionnoye upravlenie: teoriya i praktika. [Situational management: theory and practice]. Moscow: Nauka Publ., 1986. 288 p.
Neelova N. М. Enziklopaediya poiskovogo prodvizeniya Ingate. [Encyclopedia of Search Engine Promotion Ingate]. Moscow: IP Androsov Publ., 2017. 541 p.
Brolina А. M. Кontextnaya reklama: profesionalnuy upgrate dlya uvelicheniya prodaz. Praktikum оt expertov. [Contextual advertising: a professional upgrade to increase sales. Workshop from experts]. Moscow: ООО «Ingate Reklama» Publ., 2015. 44 p.
Sharma U., Thakur K. S. A Study on Digital Marketing and its Impact on Consumers Purchase. International Journal of Advanced Science and Technology. 2020, no. 29(3), pp. 13096–13110.
García J., Lizcano D., Ramos C., Matos N. Digital Marketing Actions That Achieve a Better Attraction and Loyalty of Users: An Analytical Study. Future Internet. Switzerland: MDPI Publ., 2019, no. 11(130), pp. 1–16.
Godlevsky M., Orekhov S., Orekhova E. Theoretical Fundamentals of Search Engine Optimization Based on Machine Learning. CEUR WS, USA, 2017, vol. 1844, pp. 23–32.
Konnonov I. V., Kashina О. А., Gilmanova E. I. Reshenie zadachi klasterizazii metodami opimiozazii на графах. [Solving the clustering problem by optimization methods on graphs]. Scientific notes of Kazan University. Series of physical and mathematical sciences. Kazan: KPFU Publ., 2019, vol. 161, book 3, pp. 423–437.
Osipenko V. V. Dva pidhodu dо rozvajannya zadachi klasterizazii u shirokomy sensi z pozuzii induktuvnogo modelyuvannya. [Two approaches to solving the problem of clustering in a broad sense from the standpoint of inductive modeling]. Energy and automation. Kyiv: NUBPU Publ., 2014, no. 1, pp. 83–97.
Khan A., Baharudin B., Lee L., Khairullah K. A Review of Machine Learning Algorithms for Text-Documents Classification. Journal of advances in information technology. USA, 2010, vol. 1, no. 1, pp. 4–20.
Nedelko V. М. Issledovaniye efektovnosti nekotoruh lineynuh metodov klassifikazii nа modelnuh raspredeleniyah.[Investigation of the efficiency of some linear classification methods on model distributions]. Machine learning and data analysis. Moscow: MFTI Publ., 2016, vol. 2, no. 3, pp. 305–328.
Sivogolovko Е. Metodu ozenki kachestva chetkoy klasterizazii. [Methods for assessing the quality of clear clustering]. Computer tools in education. SPb.: LETI Publ., 2011, no. 4, pp. 14–31.
Downloads
Published
How to Cite
Issue
Section
License
LicenseAuthors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).