作为优化问题的综合评级机制辨识

V. Burkov, N. Korgin, V.A. Sergeev
{"title":"作为优化问题的综合评级机制辨识","authors":"V. Burkov, N. Korgin, V.A. Sergeev","doi":"10.1109/MLSD49919.2020.9247638","DOIUrl":null,"url":null,"abstract":"A problem of identification of an integrated ranking mechanism is considered. We present a perspective approach to the task of identification of an integrated ranking mechanism - we show that representation of any such mechanism in one-hot encoded form allows us to formulate such a task as an optimization problem that may be solved with a wide variety of optimization techniques. The approach suggested is illustrated by several examples of identification or approximation of learning sets generated by several Boolean functions.","PeriodicalId":103344,"journal":{"name":"2020 13th International Conference \"Management of large-scale system development\" (MLSD)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Identification of Integrated Rating Mechanisms as Optimization Problem\",\"authors\":\"V. Burkov, N. Korgin, V.A. Sergeev\",\"doi\":\"10.1109/MLSD49919.2020.9247638\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A problem of identification of an integrated ranking mechanism is considered. We present a perspective approach to the task of identification of an integrated ranking mechanism - we show that representation of any such mechanism in one-hot encoded form allows us to formulate such a task as an optimization problem that may be solved with a wide variety of optimization techniques. The approach suggested is illustrated by several examples of identification or approximation of learning sets generated by several Boolean functions.\",\"PeriodicalId\":103344,\"journal\":{\"name\":\"2020 13th International Conference \\\"Management of large-scale system development\\\" (MLSD)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 13th International Conference \\\"Management of large-scale system development\\\" (MLSD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MLSD49919.2020.9247638\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 13th International Conference \"Management of large-scale system development\" (MLSD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MLSD49919.2020.9247638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

考虑了综合排序机制的识别问题。我们提出了一种识别综合排名机制任务的透视方法——我们表明,任何这样的机制在一个热编码形式的表示允许我们将这样的任务表述为一个优化问题,这个问题可以用各种各样的优化技术来解决。提出的方法是由几个布尔函数生成的学习集的识别或近似的几个例子说明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Identification of Integrated Rating Mechanisms as Optimization Problem
A problem of identification of an integrated ranking mechanism is considered. We present a perspective approach to the task of identification of an integrated ranking mechanism - we show that representation of any such mechanism in one-hot encoded form allows us to formulate such a task as an optimization problem that may be solved with a wide variety of optimization techniques. The approach suggested is illustrated by several examples of identification or approximation of learning sets generated by several Boolean functions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信