?
Measures of conflict, basic axioms and their application to the clusterization of a body of evidence
Fuzzy Sets and Systems. 2022. Vol. 446. P. 277-300.
Andrey G. Bronevich, Alexander E. Lepskiy
There are several approaches for evaluating conflict within belief functions. In this paper, we develop one of them based on axioms and show its connections to the decomposition approach. We describe a class of conflict measures satisfying this system of axioms and show that measuring conflict can be realized through the clusterization of a body of evidence. We also show that well-known conflict measures like the auto-conflict measure and the measure of dissonance do not satisfy the proposed system of axioms. We also tackle the problem of simplifying a body of evidence based on clusterization and show the application of developed theoretical constructions for data processing.
Bronevich A., Розенберг И. Н., International Journal of Approximate Reasoning 2015 Vol. 56 P. 122-136
In the paper we investigate the criteria of choosing generalized Dempster–Shafer rules for aggregating sources whose information is represented by belief functions. The approach is based on measuring various types of uncertainty in information and we use for this purpose in particular linear imprecision indices. Some results concerning properties of such rules are also presented. ...
Added: March 5, 2015
Sergey S. Ketkov, European Journal of Operational Research 2024 Vol. 313 No. 2 P. 602-615
This study addresses a class of linear mixed-integer programming (MILP) problems that involve uncertainty in the objective function parameters. The parameters are assumed to form a random vector, whose probability distribution can only be observed through a finite training data set. Unlike most of the related studies in the literature, we also consider uncertainty in ...
Added: October 31, 2023
Bronevich A., Rozenberg I., , in : Belief Functions: Theory and Applications 5th International Conference, BELIEF 2018, Compiègne, France, September 17-21, 2018, Proceedings. Vol. 11069.: Springer, 2018. P. 31-38.
The aim of this paper is to show that the Kantorovich problem, well known in models of economics and very intensively studied in probability theory in recent years, can be viewed as the basis of some constructions in the theory of belief functions. We demonstrate this by analyzing specialization relation for finitely defined belief functions ...
Added: October 8, 2018
Bronevich A., Розенберг И. Н., , in : Belief Functions: Theory and Applications. Vol. 8764.: Dordrecht, L., Heidelberg, NY : Springer, 2014. P. 21-28.
In the paper we investigate the criteria of choosing generalized Dempster-Shafer rules for aggregating sources of information presented by belief functions. The approach is based on measuring various types of uncertainty in information and we use for this linear imprecision indices. Some results concerning properties of such rules are also presented. ...
Added: March 5, 2015
Andrey G. Bronevich, Rozenberg I., , in : Lecture Notes in Artificial Intelligence. Vol. 9861: Belief Functions: Theory and Applications.: Springer, 2016. P. 137-145.
In the paper we argue that aggregation rules in the theory of belief functions should be in accordance with underlying decision models, i.e. aggregation produced in conjunctive manner has to produce the order embedded to the union of partial orders constructed in each source of information; and if we take models based on imprecise probabilities, ...
Added: October 17, 2016
Bronevich A., Penikas H. I., Lepskiy A. et al., / Высшая школа экономики. Серия WP7 "Математические методы анализа решений в экономике, бизнесе и политике". 2015. № 10.
There is one of the investment strategies on a stock market called a choice of securities including
its buying and sale based on financial analysts’ recommendations. The distinguishing characteristic of
these recommendations is that in each of it for the same securities there can be different recommendations
(«Buy», «Sell», «Hold») as well as for one type of recommendations ...
Added: December 2, 2015
Springer, 2016
The theory of belief functions, also referred to as evidence theory or Dempster-Shafer theory, is a well-established general framework for reasoning with uncertainty. It has well-understood connections to other frameworks, such as probability, possibility, and imprecise probability theories. First introduced by Arthur P. Dempster in the context of statistical inference, the theory was later developed ...
Added: September 28, 2016
Borchmann D., Hanika T., Obiedkov S., Discrete Applied Mathematics 2020 Vol. 273 P. 30-42
We propose an algorithm for learning the Horn envelope of an arbitrary domain using an expert, or an oracle, capable of answering certain types of queries about this domain. Attribute exploration from formal concept analysis is a procedure that solves this problem, but the number of queries it may ask is exponential in the size ...
Added: October 29, 2019
Aaij R., Abdelmotteleb A. S., Abellan Beteta C. et al., The European Physical Journal C - Particles and Fields 2023 Vol. 83 Article 543
https://link.springer.com/article/10.1140/epjc/s10052-023-11673-x#Abs1 ...
Added: December 4, 2023
Springer, 2012
Added: January 29, 2013
Litvin Y. V., Абрамов И. В., Технологии техносферной безопасности 2016 № 66
Advanced approach to the assessment of a random time of arrival fire fighting calculation on the object of protection, the time of their employment and the free combustion. There is some quantitative assessments with the review of analytical methods and simulation ...
Added: August 27, 2016
Gostev I. M., М. : Юрайт, 2016
В настоящее время компьютерные науки стремительно развиваются. Новые версии операционных систем появляются каждые полтора-два года, поэтому было принято решение о включении в данную книгу такого материала, который не будет устаревать. Содержание учебника представляет собой некоторые наиболее общие принципы построения операционных систем, которые были разработаны более 50 лет назад и практически не изменились за прошедшее время. ...
Added: October 13, 2009
Beklemishev L. D., Оноприенко А. А., Математический сборник 2015 Т. 206 № 9 С. 3-20
We formulate some term rewriting systems in which the number of computation steps is finite for each output, but this number cannot be bounded by a provably total computable function in Peano arithmetic PA. Thus, the termination of such systems is unprovable in PA. These systems are derived from an independent combinatorial result known as the Worm ...
Added: March 13, 2016
Ружицкая Д. Д., САМОЙЛЕНКО А. А., Иванов А. Д. et al., Optoelectronics, Instrumentation and Data Processing 2017 Vol. 54 No. 1 P. 1-8
This paper presents an algorithm for processing the transmission spectra of whisperinggallery optical microcavities for use as a nanoparticle detector. The algorithm is based on the broadening of the microcavity resonance curve during precipitation of nanoparticles on the microcavity surface. Experimental results on the detection of particles are compared with Langmuir adsorption theory. The contribution ...
Added: May 25, 2018
Kiselyova N. N., Dudarev V.A., Korzhuev M. A., Inorganic Materials: Applied Research 2016 Vol. 7 No. 1 P. 34-39
A database (DB) on the bandgap of inorganic substances available via the Internet (http://bg.imetdb.ru) was developed for the information service of specialists in the sphere of inorganic chemistry and materials science. The DB is integrated with other information systems on the properties of inorganic substances and materials, which provides the search of a wide range ...
Added: February 23, 2016
М. : Издательский центр «Российский государственный гуманитарный университет», 2019
Сборник включает 27 докладов международной конференции по компьютерной лингвистике и интеллектуальным технологиям «Диалог 2019», не вошедшие в ежегодник «Компьютерная лингвистика и интеллектуальные технологии», но рекомендованные Программным Комитетом к представлению на конференции. Для специалистов в области теоретической и прикладной лингвистики и интеллектуальных технологий. ...
Added: December 10, 2019
Toldova S., Azerkovich I., Гришина Ю. et al., / НИУ ВШЭ. Series WP BRP "Linguistics". 2015.
Building benchmark corpora in the domain of coreference and anaphora resolution is an important task for developing and evaluating NLP systems and models. Our study is aimed at assessing the feasibility of enhancing corpora with information about coreference relations. The annotation procedure includes identification of text segments that are subjects to annotation (markables), marking their ...
Added: December 15, 2015
Shuranov E., / Cornell University. Series Computer Science "arxiv.org". 2021.
Text encodings from automatic speech recognition (ASR) transcripts and audio representations have shown promise in speech emotion recognition (SER) ever since. Yet, it is challenging to explain the effect of each information stream on the SER systems. Further, more clarification is required for analysing the impact of ASR's word error rate (WER) on linguistic emotion ...
Added: February 14, 2023
Aaij R., Abdelmotteleb A. S., Abellán Beteta C. et al., Physical Review Letters 2022 Vol. 129 No. 9 Article 091801
The first study of the angular distribution of μþμ− pairs produced in the forward rapidity region via the Drell-Yan reaction pp → γ=Z þ X → lþl− þ X is presented, using data collected with the LHCb detector at a center-of-mass energy of 13 TeV, corresponding to an integrated luminosity of 5.1 fb−1. The coefficients ...
Added: December 29, 2022
Svetlana Maltseva, Kornilov V., Barakhnin V. et al., Complexity 2022 Vol. 2022 Article 5714395
We can observe self-organization properties in various systems. However, modern networked dynamical sociotechnical systems have some features that allow for realizing the benefits of self-organization in a wide range of systems in economic and social areas. The review examines the general principles of self-organized systems, as well as the features of the implementation of self-organization ...
Added: April 18, 2022
Karpov V. E., Karpova I. P., Procedia Engineering 2015 Vol. 100 P. 1459-1468
Work solutions are proposed for problems of leader definition and role distribution in homogeneous groups of robots. It is shown that transition from a swarm to a collective of robots with hierarchical organization is possible using exclusively local interaction. The local revoting algorithm is central to the procedure for choice of leader while redistribution of roles can ...
Added: March 14, 2015
М. : National Instruments Russia, 2017
Содержание сборника составляют доклады с результатами оригинальных исследований и технических решений, ранее не публиковавшиеся. Мы надеемся, что предлагаемый сборник окажется полезным для специалистов, работающих в различных областях науки и техники, для широкого круга преподавателей, аспирантов и студентов ВУЗов, а также для преподавателей средних школ и технических колледжей. ...
Added: May 10, 2017
Furmanov K. K., Nikol'skii I. M., Computational Mathematics and Modeling 2016 Vol. 27 No. 2 P. 247-253
Added: December 22, 2016
Dneprovskaya N., Шевцова И. В., Бизнес-информатика 2023 Т. 17 № 2 С. 20-40
The purpose of this study is a conceptual description of the implementation of knowledge management systems (KMS) as a mechanism for universities’ strategic development. Knowledge management (KM) practice from around the world proved the positive influence of KMS on productivity of educational institutions. The theoretical provisions and concept for KMS are determined based on an ...
Added: August 2, 2023