Kibernetika ta kompiuterni tekhnologiyi最新文献

{"title":"On the Improvement of the Heuristic Algorithm for Packing Circles into a Circle of Minimum Radius","authors":"B. Zadorozhnyi, O. Mitsa, P. Stetsyuk","doi":"10.34229/2707-451x.23.2.4","DOIUrl":"https://doi.org/10.34229/2707-451x.23.2.4","url":null,"abstract":"The article is devoted to investigation of a heuristic algorithm for solving the competitive problem \"Circles Dense packing into a circle of minimum radius\" and development of its improved version using Shor's r-algorithm with step dichotomy. The heuristic algorithm was developed by Bohdan Zadorozhnyi, a third-year student of Uzhhorod National University. The program implemented on its basis took second place in the competition and used less time than the maximum time, which, according to the competition, was allocated for a one-time launch of the program for 50 competitive tasks. The article describes the research results of how the Shor r-algorithm can be used to improve efficiency of the heuristic algorithm.\u0000The algorithm for improving the heuristic solution is implemented according to the following scheme. We start from the best arrangement of circles found by the heuristic algorithm. Then, we perform the following four stages of the algorithm: Stage 1. We set a rather large value of the initial step (we determine it depending on the input data or simply choose it as a large step); Stage 2. We run the r-algorithm from the starting point and find the local minimum of the corresponding nonlinear programming problem; Stage 3. If the local minimum found guarantees a smaller radius of the outer circle, then the local minimum point becomes the starting point; the local minimum found does not guarantee a smaller radius of the outer circle, then the size of the step h is reduced by half. Stage 4. If the step value is greater than the specified value, then we proceed to Stage 2. Otherwise, we finish work of the algorithm with solution improvement.\u0000Python 3.9.5 programming language and NumPy 1.24.2 library were used for software implementation of both algorithms. For 50 competitive tests and different number of iterations of the heuristic algorithm (10, 20, 30, 40 and 50 iterations), the analysis of the obtained results was conducted according to three parameters: the number of points obtained, program execution time and the number of exchanges of circles in one iteration of the heuristic algorithm. For most of the competitive tests, the refined algorithm allows you to get better results in points, in particular, in most cases the improvement is up to 2 points, and in some cases – from 3 to 6 points. The biggest improvements (6 points) are seen in tests, where the circles have the same or close radii. Here, the heuristic algorithm works not so effectively, therefore, for such tests, due to the algorithm with refinement, it is possible to significantly improve the results of competitive tasks in terms of points. Keywords: circle packing, heuristics, r-algorithm, Python 3.9.5, NumPy 1.24.2.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45604631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Computational Experiments for the r(α)-Algorithm with an Accelerated Implementation of Space Stretching","authors":"A. Suprun","doi":"10.34229/2707-451x.23.2.5","DOIUrl":"https://doi.org/10.34229/2707-451x.23.2.5","url":null,"abstract":"In the article, a modification of the r(α)-algorithm with adaptive line search which implements accelerated space dilation operation is considered. In classical r(α)-algorithm with adaptive line search, space is dilated along the difference of the two successive subgradients. In its modified variant, space is dilated along the direction which is determined by the largest absolute value components of the vector of difference of the two successive subgradients. The number of such components varies at each iteration of the algorithm and depends on a control parameter. Thus, at each iteration only corresponding subspace of a smaller dimension is dilated and the number of multiplication operations used for this decreases from 2n2 + 3n to 2nm + 2m + n, where n is the dimension of the space, m is the number of non-zero components of the space dilation direction.\u0000Description of the modified r(α)-algorithm with adaptive line search which implements accelerated space dilation operation is given. Results of the numerical experiments of minimization of the two classes of convex piecewise linear functions and quadratic strongly convex functions are presented. To solve the problems C++ implementations of the classical r(α)-algorithm with an adaptive line search ralgb5a and its modified version with accelerated space dilation ralgb5at were used. Obtained results show that for minimization of the piecewise linear functions compared with the classical r(α)-algorithm its modified version requires approximately the same number of iterations to converge but uses a significantly smaller number of multiplication operations. For minimization of the quadratic strongly convex functions modified r(α)-algorithm requires a smaller number of iterations to converge and as a result has a smaller execution time. \u0000Therefore, it is concluded that the variants of the r-algorithm that implements accelerated space dilation operation along directions which approximate the difference of the two successive subgradients may be quite promising since for some classes of functions they might better take into account the shape of the function’s ravines and with appropriate software implementation have a smaller execution time. Keywords: space stretching operator, r(α)-algorithm, piecewise linear function.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47476269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Smart-Systems for Precision Agriculture, Environmental Protection and Healthcare","authors":"V. Romanov, I. Galelyuka, V. Hrusha, H. Antonova, O. Voronenko, A. Kedych, Oleksandra Kovyrova","doi":"10.34229/2707-451x.23.2.7","DOIUrl":"https://doi.org/10.34229/2707-451x.23.2.7","url":null,"abstract":"Appearance of innovative tools of informatics in the world is determined by development of information-communication technology, microelectronics, sensor and biosensor technologies. Spreading of these technologies on precision agriculture, environmental protection and health care gives opportunity to create smart fields, gardens, greenhouses, forests and parks, and also smart health monitors, which estimate the health state of person as in rehabilitation, so in emergency situations.\u0000Results of research of authors in the development of new information technologies and creation of main components of the smart systems for different purposes on this base are shows in this paper.\u0000Main requirements for knowledge bank for precision agriculture and ecological monitoring are defined. Main principles of creating knowledge bank on base of requirements are proposed. The typical smart system models and their development stages are considered. Structure of wireless multilevel networks for the estimation of state of biological objects of different origin and their nodes are described. Developed sensor networks and smart systems for agriculture are considered. Structure of proposed smart system for agriculture and ecological monitoring is given. Approaches for chlorophyll fluorescence induction curves analysis are studied. Results of network testing for the estimation of the autonomous work time of network nodes and possible errors are given.\u0000Wireless sensor network and smart system for remote medical monitoring are described. Diagnostic smart systems for estimation of quality of life are considered. Medical communicator, computer device on base of tablet computer, was used for their development. The short form of Survey Instrument (SF-36) for life quality estimation and abnormal uterine bleeding questionnaire, which was developed in State Scientific Institution \"Center for Innovative Medical Technologies of the National Academy of Sciences of Ukraine\", were embedded in communicator. STEPS questionnaire which was designed for epidemiological monitoring of the prevalence of noncommunicable diseases and their risk factors in the target subpopulations could be added to communicator.\u0000Development of smart systems for estimation of quality of life and prevalence of noncommunicable diseases was made in cooperation with R.E. Kavetsky Institute of Experimental Pathology, Oncology and Radiobiology NAS of Ukraine (department of research management and innovation), Chebotarev Institute of Gerontology of the National Academy of Medical Sciences of Ukraine, Center for Innovative Medical Technologies of the National Academy of Sciences of the Ukraine. Keywords: wireless sensor network, precision agriculture, chlorophyll fluorescence induction, express-diagnostics of plant state, quality of life, SF-36.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49166220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The Law of Nature, which Makes it Necessary to Develop the Fundamental Science of Cybernetics","authors":"Vitaliy A. Vyshinskiy","doi":"10.34229/2707-451x.23.2.1","DOIUrl":"https://doi.org/10.34229/2707-451x.23.2.1","url":null,"abstract":"Understanding the environment ultimately boils down to the exploration of the laws of nature. Many years of experience have shown that not all of these laws are currently within the scope of scientists' attention. This law produces the development of fundamental sciences: physics, chemistry, botany, biology, including cybernetics, thereby defining its subject of research. This law and its connection with the scientific achievements of V.M. Hlushkova are considered in this work. Keywords: cybernetics, physics, chemistry, botany, biology, problem, fundamental.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45522546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An Overview of Algorithms for Solving Vehicle Routing Problems in the Quantum-Classical Cloud","authors":"Leonid Hulianitskyi, V. Korolyov, Oleksandr Khodzinskyi","doi":"10.34229/2707-451x.23.2.3","DOIUrl":"https://doi.org/10.34229/2707-451x.23.2.3","url":null,"abstract":"Introduction. The hope of solving the problem of the avalanche-like growth of requirements for computing power, essential for solving complex routing problems and other problems of combinatorial optimization, relies on the latest quantum computers, in the development of which governments and corporations invest multi-billion investments.\u0000The article examines modern routing algorithms and performs their analysis and verification, if the authors of the algorithm provided appropriate test programs.\u0000The purpose of the article is to review the current state of development in the field of development of routing algorithms for hybrid quantum-classical clouds, analyze them and propose a classification of algorithms.\u0000Results. Modern quantum computers (QCs) make it possible to find approximate solutions to some of mathematical problems faster than classical computers. The inaccuracy of the solutions obtained by the QC is a consequence of physical and technological limitations: calculation errors are caused by thermal noise, a small number of computational elements - qubits and connections between them, which requires the decomposition of the problem and the use of heuristic algorithms.\u0000The analysis of approaches to the solution of optimization problems on QC allows us to single out: quantum response and variational search of eigenvalues based on quantum logic gates as the general directions of development of the vast majority of algorithms for solving routing problems. The considered algorithms reduce the vehicle routing problem to a quadratic unconstrained binary optimization problem, which is isomorphic to the Hamilton-Ising model. In this form, the problem is suitable for embedding in QC, which finds an approximate solution that has the best statistical reliability or corresponds to the quantum state with the lowest energy.\u0000As a separate class, vehicle routing algorithms for classical computers that use quantum computing to accelerate problem solving can be distinguished. For example, neural networks that calculate weighting factors using QC or an ant algorithm that calculates a pheromone trail in a hybrid cloud. It should be mentioned the quantum-inspired algorithms, which are based on software tools for the simulation of QC and the corresponding libraries and allow creating an effective class of algorithms for solving problems of vehicle routing.\u0000Conclusions. Combining hardware quantum annealing with a number of software tools for calculating optimization problems for classical computers in a hybrid quantum-classical cloud service allows to obtain advantages in speed and accuracy of some types of complex optimization problems of a commercial scale, in particular, routing vehicles, which is already bringing substantial profits to a number of corporations. Keywords: vehicle routing problem, quantum computer, annealing, combinatorial optimization, traveling salesman problem, clustering, qubit.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44728348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Wireless Networks of Smart Multisensors and Biosensor Devices for Express Diagnostics of the State of Grape and Fruit-Berry Crops and Quality Control of Winemaking Products","authors":"V. Romanov, I. Galelyuka, O. Voronenko, Oleksandra Kovyrova, H. Antonova, A. Kedych","doi":"10.34229/2707-451x.23.1.6","DOIUrl":"https://doi.org/10.34229/2707-451x.23.1.6","url":null,"abstract":"The application of information and wireless technologies, multisensor and biosensor devices, as well as sensor networks based on them to control the parameters of technological processes in different industries makes it possible to greatly improve the quality of final products and reduce losses of raw materials at all stages of production and storage. This covers both the industrial production of consumer goods and the food and processing industry.\u0000The article describes the developing and testing of network of wireless smart biosensor devices for food industry, namely for controlling the quality of wine, wine materials and food products in the production process.\u0000It is considered the technological process of production of wine materials and wine, as well as parameters that are subject of controlling. The requirements for smart multisensor devices, which are reasonable to use in such technological productions, are formulated. Measuring nodes are built on the basis of amperometric sensors and wireless data transmission units. Structural, functional and principle schemas of measuring devices were developed. The design documentation was created for their production at contract factories.\u0000The integration of wireless data transmission units into measuring nodes made it possible to build wireless sensor networks based on them. Several structures of wireless networks were developed on the base of wireless nodes with different functionality and with using of different wireless data transmission protocols. Hardware and software for wireless network nodes were developed.\u0000It was fulfilled the testing of the multisensor measuring node in autonomous mode, as well as the whole network consisting of several wireless nodes. The test results showed both the weaknesses of the developed devices, which should be eliminated in further researches, and the reasonability of using smart multisensor devices and networks based on them to control the quality of wine materials and wine at different stages of their production and storage.\u0000The work was performed with the support and within the Complex program of scientific research of the National Academy of Sciences of Ukraine \"Smart\" sensor devices of the new generation based on modern materials and technologies.\" Keywords: biosensors, amperometric transducers, smart multisensors, wireless sensor network, wine and food quality control.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49300765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Computer Technology for Construction ε-Solution of the Problem","authors":"V. Zadiraka, I. Shvidchenko","doi":"10.34229/2707-451x.23.1.4","DOIUrl":"https://doi.org/10.34229/2707-451x.23.1.4","url":null,"abstract":"Introduction. Issues of selection and construction of computing resources and methods of their effective use to calculate an approximate solution of the problem with the given accuracy in a limited processor time are considered.\u0000The purpose of the article. Based on the analysis of the total error of the computational algorithm, to develop a computer technology (CT) for the construction and solution of the ε-problem and illustrate it on the problems of integrating rapidly oscillating functions and digital signal processing.\u0000The results. The general scheme for solving problems of applied and computational mathematics using computer technology is presented.\u0000Computer technology includes the formation of a certain set of computing resources, the method and conditions of their use to build a computing process, the result of which should be the solution of the problem.\u0000The main attention is paid to the choice of a computer calculations model (input data about the problem, the class of problems of computational mathematics, the class of computational algorithms for calculating the solution, evaluation of quality characteristics and parameters of the computational process, computer architecture, software, restrictions on the value of quality characteristics), the construction of quality characteristic estimates, the possibility of adjusting the mathematical model, the construction of the computational process and the performance of calculations.\u0000The issues of determining the optimal parameters of computational algorithms-programs for finding ε-solution are investigated, which are demonstrated on two classes of problems – integration of rapidly oscillating functions and correlation analysis of random processes.\u0000Conclusions. The issues of selection and construction of computing resources and methods of their effective use to calculate an approximate solution of the problem with the given accuracy in a limited processor time are considered. The elements of computer technology for solving specific problems on the examples of problems of integration of rapidly oscillating functions and correlation analysis of random processes are applied. Keywords: total error, computer technology, rounding error, rapidly oscillating functions.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42853569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Application of the \"Plazmontest\" Software and Hardware Complex for the Determination of Spermine Concentration","authors":"T. Lebyedyeva, Y. Minov, Maksym Prylutskyi, P. Sutkovyi, Y. Frolov, P. Shpylovyy","doi":"10.34229/2707-451x.23.1.5","DOIUrl":"https://doi.org/10.34229/2707-451x.23.1.5","url":null,"abstract":"Introduction. One of the main areas of application of SPR sensors is biochemical analysis. The \"Plasmontest\" device, developed at the Institute of Cybernetics of the National Academy of Sciences of Ukraine, was used for rapid diagnosis of various concentrations of the tumor marker spermine. Colloidal gold nanoparticles stabilized by sodium citrate were used as a sensitive layer for the detection of biogenic polyamines as markers of prostate cancer development. Two methods of conducting an experiment on spermine detection using colloidal gold nanoparticles are proposed.\u0000The purpose of the paper is to show the possibility of detecting the tumor marker spermine in different concentrations using the \"Plasmontest\" device. To solve this problem it is necessary to provide a series of experiments on the application of colloidal gold solutions with different methods of deposition of reagents.\u0000The results. With the help of the \"Plasmontest\" software and technical complex, a series of biochemical experiments were carried out using solutions of spermine in the concentration range of 50 nM - 500 nM and colloidal gold in a concentration of 3·10-4 M. Two methods of applying reagents were proposed: spermine – colloidal gold and colloidal gold – spermine. Both techniques made it possible to observe a shift in the SPR angle, which means the adsorption of spermine on the surface of a gold film with colloidal gold nanoparticles.\u0000Conclusions. It is shown that the developed software and technical complex \"Plasmontest\" allows monitoring the course of biochemical reactions at low concentrations of the investigated reagents. Studies of the possibility of detecting spermine in different concentrations in the presence of gold nanoparticles using the PPR method open the prospect of creating a biosensor for spermine. Keywords: surface plasmon resonance, biosensor, nanoparticles, spermine.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48690670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Cybernetics and Directed Evolution","authors":"O. Palagin","doi":"10.34229/2707-451x.23.1.1","DOIUrl":"https://doi.org/10.34229/2707-451x.23.1.1","url":null,"abstract":"Results. The place and role of cybernetics methods for solving the global problem of directed evolution are considered. The author investigates the eventual phenomenon of the interaction of two coryphaei of Ukrainian science V.I. Vernadsky and V.M. Glushkov in the formation of these scientific fields and the synergistic effect of this interaction. A special attention is paid to the applied aspects of using the scientific theories when implementing complex topical processes at the state and global levels.\u0000The list of the applied fields of cybernetics with their implementation in the projects of the Institute of Cybernetics under the leadership of V.M. Glushkov is endless, and his scientific ideas are successfully brought to life today. Keywords: cognitive intelligent technology, transdisciplinary scientific research (TSR), systemology of TSR, scientific picture of the world, directed evolution, noospheric theory, ontological engineering, convergence of technologies, consolidated intelligence, collective consciousness, research design, eventual analysis.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47729817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Fuzzy Cluster Analysis: Pseudometrics and Fuzzy Clusters","authors":"I. Riasna","doi":"10.34229/2707-451x.23.1.3","DOIUrl":"https://doi.org/10.34229/2707-451x.23.1.3","url":null,"abstract":"Introduction. Clustering problems arise in various spheres of human activity. In cases where there are no initial data sufficient for statistical analysis or information obtained from experts is used, fuzzy models are proposed that take into account different types of uncertainty and more argumentatively reflect real situations that model systems of different purposes. Particular attention is drawn to invariance in problems with different types of data measured in different scales according to the classification of S. Stevens. It is known that when solving cluster analysis problems using the transitive closure operation with respect to the equivalence that is obtained, such connections between objects as similarity and dissimilarity are changed. Therefore, it is necessary to take into account the problem of adequacy when developing models and algorithms for solving problems of fuzzy cluster analysis. \u0000The purpose of the paper is an analyzing the problem of adequacy of the results of fuzzy cluster analysis on the introduction of metrics and pseudometrics on fuzzy sets in the presence of several qualitative and quantitative characteristics of objects. Propose an approach that ensures the adequacy of pseudometrics, that is, provides invariance with respect to permissible transformations of the values of fuzzy features, and also ensures the division of objects into equivalence classes without distorting the distance between them.\u0000Results. Axiomatic definitions of a fuzzy cluster and a fuzzy α level cluster are proposed, which are introduced as fuzzy sets of elements similar to certain elements of a given set, if the condition is met: the dissimilarity ratio must be an invariant pseudometric. This condition is ensured by the use of the linguistic correlation coefficient when calculating fuzzy relations of similarity and dissimilarity. Based on the definition of a fuzzy cluster of α level and threshold conorm, the distance between fuzzy clusters of α level is determined.\u0000Conclusions. The proposed approach can be the basis for the development of algorithms for solving cluster analysis problems. This provides a meaningful interpretation of the obtained clusters, and the possibility of clarifying the results in further studies of their structure. Keywords: fuzzy set, conorm, metric, pseudometric, fuzzy similarity relation, fuzzy cluster.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44851776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}