Why Data Processing . . . From Probabilistic to . . . Main Problem of . . . Need to Process Fuzzy . . . From Processing Reduction to Interval . . . Interval-Valued Fuzzy Data Need for Type-2 Fuzzy . . . Towards Fast . . . to General Type-2: New Result: Extension . . . Interval Arithmetic: . . . Towards Fast Algorithms Home Page Title Page Vladik Kreinovich ◭◭ ◮◮ Department of Computer Science ◭ ◮ University of Texas at El Paso El Paso, TX 79968, USA Page 1 of 100 Email: vladik@utep.edu http://www.cs.utep.edu/vladik Go Back http://www.cs.utep.edu/interval-comp Full Screen Close Quit
Why Data Processing . . . From Probabilistic to . . . 1. Outline Main Problem of . . . • Known: processing (type-1) fuzzy data can be reduced Need to Process Fuzzy . . . to interval uncertainty: Reduction to Interval . . . Need for Type-2 Fuzzy . . . – Zadeh’s extension principle is equivalent to Towards Fast . . . – level-by-level interval computations on α -cuts. New Result: Extension . . . • More adequate description: type-2 fuzzy sets. Interval Arithmetic: . . . Home Page • Practical limitation: transition to type-2 increases com- putational complexity. Title Page ◭◭ ◮◮ • Jerry Mendel’s idea: for interval-valued fuzzy sets, pro- cessing can also be reduced to interval computations. ◭ ◮ • In this talk: we show that Mendel’s ideas can be natu- Page 2 of 100 rally extended to arbitrary type-2 fuzzy numbers. Go Back Full Screen Close Quit
Why Data Processing . . . From Probabilistic to . . . 2. Why Data Processing and Knowledge Process- Main Problem of . . . ing Are Needed in the First Place Need to Process Fuzzy . . . • Problem: some quantities y are difficult (or impossible) Reduction to Interval . . . to measure or estimate directly. Need for Type-2 Fuzzy . . . Towards Fast . . . • Solution: indirect measurements or estimates New Result: Extension . . . � x 1 Interval Arithmetic: . . . ✲ x 2 � Home Page � y = f ( � x 1 , . . . , � x n ) f ✲ ✲ · · · Title Page x n � ◭◭ ◮◮ ✲ ◭ ◮ • Fact: estimates � x i are approximate. Page 3 of 100 def Go Back • Question: how approximation errors ∆ x i = � x i − x i affect the resulting error ∆ y = � y − y ? Full Screen Close Quit
Why Data Processing . . . From Probabilistic to . . . 3. From Probabilistic to Interval Uncertainty Main Problem of . . . • Manufacturers of MI provide us with bounds ∆ i on Need to Process Fuzzy . . . measurement errors: | ∆ x i | ≤ ∆ i . Reduction to Interval . . . Need for Type-2 Fuzzy . . . • Thus, we know that x i ∈ [ � x i − ∆ i , � x i + ∆ i ]. Towards Fast . . . • Often, we also know probabilities, but in 2 cases, we New Result: Extension . . . don’t: Interval Arithmetic: . . . Home Page – cutting-edge measurements; – cutting-cost manufacturing. Title Page ◭◭ ◮◮ • In such situations: ◭ ◮ – we know the intervals [ x i , x i ] = [ � x i − ∆ i , � x i + ∆ i ] of possible values of x i , and Page 4 of 100 – we want to find the range of possible values of y : Go Back y = [ y, y ] = { f ( x 1 , . . . , x n ) : x 1 ∈ [ x 1 , x 1 ] , . . . , [ x n , x n ] } . Full Screen Close Quit
Why Data Processing . . . From Probabilistic to . . . 4. Main Problem of Interval Computations Main Problem of . . . We are given: Need to Process Fuzzy . . . Reduction to Interval . . . • an integer n ; Need for Type-2 Fuzzy . . . • n intervals x 1 = [ x 1 , x 1 ], . . . , x n = [ x n , x n ], and Towards Fast . . . • an algorithm f ( x 1 , . . . , x n ) which transforms n real num- New Result: Extension . . . bers into a real number y = f ( x 1 , . . . , x n ). Interval Arithmetic: . . . Home Page We need to compute the endpoints y and y of the interval Title Page y = [ y, y ] = { f ( x 1 , . . . , x n ) : x 1 ∈ [ x 1 , x 1 ] , . . . , [ x n , x n ] } . ◭◭ ◮◮ x 1 ◭ ◮ ✲ x 2 Page 5 of 100 y f ✲ ✲ . . . Go Back x n ✲ Full Screen Close Quit
Why Data Processing . . . From Probabilistic to . . . 5. Need to Process Fuzzy Uncertainty Main Problem of . . . • In many practical situations, we only have expert esti- Need to Process Fuzzy . . . mates for the inputs x i . Reduction to Interval . . . Need for Type-2 Fuzzy . . . • Sometimes, experts provide guaranteed bounds on x i , Towards Fast . . . and even the probabilities of different values. New Result: Extension . . . • However, such cases are rare. Interval Arithmetic: . . . Home Page • Usually, the experts’ opinion is described by (impre- cise, “fuzzy”) words from natural language. Title Page • Example: the value x i of the i -th quantity is approxi- ◭◭ ◮◮ mately 1.0, with an accuracy most probably about 0.1. ◭ ◮ • Based on such “fuzzy” information, what can we say Page 6 of 100 about y = f ( x 1 , . . . , x n )? Go Back • The need to process such “fuzzy” information was first Full Screen emphasized in the early 1960s by L. Zadeh. Close Quit
Why Data Processing . . . From Probabilistic to . . . 6. How to Describe Fuzzy Uncertainty: Reminder Main Problem of . . . • In Zadeh’s approach, we assign: Need to Process Fuzzy . . . Reduction to Interval . . . – to each number x i , Need for Type-2 Fuzzy . . . – a degree m i ( x i ) ∈ [0 , 1] with which x i is a possible Towards Fast . . . value of the i -th input. New Result: Extension . . . • In most practical situations, the membership function: Interval Arithmetic: . . . Home Page – starts with 0, Title Page – continuously ↑ until a certain value, – and then continuously ↓ to 0. ◭◭ ◮◮ ◭ ◮ • Such membership function describe usual expert’s ex- pressions such as “small”, “ ≈ a with an error ≈ σ ”. Page 7 of 100 • Membership functions of this type are actively used in Go Back expert estimates of number-valued quantities. Full Screen • They are thus called fuzzy numbers . Close Quit
Why Data Processing . . . From Probabilistic to . . . 7. Processing Fuzzy Data: Formulation of the Prob- Main Problem of . . . lem Need to Process Fuzzy . . . • We know an algorithm y = f ( x 1 , . . . , x n ) that relates: Reduction to Interval . . . Need for Type-2 Fuzzy . . . – the value of the desired difficult-to-estimate quan- Towards Fast . . . tity y with New Result: Extension . . . – the values of easier-to-estimate auxiliary quantities Interval Arithmetic: . . . x 1 , . . . , x n . Home Page • We also have expert knowledge about each of the quan- Title Page tities x i . ◭◭ ◮◮ • For each i , this knowledge is described in terms of the corresponding membership function m i ( x i ). ◭ ◮ • Based on this information, we want to find the mem- Page 8 of 100 bership function m ( y ) which describes: Go Back – for each real number y , Full Screen – the degree of confidence that this number is a pos- Close sible value of the desired quantity. Quit
Why Data Processing . . . From Probabilistic to . . . 8. Towards Solving the Problem Main Problem of . . . • Intuitively, y is a possible value of the desired quantity Need to Process Fuzzy . . . if for some values x 1 , . . . , x n : Reduction to Interval . . . Need for Type-2 Fuzzy . . . – x 1 is a possible value of the 1st input quantity, Towards Fast . . . – and x 2 is a possible value of the 2nd input quantity, New Result: Extension . . . – . . . , Interval Arithmetic: . . . – and y = f ( x 1 . . . , x n ). Home Page • We know: Title Page – that the degree of confidence that x 1 is a possible ◭◭ ◮◮ value of the 1st input quantity is equal to m 1 ( x 1 ), ◭ ◮ – that the degree of confidence that x 2 is a possible Page 9 of 100 value of the 2nd input quantity is equal to m 2 ( x 2 ), etc. Go Back • The degree of confidence d ( y, x 1 , . . . , x n ) in an equality Full Screen y = f ( x 1 . . . , x n ) is, of course, 1 or 0. Close Quit
Why Data Processing . . . From Probabilistic to . . . 9. Towards Solving the Problem (cont-d) Main Problem of . . . • The simplest way to represent “and” is to use min. Need to Process Fuzzy . . . Reduction to Interval . . . • Thus, for each combination of values x 1 , . . . , x n , the Need for Type-2 Fuzzy . . . degree of confidence d in a composite statement Towards Fast . . . “ x 1 is a possible value of the 1st input quantity, and New Result: Extension . . . x 2 is a possible value of the 2nd input quantity, . . . , Interval Arithmetic: . . . and y = f ( x 1 . . . , x n )” Home Page is equal to Title Page d = min( m 1 ( x 1 ) , m 2 ( x 2 ) , . . . , d ( y, x 1 , . . . , x n )) . ◭◭ ◮◮ • We can simplify this expression if we consider two pos- ◭ ◮ sible cases: Page 10 of 100 – when y = f ( x 1 . . . , x n ), we get Go Back d = min( m 1 ( x 1 ) , m 2 ( x 2 ) , . . . , d ( y, x 1 , . . . , x n )); Full Screen – otherwise, we get d = 0. Close Quit
Recommend
More recommend
