N. Tymofijeva, Natalia Ye. Pavlenko, Svitlana A. Shevchenko
{"title":"Ways of Classifying Digital Platforms","authors":"N. Tymofijeva, Natalia Ye. Pavlenko, Svitlana A. Shevchenko","doi":"10.15407/csc.2024.02.010","DOIUrl":null,"url":null,"abstract":"Introduction. Interest in the study of digital platforms (DP) is due to their prevalence and the dependence of this phenomenon on the possibilities of using information technologies. The growing distribution and great potential of the DP is connected not only with the use of new hardware and software, but also with the integration of digital technologies into business processes. The need for a deeper understanding of the differences and similarities of various CPUs prompts researchers to turn to the fundamental mechanism of knowledge organization – classification. From a practical point of view, the classification helps to compare different CPUs and allows users to choose the one that provides the desired results. Formulation of the problem. The problem of CPUs classification is to identify specific and common characteristics for building clusters using different approaches. When modeling and solving the classification problem, static methods and machine learning methods are used. The most widespread of them are the method of nearest neighbors and the method of support vectors. The theory of combinatorial optimization was used to build the mathematical model. The approach proposed. To build a mathematical model of the classification problem, the theory of combinatorial optimization was used, which allows to investigate some properties of this problem. The argument of the objective function in it is the division of the -element set into subsets. This combinatorial configuration can be either with or without repetitions, either finite or infinite. When finding the optimal result, a situation of uncertainty arises, which is related to the structure of the argument of the objective function which is a combinatorial configuration. Conclusion. The classification problem belongs to a broad class of partitioning problems. In it, the characteristics of the clusters are known, the objects that need to be determined, to which class they belong, are analyzed not simultaneously, but by groups or individual elements. Since the result is determined not simultaneously, but by a partial objective function, the classification problem belongs to the dynamic problems of combinatorial optimization. The classification of digital platforms is carried out by heuristic methods, in particular the nearest neighbor method. Both one and a set of common characteristics characteristic of certain CPUs are used as criteria.","PeriodicalId":33554,"journal":{"name":"Control Systems and Computers","volume":"9 6","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Control Systems and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15407/csc.2024.02.010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Introduction. Interest in the study of digital platforms (DP) is due to their prevalence and the dependence of this phenomenon on the possibilities of using information technologies. The growing distribution and great potential of the DP is connected not only with the use of new hardware and software, but also with the integration of digital technologies into business processes. The need for a deeper understanding of the differences and similarities of various CPUs prompts researchers to turn to the fundamental mechanism of knowledge organization – classification. From a practical point of view, the classification helps to compare different CPUs and allows users to choose the one that provides the desired results. Formulation of the problem. The problem of CPUs classification is to identify specific and common characteristics for building clusters using different approaches. When modeling and solving the classification problem, static methods and machine learning methods are used. The most widespread of them are the method of nearest neighbors and the method of support vectors. The theory of combinatorial optimization was used to build the mathematical model. The approach proposed. To build a mathematical model of the classification problem, the theory of combinatorial optimization was used, which allows to investigate some properties of this problem. The argument of the objective function in it is the division of the -element set into subsets. This combinatorial configuration can be either with or without repetitions, either finite or infinite. When finding the optimal result, a situation of uncertainty arises, which is related to the structure of the argument of the objective function which is a combinatorial configuration. Conclusion. The classification problem belongs to a broad class of partitioning problems. In it, the characteristics of the clusters are known, the objects that need to be determined, to which class they belong, are analyzed not simultaneously, but by groups or individual elements. Since the result is determined not simultaneously, but by a partial objective function, the classification problem belongs to the dynamic problems of combinatorial optimization. The classification of digital platforms is carried out by heuristic methods, in particular the nearest neighbor method. Both one and a set of common characteristics characteristic of certain CPUs are used as criteria.
导言。对数字平台(DP)的研究之所以引起人们的兴趣,是因为数字平台(DP)非常普遍,而且这种现象与使用信息技术的可能性息息相关。数字平台的日益普及和巨大潜力不仅与新硬件和软件的使用有关,还与将数字技术融入业务流程有关。由于需要深入了解各种中央处理器的异同,研究人员转而研究知识组织的基本机制--分类。从实用的角度来看,分类有助于比较不同的中央处理器,让用户选择能提供所需结果的中央处理器。问题的提出。中央处理器分类的问题是确定使用不同方法构建集群的具体和共同特征。在建模和解决分类问题时,会用到静态方法和机器学习方法。其中最常用的是近邻法和支持向量法。组合优化理论被用来建立数学模型。提出的方法为了建立分类问题的数学模型,我们使用了组合优化理论来研究这个问题的某些特性。其中目标函数的参数是将元素集划分为子集。这种组合配置既可以有重复,也可以没有重复,既可以是有限的,也可以是无限的。在寻找最优结果时,会出现不确定的情况,这与目标函数参数的结构有关,而目标函数参数是一种组合配置。结论分类问题属于一大类分区问题。在这一问题中,群组的特征是已知的,需要确定的对象及其所属类别不是同时分析的,而是按组或单个元素分析的。由于结果不是同时确定的,而是由部分目标函数决定的,因此分类问题属于组合优化的动态问题。数字平台的分类采用启发式方法,特别是近邻法。某些 CPU 的一个和一组共同特征都被用作标准。