SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Extended search

Träfflista för sökning "swepub ;lar1:(oru);srt2:(1985-1989);pers:(Driankov Dimiter 1952)"

Search: swepub > Örebro University > (1985-1989) > Driankov Dimiter 1952

  • Result 1-3 of 3
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Driankov, Dimiter, 1952- (author)
  • An outline of a fuzzy sets approach to decision making with interdependent goals
  • 1987
  • In: Fuzzy sets and systems (Print). - : Elsevier. - 0165-0114 .- 1872-6801. ; 21:3, s. 275-288
  • Journal article (peer-reviewed)abstract
    • The aim of the present paper is to outline a formal framework for dealing with the problem of decision making with multiple interdependent goals. The approach uses the idea of aspiration levels in order to bridge the gap between the prescriptive and the descriptive approaches thus allowing the problems of evaluation, choice and generation of alternatives to be treated in a coherent formal framework. On the other hand the approach recognizes the existance of interdependent and very often conflicting goals and suggests that in the case when the relationships between the goals can not be modelled by means of mathematical equations one should employ some techniques for knowledge representation based on fuzzy production rules and basic concepts from the theory of approximate reasoning.
  •  
2.
  • Driankov, Dimiter, 1952- (author)
  • Inference with consistent probabilities in expert systems
  • 1989
  • In: International journal of intelligent systems. - : John Wiley & Sons. - 0884-8173. ; 4:1, s. 1-21
  • Journal article (peer-reviewed)abstract
    • The objective of the present article is twofold: first, to provide ways for eliciting consistent a priori and conditional probabilities for a set of events representing pieces of evidence and hypotheses in the context of a rule based expert system. Then an algorithm is proposed which uses the least possible number of a prior and conditional probabilities as its input and which computes the lower and upper bounds for higher order conditional and joint probabilities, so that these be consistent with the input probabilities provided. In the case, when inconsistent lower and upper bounds are obtained, it is suggested how the latter can be turned into consistent ones, by changing the values of only these input probabilities which are directly represented in the higher order probability under consideration. Secondly, a number of typical cases with respect to the problems of aggregation and propagation of uncertainty in expert systems is considered. It is shown how these can be treated by using higher order joint probabilities. For this purpose no global assumptions for independence of evidence and for mutual exclu-siveness of hypotheses are required, since the presence of independent and/or dependent pieces of evidence, as well as the presence of mutually exclusive hypotheses, is explicitly encoded in the input probabilities and thus, such a presence is automatically detected by the algorithm when computing higher order joint probabilities.
  •  
3.
  • Driankov, Dimiter, 1952- (author)
  • Uncertainty calculus with verbally defined belief‐intervals
  • 1986
  • In: International Journal of Intelligent Systems. - : John Wiley & Sons. - 0884-8173 .- 1098-111X. ; 1:4, s. 219-246
  • Journal article (peer-reviewed)abstract
    • The intended purpose of the present article is two-fold: first, introducing an interval-like representation of uncertainty that is an adequate summary of the following two items of information: a report on how strongly the validity of a proposition is supported by a body of evidence and a report on how strongly the validity of its negation is supported. A representation of this type is called a beliefinterval and is introduced as a subinterval of a certain verbal scale consisting of nine linguistic estimates expressing the amount of support provided for the validity of a proposition and/or its negation; each linguistic estimate is represented as a fuzzy number in the interval [0,1]. A belief-interval is bounded from below by an estimate indicating the so-called degree of support and from above by an estimate indicating the so-called degree of plauibility. The latter is defined as the difference between a fuzzy number representing the maximal degree of support that might be provided for a proposition in general and a fuzzy number expressing the degree of support provided for the validity of the negation of the proposition under consideration. The so-introduced degrees of support and plausibility of a proposition are subjective measurements provided by the expert on the basis of some negative and/or positive evidence available to him. Thus, these two notions do not have the same measure-based origins as do the set-theoretic measures of support and plausibility proposed by G. Shafer, neither do they coincide with the possibility and necessity measures proposed by L. Zadeh. The main difference is that in our case the degree of plausibility might be, in cases of contradictory beliefs, less than its corresponding degree of support. Three types of belief-intervals are identified on the basis of the different amounts of support that might be provided for the validity of a proposition and/or its negation, namely balanced, unbalanced, and contradictory belief-intervals. The second objective of this article is to propose a calculus for the belief-intervals by extending the usual logical connectives and, or, negation, and implies. Thus, conjunctive and disjunctive operators are introduced using the Dubois' parametrized family of T-norms and their dual T-conorms. The parameter Q characterizing the latter is being interpreted as a measure of the strength of these connectives and further interpretation of the notion of strength is done in the cases of independent and dependent evidence. This leads to the introduction of specific conjunctive and disjunctive operators to be used separately in each of the latter two cases. A negation operator is proposed with the main purpose of determining the belief-interval to be assigned to the negation of a particular proposition, given the belief-interval of the proposition alone. A so-called aggregation operator is introduced with the purpose of aggregating multiple belief-intervals assigned to one and the same proposition into a total belief-interval for this particular proposition. Detachment operators are proposed for determining the belief-interval of a conclusion given the belief-interval of the premise and the one that represents the amount of belief commited to the validity of the inference rule itself. Two different detachment operators are constructed for use in cases when: (1) the presence of the negation of the premise suggests the presence of the negation of the conclusion, and (2) when the presence of the negation of the premise does not tell anything at all with respect to the validity of the conclusion to be drawn.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-3 of 3
Type of publication
journal article (3)
Type of content
peer-reviewed (3)
Author/Editor
University
Language
English (3)

Year

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view