# Why We Need Type-2 Fuzzy Logic Systems

Fuzzy logic systems expert Jerry Mendel explains why we need to use type-2 fuzzy logic systems to model and minimize the effects of a broad range of uncertainties that can occur in a fuzzy logic system.

The original fuzzy logic (FL), founded by Lotfi Zadeh, has been around for more than 35 years, and yet it is unable to handle uncertainties. By "handle," I mean "to model and minimize the effect of." That the original FL, type-1 FL, cannot do this sounds paradoxical because the word fuzzy has the connotation of uncertainty. The expanded FL, type-2 FL, is able to handle uncertainties because it can model them and minimize their effects. And, if all uncertainties disappear, type-2 FL reduces to type-1 FL, in much the same way that, if randomness disappears, probability reduces to determinism.

Although many applications were found for type-1 FL, it is its application to rule-based systems that has most significantly demonstrated its importance as a powerful design methodology.

A rule-based fuzzy logic system (FLS) is shown in Figure 1. Its fuzzifier, inference mechanism (which is associated with rules, the heart of an FLS), and output processor involve operations on fuzzy sets that are characterized by membership functions. (For more information on the FLS in this figure, see my first article in this series, "Uncertainty in Fuzzy Logic Systems.") An FLS that is described completely in terms of type-1 fuzzy sets is called a type-1 FLS, whereas an FLS that is described using at least one type-2 fuzzy set is called a type-2 FLS. The output processor for a type-1 FLS is a defuzzifier; it transforms a type-1 fuzzy set into a number, a type-0 fuzzy set. The output processor for a type-2 FLS has two components to it. First, type-2 fuzzy sets are transformed into type-1 fuzzy sets by means of type reduction. Then the type-reduced set is transformed into a number by means of defuzzifcation.

Figure 1. Fuzzy logic system.

Type-1 FLSs cannot directly handle rule uncertainties because they use type-1 fuzzy sets that are certain. Type-2 FLSs, on the other hand, are very useful in circumstances in which it is difficult to determine an exact membership function for a fuzzy set; hence, they can be used to handle rule uncertainties and even measurement uncertainties.

Type-2 FLSs move the world of FLSs into a fundamentally new and important direction. What is this new direction, and why is it important? To make the answers to these questions as clear as possible, let us briefly digress to review some things that are, no doubt, familiar.

Probability theory is used to model random uncertainty, and within that theory we begin with a probability density function (pdf) that embodies total information about random uncertainties. In most practical real-world applications, it is impossible to know or determine the pdf, so we fall back on the fact that a pdf is completely characterized by all of its moments (if they exist). If the pdf is Gaussian, then, as is well known, two moments—the mean and the variance—suffice to completely specify it. For most pdfs, an infinite number of moments are required. Of course, in practice it is not possible to determine an infinite number of moments; instead, we compute as many moments as we believe are necessary to extract as much information as possible from the data. At the very least, we use two moments, the mean and the variance. In some cases, we even use higher-than-second-order moments.

To use just the first-order moments would not be very useful because random uncertainty requires an understanding of dispersion about the mean, and this information is provided by the variance. So, our accepted probabilistic modeling of random uncertainty focuses, to a large extent, on methods that use at least the first two moments of a pdf. For example, that is why designs based on minimizing a mean-squared error are so popular.

Should we expect any less of an FLS for rule uncertainties or any other types of uncertainties? To date, we may view the output of a type-1 FLS—the defuzzified output—as analogous to the mean of a pdf. (I do not want to get stuck in the quagmire about the equivalence between subjective probability and type-1 fuzzy sets; our "analogy" between the defuzzified output of an FLS and the mean of a pdf is meant to be just that and nothing more.) Just as variance provides a measure of dispersion about the mean and is almost always used to capture more about probabilistic uncertainty in practical statistical designs, an FLS also needs some measure of dispersion—the new direction—to capture more about its uncertainties than just a single number. Type-2 FL provides this measure of dispersion and seems to be as fundamental to the design of systems that include linguistic or numerical uncertainties that translate into rule or input uncertainties as variance is to the mean.

Just as random uncertainties flow through a system and their effects can be evaluated using the mean and the variance, linguistic and random uncertainties flow through a type-2 FLS, and their effects can be evaluated using the defuzzified output and the type-reduced output of that system. Just as the variance provides a measure of dispersion about the mean and is often used in confidence intervals, the type-reduced output can be interpreted as providing a measure of dispersion about the defuzzified output. It can be thought of as (or related to) a linguistic confidence interval. Just as the variance increases as random uncertainty increases, the type-reduced set also increases as linguistic or random uncertainties increase. So, a type-2 FLS is analogous to a probabilistic system through first and second moments, whereas a type-1 FLS is analogous to a probabilistic system only through the first moment.

A type-2 FLS has more design degrees of freedom than does a type-1 FLS because its type-2 fuzzy sets are described by more parameters than are type-1 fuzzy sets. This is analogous to a probability density function being described by more parameters (for example, a Gaussian probability density function is described by its mean and standard deviation) than its deterministic counterpart (for example, a degenerate Gaussian probability density function is one whose standard deviation is 0 and is characterized just by its mean). This suggests that a type-2 FLS has the potential to outperform a type-1 FLS because of its larger number of design degrees of freedom. To date, there is no mathematical proof that this will always be the case; however, in every application to which I have applied type-2 FLSs, I have always observed that better performance is obtained using a type-2 FLS than is obtained using a type-1 FLS.

In summary, we need type-2 FLSs to directly model uncertainties and minimize their effects, all within the framework of rule-based FLSs

### InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

## Overview

Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

## Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

### Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

### Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

### Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

### Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

### Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

### Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

## Other Collection and Use of Information

### Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

### Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

### Do Not Track

This site currently does not respond to Do Not Track signals.

## Security

Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

## Children

This site is not directed to children under the age of 13.

## Marketing

Pearson may send or direct marketing communications to users, provided that

• Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
• Such marketing is consistent with applicable law and Pearson's legal obligations.
• Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
• Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

## Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

## Choice/Opt-out

Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

## Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

## Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

## Sharing and Disclosure

Pearson may disclose personal information, as follows:

• As required by law.
• With the consent of the individual (or their parent, if the individual is a minor)
• In response to a subpoena, court order or legal process, to the extent permitted or required by law
• To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
• In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
• To investigate or address actual or suspected fraud or other illegal activities
• To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
• To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
• To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.