METHODS FOR SEARCHING AND COMPARING OBJECTS WHEN APPLYING THE SUBJECT-SUBJECT APPROACH TO MANAGEMENT REVIEW

Abstract

Background. The generally accepted approach to management in organizational systems today differs in that participants in problematic situations (PrS) are excluded from the processes of their solution. Complementing the traditional approach to management with the ability to solve PrS by the actors themselves makes it possible to enrich decision- making processes through the use of volitional and intellectual resources of subjects. For information support of actors, a decision support system (DSS) is being developed, the design of which faced the task of choosing methods for searching and comparing various objects in the process of intersubjective management of PrS solution. The purpose of the study is to analyze and select methods for searching and comparing various objects in the database, knowledge base, and library of DSS precedents, which can be used in the development of algorithms for supporting and making decisions by actors building personal ontologies of the DSS as a result of communication on the DSS site. Materials and methods. The materials are the main provisions of the theory of intersubjective management of problematic situations solution. Methods of comparison and search in the database and knowledge base of similar objects – algorithms for fuzzy string comparison and methods for finding substrings in a string, as well as management theory, system analysis, decision theory, knowledge engineering. Results. A review of methods for searching and comparing data is carried out, with an emphasis on methods applicable to subject-to-subject (intersubjective) management of the PrS solution. Among the well-known algorithms, four of the most popular fuzzy string comparison algorithms are highlighted: Hamming algorithm, Levenstein editorial distance (algorithm), Damerau–Levenstein editorial distance (algorithm) and distance (algorithm) Jaro-Winkler. Among the search algorithms applicable to one– dimensional string arrays of data, the following are highlighted and considered: the simple search algorithm (linear algorithm), the Robin–Karp algorithm and the Knuth–Morris-Pratt algorithm. Conclusions. It is proposed to use a linear algorithm as the most suitable for solving problems related, for example, to searching the library for use cases by the names of the PrS and keywords.

Keywords

• subject-subject approach
• intersubjective management
• problem situations
• search methods
• comparison methods
• decision support system