Общие схемы правил комбинирования тел свидетельств и апостериорные характеристики качества комбинирования
Some general schemes and examples of aggregation of two belief functions into a single belief function are considered in this paper. We find some sufficient conditions of change of ignorance when evidences are combined with the help of various rules. It is shown that combining rules can be regarded as pessimistic or optimistic depending on the sign of the change of ignorance after applying.
The qualitative characteristics of the combining evidence with the help of Dempster’s rule with discounting is studied in this paper in the framework of Dempster-Shafer theory. The discount coefficient (discounting rate) characterizes the reliability of information source. The conflict between evidence and change of ignorance after applying combining rule are considered in this paper as important characteristics of quality of combining. The quantity of ignorance is estimated with the help of linear imprecision index. The set of crisp and fuzzy discounting rates for which the value of ignorance after combining does not increases is described.
The article is dedicated to the method of aggregation of financial analysts’ recommendations in the framework of the evidence theory. This method considered on the example of Russian stock market and the quality of the obtained results was compared with the classical consensus forecast. It is shown that the combination rules, which are widely developed in the theory of evidence, allow aggregating the recommendations of analysts taking into account the historical reliability of information sources, the nature of the taken decisions (pessimism-optimism), the conflict between forecasts and recommendations, etc. In most cases it turned out that, obtained aggregated forecasts are more accurate than consensus forecast.
This paper is devoted to modern approaches to the estimation of external conflict in the theory of evidence based on axioms. The conflict measure is defined on the set of beliefs obtained from several sources of information. It is shown that the conflict measure should be a monotone set function with respect to sets of beliefs. Some robust procedures for evaluation of conflict measure that are stable to small changes in evidences are introduced and discussed. The analysis of conflict among forecasts about the value of shares of Russian companies of investment banks is presented. In this analysis the conflict measure estimates inconsistency of recommendations of investment banks, while the Shapley values of this measure on the set of evidences characterize the contribution of each investment bank to the overall conflict. The relationship between conflict and precision of forecasts is also investigated.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability
The geographic information system (GIS) is based on the first and only Russian Imperial Census of 1897 and the First All-Union Census of the Soviet Union of 1926. The GIS features vector data (shapefiles) of allprovinces of the two states. For the 1897 census, there is information about linguistic, religious, and social estate groups. The part based on the 1926 census features nationality. Both shapefiles include information on gender, rural and urban population. The GIS allows for producing any necessary maps for individual studies of the period which require the administrative boundaries and demographic information.
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXPNP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study this question in a more restricted setting: what is the computational complexity of sparse sets that are selfreducible? It follows from earlier work of Lozano and Torán (in: Mathematical systems theory, 1991) that EXPNP does not have sparse selfreducible hard sets. We define a natural version of selfreduction, tree-selfreducibility, and show that NEXP does not have sparse tree-selfreducible hard sets. We also construct an oracle relative to which all of EXP is reducible to a sparse tree-selfreducible set. These lower bounds are corollaries of more general results about the computational complexity of sparse sets that are selfreducible, and can be interpreted as super-polynomial circuit lower bounds for NEXP.