Interval Type 2 Center of Fuzzy Set
The IT2 FS is the most widely used T2 FS today, given its computational simplicity. When these FS are used in a rule-based fuzzy logic system (FLS), the result is an interval T2 FLS (IT2 FLS). There are more sets of rule outputs executed in these FLSs than IT2 FS, and moving from these sets to numbers requires doing two successive actions: type reduction and def- erentialization, as is usually required by most engineering applications in FLS. Type reduction maps the output T2 FS to type 1 (Tl) FS, and defuzzification converts that Tl FS to a number. The type-reduction method was matured by Karnik and Mendel. If it is unromantic to an unqualified T2 FS, the calculation of an astronomical number is required. If you are unromantic to IT2 FS, you will need a very small number of calculations. This is one of the main reasons why IT2 FLS is sustentation, but unqualified T2 FLS is not.
In the case of the IT2 FLS, there may also be different kinds of type reductions. Everything that has been aged so far gives T2 FS a Tl center number, so when all the sources of uncertainty disappear, the output of IT2 FLS is reduced to that of Tl FLS. So calculating the center of IT2 FS plays an internal role in IT2 FLS. In addition, the heart of IT2 FS provides a measure of the uncertainty of IT2 FS, and has recently become an infrastructure for moving from data serenity to the next in more and more subject groups (the meaning of words and the intervals they socialize).
Type Reduction: Unspecified Consequences
The deepening of a T2 FS is a two-step process consisting of a first type reduction followed by a resulting second set of type 1.
The final step in a fuzzy reasoning system (FIS) is deepening. In a type 2 fuzzy reasoning system, differing consists of two stages: type reduction, which is a procedure of converting a set of type 2 to a set of type 1, and a suitable diffusing, which rewards sharp numbers by diffusing this type 1 set.
This type-reduction algorithm was originally described by Mendel with respect to a generalized T2 FS:
- 1. All possible type 2 embedded sets are listed.
- 2. There is a minimum secondary membership level for each embedded set.
- 3. For each embedded set, the type 1 centric domain value of the type 2 embedded set is calculated.
- 4. For each built-in set, the quadratic rank is paired with the domain values to create a series of ordered pairs (x, z). For some values of x, it can increase above each z value.
- 5. For each domain value, the maximum secondary grade is selected. This produces a set of pairs (x, zMax) that are ordered so that there is a one-to-one correspondence between x and zMax. This completes the type reduction from the type 2 set to the type 1 set.
This strategy involves processing all embedded sets within a type 2 set. There are a lot of embedded sets, often totaling millions. Although individually hand-treated, the set included in the overall reward simply leads to a processing stick-up thanks to the higher cardinality. As a result, thorough deepening should be considered a theoretical flow rather than a practical skill. In woody discretization, this strategy can be implemented, but it is very slow. Preferably in discretization, the problem of memory space and a very large number of representations makes implementation impossible. Despite its practical shortcomings, we consider a thorough deferring algorithm as the standard for evaluating the validation of other type 2 deferring algorithms.
In the interval sample, all secondary grades are 1, which is how the minimum secondary grade is 1. So steps 2 and 5 can be removed from the spacing algorithm. All sorted pairs are of the form (x; 1). Graphically they lie on the horizon.
