Presentation is loading. Please wait.

Presentation is loading. Please wait.

Preference relation in pliant system University of Szeged Department of Informatics Pamplona 2009.

Similar presentations


Presentation on theme: "Preference relation in pliant system University of Szeged Department of Informatics Pamplona 2009."— Presentation transcript:

1 Preference relation in pliant system University of Szeged Department of Informatics Pamplona 2009

2 2 17-Sept-2009 Elements of pliant system 1.Conjunction, disjunction, negation 2.Aggregation 3.Preference relation 4.Distending function 5.Distending function as preference

3 3 17-Sept-2009 Conjunction, disjunction, negation

4 4 17-Sept-2009 Conjunctive and disjunctive operator We shall be looking for the general form of c(x,y) and d(x,y) : 1. is continuous 2.Strict monotonous increasing 3.Compatible with the two valued logic 4.Associative 5.Archimedian

5 5 17-Sept-2009 Conjunctive and disjunctive operator Theorem: (Aczél) If with u and v, h(u,v) also always lies in a given (possibly infinite) interval and h(u,v) is reducible on both sides, then

6 6 17-Sept-2009 Operators and DeMorgan law Let’s generalize tha conjunctive and disjunctive operators and let: where

7 7 17-Sept-2009 Negation Definition:  (x) is a negation iff satisfies the following conditions: 1.  (x) is continuous 2.Boundary conditions are and 3.Monotonicity:for 4.Involutivness:

8 8 17-Sept-2009 Negation Other properties: - * fix point of the negation, where - The decision value:

9 9 17-Sept-2009 Negation -On Figure there are some negation functions with different * and values:

10 10 17-Sept-2009 Operators and DeMorgan law Definition: The DeMorgan law for general conjunctive and disjunctive operator is: where  (x) is the negation function.

11 11 17-Sept-2009 Operators and DeMorgan law Theorem: (DeMorgan law) The generalized DeMorgan law is valid iff where

12 12 17-Sept-2009 Negation and DeMorgan law Parametrical form of the negation is:

13 13 17-Sept-2009 Representation theorem of negation For all given  (x) there exist an f(x) such that where k(x) is a strictly decreasing function with the property and f is the generator function of a conjunctive, or disjunctive operator Trillas’ result:

14 14 17-Sept-2009 Operator with various negations Theorem: c(x,y) and d(x,y) build DeMorgan system for where if and only if

15 15 17-Sept-2009 Multiplicative pliant system Definition: If k(x) = 1/x, i.e. and then we call the generated connectives multiplicative pliant system.

16 16 17-Sept-2009 Multiplicative pliant system Theorem: The general form of the multiplicative pliant system is where f(x) is the generator function of either the conjunctive or the disjunctive operator.

17 17 17-Sept-2009 Multiplicative pliant system If f = f c, then depending on thevalue of  the operator is

18 18 17-Sept-2009 Dombi operator system Let choose then we get

19 19 17-Sept-2009 Aggregation

20 20 17-Sept-2009 Aggregation Let us consider a set of objects.Let us characterize every object with a number m of its properties,where and i = 1,…,n. Thus, if the aggregative operator as denoted as, for a decision level  we have

21 21 17-Sept-2009 Aggregation Let us next substitute every property by its antithetic one (in the following its negative form and carry out division into classes at the level:

22 22 17-Sept-2009 Aggregative operators and representable uninorms Definition: (of correct decision formation) The condition of correct formation is thus Theorem: It is necessary and sufficient condition of the aggre- gative operator satisfying correct decision formation that should hold.

23 23 17-Sept-2009 Aggregative operators and representable uninorms Definition: An aggregative operator is a strictly increasing function with the properties: 1.Continuous on 2.Boundary conditions are and 3.Associativity: 4.There exists a strong negation  such that (self DeMorgan identity)

24 24 17-Sept-2009 Aggregative operators and representable uninorms Definition: A uninorm U is a mapping having the following properties : 1.Commutativity: 2.Monotonicity: if and 3.Associativity: 4.Neutral element:

25 25 17-Sept-2009 Aggregative operators and representable uninorms Theorem: Let be a function. It is an aggregative operator if and only if there exists a continuous and strictly monotone function with such that for all

26 26 17-Sept-2009 Aggregation Theorem: It holds that: Theorem: It holds for the aggregative operator that

27 27 17-Sept-2009 Aggregation

28 28 17-Sept-2009 The neutral value Theorem: (Additive form of negations) Let be a continuous function, then the following are equivalent: 1.  is a negation with neutral value *. 2.There exists a continuous and strictly monotone function and such that for all

29 29 17-Sept-2009 Conjunctive, disjunctive and aggregative operators Definition: We will use the term conjunctive operator for strict, continuous t-norms, and disjunctive operator for strict, continuous t-conorms. The expression logical operators will refer to both of them.

30 30 17-Sept-2009 Conjunctive, disjunctive and aggregative operators Theorem: The following are equivalent: 1. is a logical operator. 2. is an aggregative aoperator.

31 31 17-Sept-2009 Aggregation and Pan operators Pan operator: Theorem: Let c and d be a conjunctive and a disjunctive opera- tor with additive generator functions f c and f d. Suppose their corresponding negations are equivalent (i.e. ), denoted by  (  ( * ) = * ). The three connectives c, d and  form a De Morgan triplet if and only if f c (x)f d (x) = 1.

32 32 17-Sept-2009 Conjunctive, disjunctive and aggregative operators Definition: Let f be the additive generator of a logical operator. The aggregative operatoris called the corresponding aggregative operator of the conjunctive or disjunctive operator, and vice versa.

33 33 17-Sept-2009 Conjunctive, disjunctive and aggregative operators Multiplicative form of negations: The function is a negation with neutral value if and only if where f is a generator function of a logical operator.

34 34 17-Sept-2009 Pliant operators Theorem: Let c and d be a conjunctive and disjunctive operator with additive generator functions f c and f d. Suppose their corresponding negations are equivalent ( i.e. ), denoted by. The three connectives c, d and n form a DeMorgan triplet if and only if

35 35 17-Sept-2009 Unary operators The general form of the unary operator: Special case of thefunction: if =1 and > 0 then concentration operator if =1 and < 0 then dilutor operator if =-1 then negation operator if f( 0 )= f( ) = 1 then sharpness operator

36 36 17-Sept-2009 Pliant operators The Dombi operator case:

37 37 17-Sept-2009 Pliant operators Modifier: if =1 and > 0 then concentration operator if =1 and < 0 then dilutor operator if =-1 then negation operator Negation:

38 38 17-Sept-2009 Preference relation

39 39 17-Sept-2009 Preference operator on the [0,1] interval We define the preference function in the following way:

40 40 17-Sept-2009 Properties of preference operator Theorem: Let the pliant operations: and the preference operator

41 41 17-Sept-2009 Properties of preference operator The following properties hold for the preference rela- tions: I. Preference properties 1. Continuity: 2. Monotonicity: 3.Compatibility conditions:

42 42 17-Sept-2009 Properties of preference operator 4. Boundary conditions: if then 5. Neutrality: 6. Preference property:

43 43 17-Sept-2009 Properties of preference operator 7. Bisymmetric property: 8. Common basis property: for all z II. Preference and negation operator

44 44 17-Sept-2009 Properties of preference operator III. Preference and aggregation 1. Transitivity with aggregation: 2. Common basis principles 3. Inverse property: 4. Neutrality:

45 45 17-Sept-2009 Properties of preference operator 5. Exchangeability: 6. Preference of aggregation:

46 46 17-Sept-2009 Properties of preference operator IV. Threshold property 1. Threshold transitivity: p(x,y) is threshold transitiv if: 2. Strong completeness: 3. Antisymmetricity:

47 47 17-Sept-2009 Preference and multicriteria decision making We can express the preference relation in additive form: where g(x)=ln(f(x)). In multicriteria decision the preference is

48 48 17-Sept-2009 Preference and multicriteria decision making In pliant conceptand so (1) and (2) are the same. Most cases in the framework of multicriteria decision (3) are used. We can approximate (3) using Rolle theorem: i.e. Substituting it into (1) where i.e. the preference depends on y and x.

49 49 17-Sept-2009 Distending function

50 50 17-Sept-2009 Distending function instead of membership function Let choose an often used one the term “old”. The same example exist in Zadeh’s seminal paper. We suppose now that the term “old” depends only on age, and we do not care that most polar terms are always context dependant i.e. old professor is defined in an other domain than old student. In classical logic we have to fix a dividing line, in our case let it be 63 years (a=63). If somebody is older than 63 years then he/she belongs to the class (set) of old people, otherwise does not.

51 51 17-Sept-2009 Distending function instead of membership function We can write this in an inequality form, using a characteristic function: The expression a

52 52 17-Sept-2009 Distending function instead of membership function Generaly, on the left side of the inequality could be any g(x) function. In the pliant concept we introduce the distending function. We will use the notation We can generalize this in the following way:

53 53 17-Sept-2009 General form of the distending function Let start with the aggregation concept. The weighted aggregation operator is: where x i are the distending values and f is the generator function of the logical operator. Intuitively aggregation is a weighted average of the values, The following theorem gives the exact description of

54 54 17-Sept-2009 Distending function Theorem: Using the aggregation if and only if Dombi operator case:

55 55 17-Sept-2009 Sigmoid function and logistic regression The sigmoid function has the following properties. The sigmoid function is able to modelize inequality.

56 56 17-Sept-2009 Distending function as preference

57 57 17-Sept-2009 Distending function as preferences on the real line The distending function has the following form: We can define a preference function:

58 58 17-Sept-2009 Distending function as preferences on the real line The following properties hold for. I. Preference properties 1. Continuity: 2. Monotonicity: 3. Limes property:

59 59 17-Sept-2009 Distending function as preferences on the real line 4. Boundary conditions: 5. Neutrality: 6. Preference property:

60 60 17-Sept-2009 Distending function as preferences on the real line 7. Translation property: II. Preference and negation operator III. Preference and aggregation 1. Transitivity with aggregation: 2. Common basis principles

61 61 17-Sept-2009 Distending function as preferences on the real line 4. Neutrality: IV. Threshold property 1. Threshold transitivity: P (λ) is threshold transitiv if: 2. Strongly complete:

62 62 17-Sept-2009 Distending function as preferences on the real line 3. Antisymmetric:

63 63 17-Sept-2009 Animation

64 64 17-Sept-2009 Animation

65 65 17-Sept-2009 Animation

66 66 17-Sept-2009 Animation

67 67 17-Sept-2009 Animation

68 17-Sept-2009

69 69 Thank you for your attention! 17-Sept-2009


Download ppt "Preference relation in pliant system University of Szeged Department of Informatics Pamplona 2009."

Similar presentations


Ads by Google