METHOD OF SYNTHESIS OF THE INTEGRATED ASSESSMENT SYSTEM

V. Burkov, I. Burkova, A. Shchepkin
{"title":"METHOD OF SYNTHESIS OF THE INTEGRATED ASSESSMENT SYSTEM","authors":"V. Burkov, I. Burkova, A. Shchepkin","doi":"10.14529/ctcr200407","DOIUrl":null,"url":null,"abstract":"Systems of complex estimation (CO) based on a dichotomous tree of criteria and a set of criteria convolution matrices (generalized criteria) are widely used in the evaluation of a wide variety of ob-jects. Purpose of the study. To build a CO system for a given set of criteria, you need to solve two problems: 1. To choose the structure of the dichotomous tree of criteria. 2. To define matrix convolutions of pairs of criteria (generalized criteria) at each vertex of the tree (except for hanging ones). The article deals with the second problem, i.e. the problem of determining matrices the criteria convolution. In practice, this task is often solved based on expert opinions. Materials and methods. Let us assume that there are a set of options (a variant is a set of criteria estimates) and experts have defined complex estimates for each option from this set. The task is to define matrix convolu-tions at each vertex of the tree such that the CO of each variant in the resulting system CO is equal to the EXPERT estimate. The paper defines a class of unified CO mechanisms that meet the following conditions: 1. All matrices of the unified complex estimation mechanism have the same dimension. 2. For any matrix all rows are different and all columns are different. 3. All matrices are monotonous in rows and columns; 4. If all the variant scores are equal to a certain score, then the complex score is equal to this score. Results. Two cases are considered. In the first case, experts can give estimates of options with any set of criteria estimates. In the second case, experts can give a CO of only complete options, that is, options that contain estimates of all criteria. For the first case, an efficient algorithm with an estimate of computational complexity of the order of lm2 is proposed, where l is the number of crite-ria, and m is the number of gradations of the rating scale. The algorithm makes significant use of the 4 property of unified mechanisms. For the second case, we propose a method for solving the problem by constructing “top-down” matrices, i.e. constructing a matrix for the root vertex, then for adjacent ones, and so on. Conclu-sion. Thus, the paper proposes algorithms for the synthesis of unified mechanisms for complex eva-luation, in which the number of required expert options is minimal.","PeriodicalId":338904,"journal":{"name":"Bulletin of the South Ural State University. Ser. Computer Technologies, Automatic Control & Radioelectronics","volume":"161 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the South Ural State University. Ser. Computer Technologies, Automatic Control & Radioelectronics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14529/ctcr200407","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Systems of complex estimation (CO) based on a dichotomous tree of criteria and a set of criteria convolution matrices (generalized criteria) are widely used in the evaluation of a wide variety of ob-jects. Purpose of the study. To build a CO system for a given set of criteria, you need to solve two problems: 1. To choose the structure of the dichotomous tree of criteria. 2. To define matrix convolutions of pairs of criteria (generalized criteria) at each vertex of the tree (except for hanging ones). The article deals with the second problem, i.e. the problem of determining matrices the criteria convolution. In practice, this task is often solved based on expert opinions. Materials and methods. Let us assume that there are a set of options (a variant is a set of criteria estimates) and experts have defined complex estimates for each option from this set. The task is to define matrix convolu-tions at each vertex of the tree such that the CO of each variant in the resulting system CO is equal to the EXPERT estimate. The paper defines a class of unified CO mechanisms that meet the following conditions: 1. All matrices of the unified complex estimation mechanism have the same dimension. 2. For any matrix all rows are different and all columns are different. 3. All matrices are monotonous in rows and columns; 4. If all the variant scores are equal to a certain score, then the complex score is equal to this score. Results. Two cases are considered. In the first case, experts can give estimates of options with any set of criteria estimates. In the second case, experts can give a CO of only complete options, that is, options that contain estimates of all criteria. For the first case, an efficient algorithm with an estimate of computational complexity of the order of lm2 is proposed, where l is the number of crite-ria, and m is the number of gradations of the rating scale. The algorithm makes significant use of the 4 property of unified mechanisms. For the second case, we propose a method for solving the problem by constructing “top-down” matrices, i.e. constructing a matrix for the root vertex, then for adjacent ones, and so on. Conclu-sion. Thus, the paper proposes algorithms for the synthesis of unified mechanisms for complex eva-luation, in which the number of required expert options is minimal.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
综合评价体系的综合方法
基于准则二分类树和一组准则卷积矩阵(广义准则)的复杂估计系统(CO)被广泛应用于各种对象的评估。研究目的:要为给定的一组标准构建CO系统,需要解决两个问题:1。选择二叉树结构的准则。2. 在树的每个顶点(除了悬挂的顶点)定义准则对(广义准则)的矩阵卷积。本文讨论了第二个问题,即用准则卷积确定矩阵的问题。在实践中,这个任务通常是根据专家的意见来解决的。材料和方法。让我们假设有一组选项(变体是一组标准估计),专家已经为这组选项中的每个选项定义了复杂的估计。任务是在树的每个顶点定义矩阵卷积,使得结果系统CO中每个变量的CO等于EXPERT估计。本文定义了一类满足以下条件的统一CO机制:统一复估计机制的所有矩阵具有相同的维数。2. 对于任何矩阵,所有行和列都是不同的。3.所有矩阵的行和列都是单调的;4. 如果所有的变体分数都等于某一分数,那么复合分数就等于这个分数。结果。考虑两种情况。在第一种情况下,专家可以用任何一组标准估计给出选项的估计。在第二种情况下,专家可以只给出完整选项的CO,即包含所有标准估计的选项。对于第一种情况,提出了一种计算复杂度估计为lm2数量级的高效算法,其中l为标准数,m为评级尺度的等级数。该算法充分利用了统一机构的4个性质。对于第二种情况,我们提出了一种通过构造“自顶向下”矩阵来解决问题的方法,即为根顶点构造矩阵,然后为相邻顶点构造矩阵,以此类推。结论。因此,本文提出了一种算法,用于综合统一的复杂评估机制,其中所需专家选项的数量最少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Formalization of Basic Processes and Mathematical Model of the System for Monitoring and Analysis of Publications of Electronic Media Determination of the Parameters of the La¬mination of a Bimetallic Plate by Means of Active Thermal Non-Destructive Control Perm Region Natural Resource Potential Forecasting Using Machine Learning Models To the Question of Determining the Barometric Height by a Mechanical Altimeter and Air Signal System Formalism of Writing Out of Manipulators Dynamic Equation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1