This document provides an overview of fuzzy logic and fuzzy set theory. It discusses how fuzzy sets allow for partial membership rather than crisp binary membership in sets. Various membership functions are described, including triangular, trapezoidal, Gaussian, and sigmoidal functions. Properties of fuzzy sets like support, convexity, and symmetry are defined. Finally, fuzzy set operations analogous to classical set operations are mentioned.
This document introduces fuzzy sets. It defines a fuzzy set as a set where elements have gradual membership rather than binary membership. Fuzzy sets allow membership values between 0 and 1. Operations on fuzzy sets like union, intersection, and complement are defined. An example fuzzy set distinguishes young and adult ages on a scale rather than a binary classification. Fuzzy sets permit ambiguous or uncertain boundaries unlike classical sets.
Double integrals can be used to calculate properties of planar laminas such as mass, center of mass, and moments of inertia. The mass of a lamina is found by taking the double integral of the density function over the region. The center of mass is found by taking moments divided by the total mass. Moments are calculated by taking double integrals of the density function multiplied by x or y. Moments of inertia are also calculated using double integrals of the density function multiplied by x^2, y^2, or x^2 + y^2.
Rough sets and fuzzy rough sets in Decision MakingDrATAMILARASIMCA
Rough sets, Fuzzy rough sets, lower approximation, upper approximation, positive region and reduct, Equivalence relation, dependency coefficient, Information system for road accident system
Homogeneous function is one with multiplicative scaling behaviour - if all its arguments are multiplied by a factor, then its value is multiplied by some power of this factor.
Cauchy's integral theorem, Cauchy's integral formula, Cauchy's integral formula for derivatives, Taylor's Series, Maclaurin’s Series,Laurent's Series,Singularities and zeros, Cauchy's Residue theorem,Evaluation various types of complex integrals.
The document discusses improper integrals of the second kind, where the integrand is discontinuous or unbounded within the interval of integration. It provides three examples of evaluating such integrals. Improper integrals of the second kind can be evaluated by taking limits of the integral as the integration limit approaches the point of discontinuity or unboundedness. The integral converges, or exists, if the limit is finite, and diverges if the limit is infinite.
The document discusses basic concepts related to continuous functions. It begins with an introduction and motivation for studying continuous functions. Some key reasons mentioned are that continuous functions are needed for integration and as underlying functions in differential equations. The document then provides definitions of limits and continuity in terms of limits. It gives examples of determining limits and continuity for various functions. Contributors to the field like Bolzano, Cauchy, and Weierstrass are also acknowledged. The document concludes with additional definitions of continuity, examples, and discussions of uniform continuity.
This document introduces fuzzy sets. It defines a fuzzy set as a set where elements have gradual membership rather than binary membership. Fuzzy sets allow membership values between 0 and 1. Operations on fuzzy sets like union, intersection, and complement are defined. An example fuzzy set distinguishes young and adult ages on a scale rather than a binary classification. Fuzzy sets permit ambiguous or uncertain boundaries unlike classical sets.
Double integrals can be used to calculate properties of planar laminas such as mass, center of mass, and moments of inertia. The mass of a lamina is found by taking the double integral of the density function over the region. The center of mass is found by taking moments divided by the total mass. Moments are calculated by taking double integrals of the density function multiplied by x or y. Moments of inertia are also calculated using double integrals of the density function multiplied by x^2, y^2, or x^2 + y^2.
Rough sets and fuzzy rough sets in Decision MakingDrATAMILARASIMCA
Rough sets, Fuzzy rough sets, lower approximation, upper approximation, positive region and reduct, Equivalence relation, dependency coefficient, Information system for road accident system
Homogeneous function is one with multiplicative scaling behaviour - if all its arguments are multiplied by a factor, then its value is multiplied by some power of this factor.
Cauchy's integral theorem, Cauchy's integral formula, Cauchy's integral formula for derivatives, Taylor's Series, Maclaurin’s Series,Laurent's Series,Singularities and zeros, Cauchy's Residue theorem,Evaluation various types of complex integrals.
The document discusses improper integrals of the second kind, where the integrand is discontinuous or unbounded within the interval of integration. It provides three examples of evaluating such integrals. Improper integrals of the second kind can be evaluated by taking limits of the integral as the integration limit approaches the point of discontinuity or unboundedness. The integral converges, or exists, if the limit is finite, and diverges if the limit is infinite.
The document discusses basic concepts related to continuous functions. It begins with an introduction and motivation for studying continuous functions. Some key reasons mentioned are that continuous functions are needed for integration and as underlying functions in differential equations. The document then provides definitions of limits and continuity in terms of limits. It gives examples of determining limits and continuity for various functions. Contributors to the field like Bolzano, Cauchy, and Weierstrass are also acknowledged. The document concludes with additional definitions of continuity, examples, and discussions of uniform continuity.
Fuzzy logic provides a method to formalize reasoning with vague terms by allowing membership functions and degrees of truth rather than binary true/false values. It can be used to model problems involving linguistic variables like "poor", "good", and "excellent".
The document discusses a tipping example to demonstrate fuzzy logic. It defines fuzzy rules for tip amounts based on the quality of service and food. For example, one rule is that if service is poor or food is rancid, the tip should be cheap. Membership functions are then used to evaluate the fuzzy rules and determine appropriate tip amounts based on varying degrees of service and food quality.
Fuzzy logic provides a more intuitive way to model problems involving vague
This document provides information on probability distributions and related concepts. It defines discrete and continuous random distributions. It explains probability distribution functions for discrete and continuous random variables and their properties. It also discusses mathematical expectation, variance, and examples of calculating these values for random variables.
This document provides an overview of integral calculus. It defines integration as the reverse process of differentiation and discusses indefinite and definite integrals. Graphical representations and general integration rules are presented. Examples are provided for integrals of simple functions using substitution and integration by parts methods. The document also covers integrals of trigonometric functions and derives formulas for several integrals. It concludes with examples of evaluating definite integrals between specified limits to find the area under a curve.
This document provides an introduction to integration (calculus) as taught in an undergraduate engineering course. It defines integration as the reverse process of differentiation and describes how it can be used to find the area under a curve. The document outlines key integration terminology like indefinite integrals, definite integrals, and the constant of integration. It also provides examples of integrating common functions and using integration to calculate volumes of solids of revolution.
The order of the given matrix is 2×3. So the maximum no. of elements is 2×3 = 6.
The correct option is B.
The element a32 belongs to 3rd row and 2nd column.
The correct option is B.
3. A matrix whose each diagonal element is unity and all other elements are zero is called
A) Identity matrix B) Unit matrix C) Scalar matrix D) Diagonal matrix
4. A matrix whose each row sums to unity is called
A) Row matrix B) Column matrix C) Unit matrix D) Stochastic matrix
5. The sum of all the elements on the principal diagonal of a square
This document discusses a one sample runs test, which is used to determine if a sample is randomly drawn from a population. It defines a run as a series of like items. The document provides an example of coin flips and illustrates how different outcomes would indicate random or non-random patterns. It presents the formula for the runs test and applies it to an example of testing if diseased trees are randomly or non-randomly grouped. The requirements, advantages, and other applications of the runs test are outlined.
Numerical solution of eigenvalues and applications 2SamsonAjibola
This document provides an overview of eigenvalues and their applications. It discusses:
1) Eigenvalues arise in applications across science and engineering, including mechanics, control theory, and quantum mechanics. Numerical methods are used to solve increasingly large eigenvalue problems.
2) Common methods for small problems include the QR and power methods. For large, sparse problems, techniques like the Krylov subspace and Arnoldi methods are used to compute a few desired eigenvalues/eigenvectors.
3) The document outlines the structure of the thesis, which will investigate methods for finding eigenvalues like Krylov subspace, power, and QR. It will also explore applications in areas like biology, statistics, and engineering.
This document is a report on Complex Variable & Numerical Method prepared by 5 students and guided by Miss. Chaitali Shah. It contains the following topics: complex numbers, complex variable, basic definitions, limits, continuity, differentiability, analytic functions, Cauchy-Riemann equations, harmonic functions, Milne-Thomson method, and applications of complex functions/variables in engineering. Examples are provided to illustrate several concepts.
The document discusses set theory and Venn diagrams. It defines sets, subsets, unions, intersections, and complements. Sets can be described using words, lists, or set-builder notation. Venn diagrams are used to visually represent relationships between sets, such as intersections, unions, and complements. Examples are provided to demonstrate finding intersections, unions, subsets, disjoint sets, and using Venn diagrams to solve problems involving set relationships.
A relation is a set of ordered pairs that shows a relationship between elements of two sets. An ordered pair connects an element from one set to an element of another set. The domain of a relation is the set of first elements of each ordered pair, while the range is the set of second elements. Relations can be represented visually using arrow diagrams or directed graphs to show the connections between elements of different sets defined by the relation.
A metric space is a non-empty set together with a metric or distance function that satisfies four properties: distance is always greater than or equal to 0; distance is 0 if and only if points are equal; distance is symmetric; and distance obeys the triangle inequality. A function between metric spaces is continuous if small changes in the input result in small changes in the output. A function is uniformly continuous if it is continuous with respect to all possible inputs, not just a single point. A metric space is connected if it cannot be represented as the union of two disjoint non-empty open sets.
The document discusses matrix multiplication. Matrix multiplication involves multiplying the elements of each row of the first matrix by the elements of each column of the second matrix and adding the products. The number of columns in the first matrix must equal the number of rows in the second matrix for the multiplication to be defined. The result of multiplying an m×n matrix by an n×p matrix is an m×p matrix. Matrix multiplication is not generally commutative.
This document summarizes Lotfi Zadeh's 1965 paper that introduced fuzzy set theory. It defines fuzzy sets as sets with imprecise or unclear boundaries, where elements can partially belong through degrees of membership between 0 and 1. It provides key definitions for fuzzy sets, including complement, subset, union, intersection and algebraic operations. Convex combinations and fuzzy relations are also introduced. The document concludes with a definition for convex fuzzy sets.
This document discusses various measures of dispersion in statistics. It defines dispersion as the extent to which items in a data set vary from the central value. Some key measures of dispersion discussed include range, interquartile range, quartile deviation, mean deviation, and standard deviation. Formulas and examples are provided for calculating range, quartile deviation, and mean deviation from data sets. The objectives, properties, merits and demerits of each measure are outlined.
1) The document discusses basic rules and concepts of integration, including that integration is the inverse process of differentiation and that the indefinite integral of a function f(x) is notated as ∫f(x) dx = F(x) + c, where F(x) is the primitive function and c is the constant of integration.
2) Methods of integration discussed include the substitution method, where a function is substituted for the variable, and integration by parts, which uses the product rule in reverse to solve integrals involving products.
3) Finding the constant of integration c requires knowing the value of the primitive function F(x) at a specific point, which eliminates the family of functions and isolates a
This active learning assignment involves calculating double integrals to summarize:
1. The group members will calculate double integrals over various regions, including rectangles, general regions, and polar coordinates. They will use techniques like iterated integrals and Fubini's theorem.
2. Properties of double integrals like linearity and behavior under transformations will also be explored.
3. Examples will be worked through, such as finding the angle between two planes given their normal vectors, or evaluating a double integral over a specified region.
This document outlines chapters and sections from a statistics textbook. It introduces topics like statistical inference, measures of central tendency and variability, sampling procedures, discrete and continuous data, and different types of statistical studies. Examples and figures are provided to illustrate key concepts from the textbook such as using stem-and-leaf plots, box-and-whisker plots, and scatter plots to represent and analyze sample data. Copyright information is displayed at the beginning of each page.
This document provides an overview of fuzzy logic. It begins by defining fuzzy as not being clear or precise, unlike classical sets which have clear boundaries. It then explains fuzzy logic allows for partial set membership rather than binary membership. The document outlines fuzzy logic's ability to model imprecise or nonlinear systems using natural language-based rules. It details the key concepts of fuzzy logic including linguistic variables, membership functions, fuzzy set operations, fuzzy inference systems and the 5-step fuzzy inference process of fuzzifying inputs, applying fuzzy operations and implications, aggregating outputs and defuzzifying results.
The document discusses fuzzy inference systems and Mamdani fuzzy models. It introduces fuzzy inference systems, their structure and components. It then describes Mamdani fuzzy models in detail, including their use in controlling a steam engine, the fuzzy inference process, defuzzification methods and variants of Mamdani models.
Fuzzy logic provides a method to formalize reasoning with vague terms by allowing membership functions and degrees of truth rather than binary true/false values. It can be used to model problems involving linguistic variables like "poor", "good", and "excellent".
The document discusses a tipping example to demonstrate fuzzy logic. It defines fuzzy rules for tip amounts based on the quality of service and food. For example, one rule is that if service is poor or food is rancid, the tip should be cheap. Membership functions are then used to evaluate the fuzzy rules and determine appropriate tip amounts based on varying degrees of service and food quality.
Fuzzy logic provides a more intuitive way to model problems involving vague
This document provides information on probability distributions and related concepts. It defines discrete and continuous random distributions. It explains probability distribution functions for discrete and continuous random variables and their properties. It also discusses mathematical expectation, variance, and examples of calculating these values for random variables.
This document provides an overview of integral calculus. It defines integration as the reverse process of differentiation and discusses indefinite and definite integrals. Graphical representations and general integration rules are presented. Examples are provided for integrals of simple functions using substitution and integration by parts methods. The document also covers integrals of trigonometric functions and derives formulas for several integrals. It concludes with examples of evaluating definite integrals between specified limits to find the area under a curve.
This document provides an introduction to integration (calculus) as taught in an undergraduate engineering course. It defines integration as the reverse process of differentiation and describes how it can be used to find the area under a curve. The document outlines key integration terminology like indefinite integrals, definite integrals, and the constant of integration. It also provides examples of integrating common functions and using integration to calculate volumes of solids of revolution.
The order of the given matrix is 2×3. So the maximum no. of elements is 2×3 = 6.
The correct option is B.
The element a32 belongs to 3rd row and 2nd column.
The correct option is B.
3. A matrix whose each diagonal element is unity and all other elements are zero is called
A) Identity matrix B) Unit matrix C) Scalar matrix D) Diagonal matrix
4. A matrix whose each row sums to unity is called
A) Row matrix B) Column matrix C) Unit matrix D) Stochastic matrix
5. The sum of all the elements on the principal diagonal of a square
This document discusses a one sample runs test, which is used to determine if a sample is randomly drawn from a population. It defines a run as a series of like items. The document provides an example of coin flips and illustrates how different outcomes would indicate random or non-random patterns. It presents the formula for the runs test and applies it to an example of testing if diseased trees are randomly or non-randomly grouped. The requirements, advantages, and other applications of the runs test are outlined.
Numerical solution of eigenvalues and applications 2SamsonAjibola
This document provides an overview of eigenvalues and their applications. It discusses:
1) Eigenvalues arise in applications across science and engineering, including mechanics, control theory, and quantum mechanics. Numerical methods are used to solve increasingly large eigenvalue problems.
2) Common methods for small problems include the QR and power methods. For large, sparse problems, techniques like the Krylov subspace and Arnoldi methods are used to compute a few desired eigenvalues/eigenvectors.
3) The document outlines the structure of the thesis, which will investigate methods for finding eigenvalues like Krylov subspace, power, and QR. It will also explore applications in areas like biology, statistics, and engineering.
This document is a report on Complex Variable & Numerical Method prepared by 5 students and guided by Miss. Chaitali Shah. It contains the following topics: complex numbers, complex variable, basic definitions, limits, continuity, differentiability, analytic functions, Cauchy-Riemann equations, harmonic functions, Milne-Thomson method, and applications of complex functions/variables in engineering. Examples are provided to illustrate several concepts.
The document discusses set theory and Venn diagrams. It defines sets, subsets, unions, intersections, and complements. Sets can be described using words, lists, or set-builder notation. Venn diagrams are used to visually represent relationships between sets, such as intersections, unions, and complements. Examples are provided to demonstrate finding intersections, unions, subsets, disjoint sets, and using Venn diagrams to solve problems involving set relationships.
A relation is a set of ordered pairs that shows a relationship between elements of two sets. An ordered pair connects an element from one set to an element of another set. The domain of a relation is the set of first elements of each ordered pair, while the range is the set of second elements. Relations can be represented visually using arrow diagrams or directed graphs to show the connections between elements of different sets defined by the relation.
A metric space is a non-empty set together with a metric or distance function that satisfies four properties: distance is always greater than or equal to 0; distance is 0 if and only if points are equal; distance is symmetric; and distance obeys the triangle inequality. A function between metric spaces is continuous if small changes in the input result in small changes in the output. A function is uniformly continuous if it is continuous with respect to all possible inputs, not just a single point. A metric space is connected if it cannot be represented as the union of two disjoint non-empty open sets.
The document discusses matrix multiplication. Matrix multiplication involves multiplying the elements of each row of the first matrix by the elements of each column of the second matrix and adding the products. The number of columns in the first matrix must equal the number of rows in the second matrix for the multiplication to be defined. The result of multiplying an m×n matrix by an n×p matrix is an m×p matrix. Matrix multiplication is not generally commutative.
This document summarizes Lotfi Zadeh's 1965 paper that introduced fuzzy set theory. It defines fuzzy sets as sets with imprecise or unclear boundaries, where elements can partially belong through degrees of membership between 0 and 1. It provides key definitions for fuzzy sets, including complement, subset, union, intersection and algebraic operations. Convex combinations and fuzzy relations are also introduced. The document concludes with a definition for convex fuzzy sets.
This document discusses various measures of dispersion in statistics. It defines dispersion as the extent to which items in a data set vary from the central value. Some key measures of dispersion discussed include range, interquartile range, quartile deviation, mean deviation, and standard deviation. Formulas and examples are provided for calculating range, quartile deviation, and mean deviation from data sets. The objectives, properties, merits and demerits of each measure are outlined.
1) The document discusses basic rules and concepts of integration, including that integration is the inverse process of differentiation and that the indefinite integral of a function f(x) is notated as ∫f(x) dx = F(x) + c, where F(x) is the primitive function and c is the constant of integration.
2) Methods of integration discussed include the substitution method, where a function is substituted for the variable, and integration by parts, which uses the product rule in reverse to solve integrals involving products.
3) Finding the constant of integration c requires knowing the value of the primitive function F(x) at a specific point, which eliminates the family of functions and isolates a
This active learning assignment involves calculating double integrals to summarize:
1. The group members will calculate double integrals over various regions, including rectangles, general regions, and polar coordinates. They will use techniques like iterated integrals and Fubini's theorem.
2. Properties of double integrals like linearity and behavior under transformations will also be explored.
3. Examples will be worked through, such as finding the angle between two planes given their normal vectors, or evaluating a double integral over a specified region.
This document outlines chapters and sections from a statistics textbook. It introduces topics like statistical inference, measures of central tendency and variability, sampling procedures, discrete and continuous data, and different types of statistical studies. Examples and figures are provided to illustrate key concepts from the textbook such as using stem-and-leaf plots, box-and-whisker plots, and scatter plots to represent and analyze sample data. Copyright information is displayed at the beginning of each page.
This document provides an overview of fuzzy logic. It begins by defining fuzzy as not being clear or precise, unlike classical sets which have clear boundaries. It then explains fuzzy logic allows for partial set membership rather than binary membership. The document outlines fuzzy logic's ability to model imprecise or nonlinear systems using natural language-based rules. It details the key concepts of fuzzy logic including linguistic variables, membership functions, fuzzy set operations, fuzzy inference systems and the 5-step fuzzy inference process of fuzzifying inputs, applying fuzzy operations and implications, aggregating outputs and defuzzifying results.
The document discusses fuzzy inference systems and Mamdani fuzzy models. It introduces fuzzy inference systems, their structure and components. It then describes Mamdani fuzzy models in detail, including their use in controlling a steam engine, the fuzzy inference process, defuzzification methods and variants of Mamdani models.
The document discusses fuzzy logic, fuzzy sets, and fuzzy inference systems. It defines fuzzy logic as a form of logic where truth values can be any value between 0 and 1. Fuzzy sets are sets whose elements have degrees of membership between 0 and 1. A fuzzy inference system uses fuzzy set theory and if-then rules to map fuzzy inputs to outputs. The key components of a fuzzy inference system are the fuzzifier, rules base, inference engine, and defuzzifier.
This document provides an introduction and overview of fuzzy logic, including:
- Fuzzy sets allow gradual membership rather than crisp membership in sets, addressing limitations of binary logic.
- A case study examines controlling the speed of a room cooler motor based on temperature and humidity using fuzzy logic rules and membership functions.
- Key fuzzy logic concepts covered include fuzzification, fuzzy rules and inference, and defuzzification to obtain a crisp output from fuzzy inputs and rules.
The document discusses expert systems, which are computer programs that emulate human decision making. An expert system consists of two main parts: the inference engine, which reasons about knowledge like a human, and the knowledge base, which contains the variable information. Inference can proceed through forward chaining or backward chaining. The document also discusses knowledge representation techniques and the roles of knowledge workers and knowledge work systems.
Fuzzy relations, fuzzy graphs, and the extension principle are three important concepts in fuzzy logic. Fuzzy relations generalize classical relations to allow partial membership and describe relationships between objects to varying degrees. Fuzzy graphs describe functional mappings between input and output linguistic variables. The extension principle provides a procedure to extend functions defined on crisp domains to fuzzy domains by mapping fuzzy sets through functions. These concepts form the foundation of fuzzy rules and fuzzy arithmetic.
This document discusses soft computing and fuzzy sets. It begins by defining soft computing as being tolerant of imprecision and focusing on approximation rather than precise outputs. Fuzzy sets are introduced as a tool of soft computing that allow for graded membership in sets rather than binary membership. Key concepts regarding fuzzy sets are explained, including fuzzy logic operations, fuzzy numbers, and fuzzy variables. Linear programming problems are discussed and how they can be modeled as fuzzy linear programming problems to account for imprecision in the coefficients and constraints.
Fuzzy logic is a form of multivalued logic that allows intermediate values between conventional evaluations like true/false, yes/no, or 0/1. It provides a mathematical framework for representing uncertainty and imprecision in measurement and human cognition. The document discusses the history of fuzzy logic, key concepts like membership functions and linguistic variables, common fuzzy logic operations, and applications in fields like control systems, home appliances, and cameras. It also notes some drawbacks like difficulty in tuning membership functions and potential confusion with probability theory.
---TABLE OF CONTENT---
Introduction
Differences between crisp sets & Fuzzy sets
Operations on Fuzzy Sets
Properties
MF formulation and parameterization
Fuzzy rules and Fuzzy reasoning
Fuzzy interface systems
Introduction to genetic algorithm
Fuzzy set theory is an extension of classical set theory that allows for partial membership in a set rather than crisp boundaries. In fuzzy set theory, elements have degrees of membership in a set represented by a membership function between 0 and 1. This allows for modeling of imprecise concepts like "young" where the boundary is ambiguous. Fuzzy set theory is useful for modeling human reasoning and systems that can handle unreliable or incomplete information. Key concepts include fuzzy rules in an if-then format and fuzzy inference using methods like Mamdani inference involving fuzzification, rule evaluation, aggregation, and defuzzification.
1. The document discusses an emerging approach to computing called soft computing. Soft computing techniques include neural networks, genetic algorithms, machine learning, probabilistic reasoning, and fuzzy logic.
2. Soft computing aims to develop intelligent machines that can solve real-world problems that are difficult to model mathematically. It exploits tolerance for uncertainty and imprecision similar to human decision making.
3. The document then discusses various soft computing techniques in more detail, including neural networks, genetic algorithms, fuzzy logic, and how they differ from traditional hard computing approaches.
This document provides an overview of fuzzy logic concepts for a course on soft computing. It discusses key fuzzy logic topics like membership functions, fuzzy sets, linguistic variables, fuzzy rules, fuzzy inference, and neuro-fuzzy systems. The document also provides examples of commonly used membership functions like triangular, trapezoidal, and Gaussian functions. It explains how fuzzy logic allows for approximate reasoning using natural language terms and multivalent logic with membership values between 0 and 1.
This document provides an overview of the key topics covered in Lecture 9 of an Artificial Intelligence course on fuzzy logic. The lecture introduces fuzzy sets and membership functions as a way to represent ambiguous or uncertain values. It covers fuzzy set operations, fuzzy numbers, fuzzy rules for reasoning, and fuzzy inference. An example is provided to illustrate how fuzzy logic can be applied to control the speed of a vehicle based on road curvature. The homework assignments involve problems working with the concepts introduced in the lecture.
This document provides an introduction to fuzzy logic and fuzzy sets. It discusses key concepts such as fuzzy sets having degrees of membership between 0 and 1 rather than binary membership, and fuzzy logic allowing for varying degrees of truth. Examples are given of fuzzy sets representing partially full tumblers and desirable cities to live in. Characteristics of fuzzy sets such as support, crossover points, and logical operations like union and intersection are defined. Applications mentioned include vehicle control systems and appliance control using fuzzy logic to handle imprecise and ambiguous inputs.
The document introduces fuzzy set theory as an extension of classical set theory that allows for elements to have varying degrees of membership rather than binary membership. It discusses key concepts such as fuzzy sets, membership functions, fuzzy logic, fuzzy rules, and fuzzy inference. Fuzzy set theory provides a framework for modeling imprecise and uncertain concepts that are common in human reasoning.
Fuzzy logic was introduced in 1965 by Lofti Zadeh based on fuzzy set theory. It allows for intermediate values between 0 and 1, unlike boolean logic which only considers true or false. A fuzzy logic system uses fuzzification to convert crisp inputs to fuzzy values, applies a rule base and inference engine to the fuzzy values, and then uses defuzzification to convert the fuzzy output to a crisp value. Fuzzy logic is useful for approximate reasoning and has applications in areas like control systems, decision making, and pattern recognition.
Fuzzy set theory is an extension of classical set theory that allows for partial membership in a set rather than crisp boundaries. In fuzzy set theory, elements have a degree of membership in a set defined by a membership function ranging from 0 to 1 rather than simply belonging or not belonging to a set. Fuzzy sets and logic can model imprecise concepts and are used in applications involving uncertain or ambiguous information like fuzzy controllers.
Fuzzy logic allows for modeling of imprecise concepts using fuzzy sets and fuzzy rules. A fuzzy set is characterized by a membership function that assigns a degree of membership between 0 and 1 to elements of a universe of discourse. Common fuzzy set operations include intersection, union, and complement. Fuzzy rules relate fuzzy propositions through an if-then structure. A fuzzy associative matrix maps the antecedent fuzzy set to the consequent fuzzy set to perform fuzzy inference using max-min composition. Fuzzy logic provides a framework for approximate reasoning about vague or uncertain concepts.
Fuzzy set theory is an extension of classical set theory that allows for partial membership in a set rather than crisp boundaries. In fuzzy set theory, elements have a degree of membership in a set ranging from 0 to 1 rather than simply belonging or not belonging to the set. This allows fuzzy set theory to model imprecise concepts more accurately. Fuzzy sets use membership functions to define the degree of membership for each element. Common membership functions include triangular, trapezoidal, and Gaussian functions. Fuzzy set theory is useful for modeling human reasoning and systems that involve imprecise or uncertain information.
This document discusses soft computing and fuzzy set theory. It explains that fuzzy set theory allows for uncertain or vague knowledge to be represented using propositions and rules. Operations on fuzzy sets like intersection, union, and complement are defined using characteristic functions in a similar way to classical set theory. Fuzzy sets have applications in areas like artificial intelligence, control engineering, and decision making. Fuzzy rule-based systems and fuzzy control use fuzzy knowledge bases and inference to derive conclusions. Fuzzy data mining and fuzzy optimization apply fuzzy set concepts to improve existing techniques for data analysis and constrained optimization problems.
The document provides an overview of fuzzy logic and fuzzy sets. It discusses how fuzzy logic can handle imprecise data unlike classical binary sets. Membership functions assign degrees of membership values between 0 and 1. Fuzzy logic systems use if-then rules and linguistic variables. An example shows how fuzzy logic is used to estimate project risk levels based on funding and staffing levels. Fuzzy logic has been applied in various domains due to its ability to model human reasoning.
This document discusses fuzzy logic and fuzzy sets. It introduces fuzzy logic as an extension of classical binary logic that can handle imprecise and vague concepts. Fuzzy sets assign elements a membership value between 0 and 1 rather than crisp inclusion/exclusion. Common fuzzy set operations like union, intersection, complement and containment are defined based on the membership values. Membership functions are used to represent fuzzy sets graphically. Fuzzy logic can model human decision making and common sense in applications where information is uncertain or probabilistic.
This document discusses using repeated simulations of a crisp neural network to obtain quasi-fuzzy weight sets (QFWS) that can be used to initialize fuzzy neural networks. The key points are:
1) A crisp neural network is repeatedly trained on input-output data to model an unknown function. The connection weights change with each simulation.
2) Recording the weights from multiple simulations produces quasi-fuzzy weight sets, where each weight is a fuzzy set rather than a single value.
3) These QFWS can provide initial solutions for training type-I fuzzy neural networks with reduced computational complexity compared to random initialization.
4) The QFWS follow fuzzy arithmetic and allow both numerical and linguistic data to
The document discusses using the Nelder-Mead search algorithm to optimize parameters in the Fuzzy BEXA machine learning algorithm. Specifically, it aims to optimize parameters related to converting data files, defining membership functions, and setting threshold cutoffs, to maximize classification accuracy. The author developed a Java program to optimize two threshold parameters (αa and αc) using Nelder-Mead to search the parameter space and call Fuzzy BEXA to evaluate classification accuracy as the objective function. While Nelder-Mead works well for this optimization, initial parameter guesses can impact finding the true global optimum.
This document summarizes a lecture on fuzzy logic and neural networks. It introduces fuzzy sets and compares them to classical or crisp sets. Key concepts covered include fuzzy set representation using membership functions, common membership function types like triangular and trapezoidal, fuzzy set operations, and properties of fuzzy and crisp sets. Examples are provided to demonstrate calculating membership values and performing operations on fuzzy sets.
Similar to Fuzzy logic and fuzzy time series edited (20)
The Building Blocks of QuestDB, a Time Series Databasejavier ramirez
Talk Delivered at Valencia Codes Meetup 2024-06.
Traditionally, databases have treated timestamps just as another data type. However, when performing real-time analytics, timestamps should be first class citizens and we need rich time semantics to get the most out of our data. We also need to deal with ever growing datasets while keeping performant, which is as fun as it sounds.
It is no wonder time-series databases are now more popular than ever before. Join me in this session to learn about the internal architecture and building blocks of QuestDB, an open source time-series database designed for speed. We will also review a history of some of the changes we have gone over the past two years to deal with late and unordered data, non-blocking writes, read-replicas, or faster batch ingestion.
The Ipsos - AI - Monitor 2024 Report.pdfSocial Samosa
According to Ipsos AI Monitor's 2024 report, 65% Indians said that products and services using AI have profoundly changed their daily life in the past 3-5 years.
ViewShift: Hassle-free Dynamic Policy Enforcement for Every Data LakeWalaa Eldin Moustafa
Dynamic policy enforcement is becoming an increasingly important topic in today’s world where data privacy and compliance is a top priority for companies, individuals, and regulators alike. In these slides, we discuss how LinkedIn implements a powerful dynamic policy enforcement engine, called ViewShift, and integrates it within its data lake. We show the query engine architecture and how catalog implementations can automatically route table resolutions to compliance-enforcing SQL views. Such views have a set of very interesting properties: (1) They are auto-generated from declarative data annotations. (2) They respect user-level consent and preferences (3) They are context-aware, encoding a different set of transformations for different use cases (4) They are portable; while the SQL logic is only implemented in one SQL dialect, it is accessible in all engines.
#SQL #Views #Privacy #Compliance #DataLake
06-04-2024 - NYC Tech Week - Discussion on Vector Databases, Unstructured Data and AI
Discussion on Vector Databases, Unstructured Data and AI
https://www.meetup.com/unstructured-data-meetup-new-york/
This meetup is for people working in unstructured data. Speakers will come present about related topics such as vector databases, LLMs, and managing data at scale. The intended audience of this group includes roles like machine learning engineers, data scientists, data engineers, software engineers, and PMs.This meetup was formerly Milvus Meetup, and is sponsored by Zilliz maintainers of Milvus.
Global Situational Awareness of A.I. and where its headedvikram sood
You can see the future first in San Francisco.
Over the past year, the talk of the town has shifted from $10 billion compute clusters to $100 billion clusters to trillion-dollar clusters. Every six months another zero is added to the boardroom plans. Behind the scenes, there’s a fierce scramble to secure every power contract still available for the rest of the decade, every voltage transformer that can possibly be procured. American big business is gearing up to pour trillions of dollars into a long-unseen mobilization of American industrial might. By the end of the decade, American electricity production will have grown tens of percent; from the shale fields of Pennsylvania to the solar farms of Nevada, hundreds of millions of GPUs will hum.
The AGI race has begun. We are building machines that can think and reason. By 2025/26, these machines will outpace college graduates. By the end of the decade, they will be smarter than you or I; we will have superintelligence, in the true sense of the word. Along the way, national security forces not seen in half a century will be un-leashed, and before long, The Project will be on. If we’re lucky, we’ll be in an all-out race with the CCP; if we’re unlucky, an all-out war.
Everyone is now talking about AI, but few have the faintest glimmer of what is about to hit them. Nvidia analysts still think 2024 might be close to the peak. Mainstream pundits are stuck on the wilful blindness of “it’s just predicting the next word”. They see only hype and business-as-usual; at most they entertain another internet-scale technological change.
Before long, the world will wake up. But right now, there are perhaps a few hundred people, most of them in San Francisco and the AI labs, that have situational awareness. Through whatever peculiar forces of fate, I have found myself amongst them. A few years ago, these people were derided as crazy—but they trusted the trendlines, which allowed them to correctly predict the AI advances of the past few years. Whether these people are also right about the next few years remains to be seen. But these are very smart people—the smartest people I have ever met—and they are the ones building this technology. Perhaps they will be an odd footnote in history, or perhaps they will go down in history like Szilard and Oppenheimer and Teller. If they are seeing the future even close to correctly, we are in for a wild ride.
Let me tell you what we see.
Beyond the Basics of A/B Tests: Highly Innovative Experimentation Tactics You...Aggregage
This webinar will explore cutting-edge, less familiar but powerful experimentation methodologies which address well-known limitations of standard A/B Testing. Designed for data and product leaders, this session aims to inspire the embrace of innovative approaches and provide insights into the frontiers of experimentation!
Analysis insight about a Flyball dog competition team's performanceroli9797
Insight of my analysis about a Flyball dog competition team's last year performance. Find more: https://github.com/rolandnagy-ds/flyball_race_analysis/tree/main
Predictably Improve Your B2B Tech Company's Performance by Leveraging DataKiwi Creative
Harness the power of AI-backed reports, benchmarking and data analysis to predict trends and detect anomalies in your marketing efforts.
Peter Caputa, CEO at Databox, reveals how you can discover the strategies and tools to increase your growth rate (and margins!).
From metrics to track to data habits to pick up, enhance your reporting for powerful insights to improve your B2B tech company's marketing.
- - -
This is the webinar recording from the June 2024 HubSpot User Group (HUG) for B2B Technology USA.
Watch the video recording at https://youtu.be/5vjwGfPN9lw
Sign up for future HUG events at https://events.hubspot.com/b2b-technology-usa/
1. 1
Fuzzy Logic and Fuzzy Set
Theory & Time Series Modeling
Prof. Dr. S.M. Aqil Burney
College of Computer Science and
Information System (IoBM)
aqil.burney@iobm.edu.pk
Former Meritorious Professor and Chairman Dept. of Computer Science
University of Karachi (1973-20110) burney@uok.edu.pk
www.burney.net
3. Vageness & Uncertainty
• It is evident that as we are using ICT and
other technologies and generating huge data
we come across complexity which consists
Vagueness and Uncertainty which could not
be handled amicably without logic which ,
helps us to formulate & model and solve the
problems.
3
4. 4
Fuzzy Logic and Fuzzy Set Theory
e.g. A={1,2,3,4}, so 1 belongs to A but 5 is not
member of set A.
• Fuzzy sets are a natural outgrowth and
generalization of crisp sets.
• It tells us besides “belongs to” and “not belongs
to” way, other possibilities exist in the relation
between an element and a set emerging in
various practical processes.
• A crisp set defines only two possibilities
“belongs to=(1)” or “not belongs to=(0)”.
Lotfi Zadeh
5. Fuzzy Logic and Fuzzy Set Theory: (Cont…)
• Unlike crisp sets with sharp boundaries as discussed above, a
fuzzy set is a set with smooth (un-sharp) boundaries.
• e.g. A set whose elements PARTIALLY belongs to that set.
• e.g 40% belongs to and 60% not belongs to some particular set.
• Binary sets contains only two values 0 and 1, Whereas fuzzy
sets consider all the values in the interval [0,1].
• Classical/crisp sets are suitable for various applications and
have proven to be important tool. But they do not reflect the
nature of human concepts and thoughts, which tends to be
abstract and imprecise.
• Fuzzy logic is the study of imperfect, imprecise and ambiguous
knowledge. This knowledge includes the linguistic chaos as well.
5
6. 6
Some Examples of fuzzy data (Linguistic Chaos)
•Today is very hot day.
(Degree of hotness is not defined. Inexact value)
• He is very intelligent
(Here intelligence is a matter of degree (%) and differ from
person to person)
• If you work hard then you will get the success
(Inference based on qualitative data)
7. Fuzzy Logic : Degree of Relation
• We know many things in life are degree
rather than present or not present.
• A green and red apple is not just green and
red; there many levels of green and red
shades, computer scientists ,technologist
and engineers and to some extend
statistician have accepted this theory.
7
8. Example (Degree of Relation)
• A pixel can have a bright ness level between
0 and 255.
• 0 value = Black 255 value = White ,
• While every value between 0 and 255 gives a
gray level.
8
9. 9
Fuzzy Logic and Fuzzy Set Theory: (Cont…)
• Fuzzy theory holds that many things in life are matter of degree.
• Thus the association of each element in a universe of discourse
is a matter of degree, which is a number between 0 and 1.
e.g its 60% cold in this hall and 40% not cold. So degree of
coldness is a fuzzy concept.
• This is represented by where A= fuzzy set and X is the
universe of discourse.
• Relation of an element with its set A is partially true and partially
false .
• Law Contradiction(excluded middle) needs revisit.
• Law Included Middle
( )xAµ
10. 10
Fuzzy Logic and Fuzzy Set Theory: (Cont…)
• Fuzzy sets are a natural outgrowth and generalization of crisp
sets.
• A fuzzy set can be defined in two ways.
Enumerating membership values of those elements in the
set (completely or partially).(Discrete membershop function)
Defining membership function mathematically for the given
universe of discourse. The universe of discourse may be
discrete or continuous or may be mixture of the two types.
11. 11
Fuzzy Logic and Fuzzy Set Theory: (Cont…)
• A crisp set can be generalized to multiple categories and each
category is assigned its relevant value called the membership
value.
• Larger values denote high degrees of set membership
• For simplicity and completeness, a membership function (MF)
maps every element of a universe of discourse X into real
numbers [0,1]
12. 12
Fuzzy Logic and Fuzzy Set Theory: (Cont…)
• For notational purpose, membership function of a fuzzy set is given
by
( ) ( ) ( ) ( ) nnAAAi
i
iA xxxxxxxxA /.../// 2211 µµµµ +++== ∑
where ix X∈ In case of continuous universe of discourse,
( )∫=
x
iiA xxA /µ
13. 13
Fuzzy Logic and Fuzzy Set Theory: (Cont…)
• Formally, a fuzzy set A along with its MF ( ) Xxx iA ∈;µ is defined as
( )( ){ }XxxxA ∈= A, µ
Where ( ) Xxx iA ∈;µ can take any of the function that
satisfies the conditions of a fuzzy membership function
14. 14
Example: Discrete Universe of Discourse
. One poAn insurer wants to classify the types of plan for late
premium paymentsssible reason is the possible number of months of
delay in premium payments (X). Let
{ }10,...,2,1=X
be the set of available types of offers to the customers by the
insurance company. Then the fuzzy set “ease of payment to the
customer” may be described as follows:
A={(1,0.2), (2,0.5), (3,0.6), (4,0.7), (5,0.8), (6,0.9)}
15. 15
Example: Discrete Universe of Discourse
1 2 3 4 5 6 7
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
Premium payements
Membershipvalues
Ease of Payment for a Customer
16. 16
Properties of Fuzzy Sets
The fuzzy logic provides us an intuitively pleasing method of
representing one form of uncertainty.
In designing fuzzy inference systems, some preliminary concepts
need to be defined properly.
Some definitions necessary for designing of fuzzy systems are given
17. 17
Example: Discrete Universe of Discourse
Given a fuzzy set A defined on X and any number [ ]0,1α ∈ , the
α -cut, Aα
and the strong α -cut, A+α
are crisp sets given by
( ){ }αα
≥= xAxA |
( ){ }αα
>=+
xAxA |
18. 18
Example: Level Set Representation of Fuzzy Sets Providing Discrete
Approximation to Continuous Membership Functions
Age Fuzzy Set
Young
Middle Age
Old
A discrete approximation of A2 (Middle Age) is presented and the MF values of
A2 are denoted by D2.
( ) ( )
≥
<<−
≤
=
350
352015/35
201
1
x
xx
x
xA
( )
( )
( )
≤≤
<<−
<<−
≥≤
=
45351
604515/60
352015/20
60200
2
x
xx
xx
xorx
xA
( ) ( )
≥
<<−
≤
=
601
604515/45
450
3
x
xx
X
xA
19. 19
Discrete Approximation of Continuous Universe of Discourse
0 10 20 30 40 50 60 70 80
0
0.2
0.4
0.6
0.8
1
1.2
YoungYoung Middle Aged Old
20. 20
Age Factor and Related Risk Membership Function
0 10 20 30 40 50 60 70 80 90
0
0.2
0.4
0.6
0.8
1
1.2
X= Age
MembershipGrades
Young Middle Aged Old
21. 21
Support ( ) of a Fuzzy Set
( ){ }0|)( >= xxASupport Aµ
The support of a fuzzy set A denoted by supp(A), within a universe
of discourse X is the crisp set that contains all the elements of X that
have nonzero membership grades in A.
A+0
22. 22
Fuzzy convexity
( )( ) ( ) ( )1 2 1 21 min ,A x x A x A xµ λ λ + − ≥
A set A in n
R is called convex iff, for every pair of points
is also in A
Here the sets A1-A5 are convex and A6-A9 are non-convex sets.
23. 23
Fuzzy symmetry
A fuzzy set A is symmetric if its MF is symmetric around a certain
point , x=c, namely,
( ) ( ) ,A Ac x c x x Xµ µ+ = − ∀ ∈
24. 24
Some Membership Functions
A membership function provides a gradual transition form regions
completely outside a set to regions completely inside the set.
Its usefulness depends critically on our capability to construct
appropriate membership functions for various given concepts in
various contexts.
Even for similar contexts, the representation of a system using
fuzzy logic may vary considerably.
25. 25
Triangular Membership Function
( )
≤
≤≤
−
−
≤≤
−
−
≤
=
xc
cxb
bc
xc
bxa
ab
ax
ax
cbaxtriangle
0
0
,,;
0 1 2 3 4 5 6 7 8 9 10
0
0.2
0.4
0.6
0.8
1
trim f(x, [3 4 5]); trim f(x, [2 4 7]); trim f(x, [1 4 9]);
Triangular M em bership Function
0 1 2 3 4 5 6 7 8 9 10
0
0.2
0.4
0.6
0.8
1
trim f(x, [2 3 5]); trim f(x, [3 4 7]); trim f(x, [4 5 9]);
0 1 2 3 4 5 6 7 8 9 10
0
0.2
0.4
0.6
0.8
1
trim f(x, [3 4 5]); trim f(x, [2 4 7]); trim f(x, [1 4 9]);
Triangular M em bership Function
0.6
0.8
1
Different shapes of Triangular function for varying parameters
28. 28
Sigmoidal Membership Function
( )
( )[ ]
,
exp1
1
,;
cxa
caxsig
−−+
=
Depending on the sign of a, a sigmoidal function is inherently open
right or open left and thus is appropriate for representing concepts
such as “very risky” or “very negative”.
Sigmoidal functions of this type are used in training of neural
networks
30. 30
Fuzzy Set Theoretic Operations
• Corresponding to the crisp set operations, we can define fuzzy
set operations for fuzzy sets.
• The set operations intersection and union correspond to logic
operations, conjunction (AND) and disjunction (OR), respectively.
• Normally, for fuzzy intersection, we use ‘min’ or ‘AND’ operator
and for fuzzy union, we usually apply ‘max’ or ‘OR’ operators.
31. 31
Fuzzy Intersection (conjunction)
The intersection of two fuzzy sets A and B is specified in general
by a function [ ] [ ] [ ]1,01,01,0: →×T
If membership values of A and B are ( )xAµ and ( )xBµ then fuzzy
conjunction is given by
( ) ( ) ( ) ( ), ,A B x T A x B x x X ∩ = ∀ ∈
where T represents a binary operation for the fuzzy intersection.
32. 32
T-norm
This class of fuzzy intersection operators are usually referred to as
T-norm (triangular norm) operators.
T-norm operator satisfies the fuzzy arithmetic axioms like boundary
condition, monotonicity, commutativity, associativity, continuity and
etc.
Examples of frequently used fuzzy intersection.
( ) ( )babaT ,min, =
( ) abbaT =,
Standard intersection:
Algebraic product:
33. 33
Fuzzy Union (Disjunction)
Like fuzzy intersection, fuzzy union operator is defined by a function
[ ] [ ] [ ]1,01,01,0: →×S
( ) ( ) ( ) ( ), ,A B x S A x B x x X ∪ = ∀ ∈
where S represents a binary operation for the fuzzy union.
Properties that a function S satisfies to be intuitively acceptable as
a fuzzy union are exactly the same as properties of t-conorm.
Some frequently used t-conorm operation
( ) ( )babaS ,max, =
( ) abbabaS −+=,
Standard disjunction:
Algebraic product:
34. 34
Membership Functions of Two Dimensions
In multivariate studies, we need to define membership functions of
higher dimensions.
For example, let X and Y be two fuzzy numbers and R be the 2-D
fuzzy set on Z X Y= ×
Cylindrical extension is a natural way to extent one-dimensional
MFs to two-dimensional MFs define below.
35. 35
Cylindrical Extension
If A is a fuzzy set in X, then its cylindrical extension in
is a fuzzy set defined by
YX ×
( ) ( ) ( )∫×
=
YX
A yxxAc ,µ
The concept of cylindrical extension extends the dimensions of a
given MFs.
36. 36
Fuzzy Projection
• Projects a fuzzy relation to a subset of selected dimensions.
• Often used to extract marginal possibility distribution of a few
selected variables from a given fuzzy relation.
• It decreases the dimension of a given (multidimensional) MF.
• Let R be a two-dimensional fuzzy set on .Then the
projection of R onto X and Y are defined as
YX ×
( ) yyxR R
Y
x
Y ,max µ∫=
( ) xyxR R
X
y
X ,max µ∫=
37. 37
Extension Principle
• Provides a general procedure for extending crisp domains of
mathematical expressions to fuzzy domains.
• Plays fundamental role in extending any point-to-point
operations to fuzzy operations.
38. 38
Extension Principle For One-to-one Fuzzy Relations
Assume X and Y are two crisp sets and let be a mapping
from X into Y, ,YXf →:
f
( ),x X f x y Y∈ = ∈
Assume A is a fuzzy subset of X, using extension principle, we can
define as a fuzzy subset of Y such that,( )Af
( ) ( ) ( ) ( ) ( ) ( ) nnAAAiiA
Xx
B yxyxyxyxAfy /.../// 2211 µµµµµ +++=∪==
∈
( ) .,...,2,1, nixfy ii ==where
39. 39
Extension Principle for Many-to-one Fuzzy Relations
If is a many-to-one relation, then we may have more than
one possibility at each value of x. that is ,
Therefore,
f(x)y =
( ) ( ) Yyxfxf ∈== *
21 2121 ,, xxXxx =∈
( ) ( )
( )xy A
yfx
B µµ 1
max−
=
=
40. 40
Generalized Extension Principle
iA
Suppose that f is a mapping from an n-dimensional Cartesian space
nXXX ××× ...21 to a single universe of discourse Y such that ( ) ,,...,, 21 yxxxf n =
and for each , 1,2,...,iX i n= a fuzzy membership is defined.
Thus total n fuzzy membership functions are defined. Then by the
extension principle, we can define
( ) ( )
( )[ ] ( )
( )
=
≠
=
−
−
= −
φ
φµ
µ
yfif
yfifx
y
iAi
yfxxx
B
i
n
1
1
,...,,
,0
minmax 1
21
41. 41
Where to Apply
In fuzzy neural networks, fuzzy projection and extension principle
are used to generalize backpropagation algorithm to fuzzy
backpropagation learning algorithm.
42. 42
2. Fuzzy Relations
Topics to be discussed in this section
• Binary Relations
• Linguistic Hedges
• Fuzzy If-Then Rules
• Fuzzy Reasoning
43. 43
Fuzzy Relations
• Generalizes the notion of crisp relation into one that allows
partial membership.
• Degree of association can be represented by membership
grades in a fuzzy relation in the same way as the degrees of set
membership are represented in the fuzzy sets.
• A relation defined between two objects is represented by a
binary relation. Similarly, we can form tern-ary, quartern-ary,
quin-ary or n-ary relation between three, four, five or n objects,
respectively.
44. 44
Binary Crisp Relationship
Mathematically speaking, if x and y be two variables from two
domains X and Y respectively, then the binary relation between x
and y, R(x,y) is a subset of Cartesian space of X and Y.
define the relationX<y, as below
( ){ }RyxyxyxR ∈<= ,,|,
( ) YXyxR ×⊆,Where
45. 45
Crisp n-Dimensional Relations
( )1 2 1 2, ,..., ...n nR X X X X X X⊆ × × ×
In general, for n-dimensional arguments taken from the
domains ,then
nxxx ,...,, 21
1 2, ,..., nX X X
We see that a relation is again a set and thus follows the same
rules as the domain of Cartesian product of nXXX ,...,, 21
46. 46
Binary Fuzzy Relations
If x and y are two fuzzy variables with domains X and Y then the
binary fuzzy relation R is
( ) ( ) ( ){ }YXyxyxyxR R ×∈= ,|,,, µ
[ ]1,0: →×YXRwhere
47. 47
Fuzzy Relations
• The binary fuzzy relation can be extended for n-arguments.
• This allows the characteristic function of a crisp relation to allow
tuples to have degree of membership within the relation.
• The membership grades indicate the strength of the relation
present between the elements of the tuple.
• A fuzzy relation is a fuzzy set defined on the Cartesian product
space of crisp sets where the tuples may have
varying degrees of membership within the relation.
( )nxxx ,...,, 21
48. 48
Fuzzy Composition Rule
• Fuzzy relationship in different product spaces can be combined
through a composition operation.
• Different composition operations have been suggested for
fuzzy relations
• The best known is the max-min composition operation by
Zadeh (1965).
49. 49
Max-Min Fuzzy Composition Rule of Inference
Let and be two fuzzy relation defined on and
,respectively. The max-min composition of and is a fuzzy set
defined by
1R 2R YX × ZY ×
1R 2R
( ) ( ) ( )( ){ }ZzYyXxzyyxzxRR RR
y
∈∈∈= ,,|,,,minmax,, 2121 µµ
or equivalently,
( ) ( ) ( )( )zyyxzx RR
y
RR ,,,minmax, 2121
µµµ =
( ) ( )[ ]zyyx RR
y
,, 21
µµ ∧∨
The composition rule of inference is not uniquely defined. By choosing different
fuzzy conjunction and disjunction operators, we can get different composition
rules of inference.
50. 50
Max-Product Fuzzy Composition Rule of Inference
An alternate to max-min composition called max-product
composition is used due to its higher mathematical tractability then
max-min composition and can be defined as same as max-min
composition:
( ) ( ) ( )( )zyyxzx RR
y
RR ,,,max, 2121
µµµ =
51. 51
Properties of Fuzzy Relations
The fuzzy composition rules follow several properties common to
binary relations. If A, B and C are binary relations on and
then
ZYYX ×× ,
WZ ×
Associativity
Distributive over union
Weak distributivity over intersection
Monotonicity
( ) ( )A B C A B C=
( ) ( ) ( )CABACBA ∪=∪
( ) ( ) ( )CABACBA ∩⊆∩
CABACB ⊆⇒⊆
52. 52
3. Fuzzy IF-Then Rules
Topics to be discussed in this section
• Linguistic variables
• Linguistic Hedges
• Fuzzy If-Then Rules
• Fuzzy Reasoning
53. 53
Fuzzy IF-Then Rules
Fuzzy If-then rules or fuzzy inferencing is an extension of crisp
propositional statements.
They allow human knowledge and common sense representation
using modes-ponen rule of inference and are able to make
conclusions in the presence of uncertainty and chaos.
To deal with variety of decisions on a single problem, give place to
include fuzzy hedging operators that enables a fuzzy inference
system to deal with extremities.
54. 54
Linguistic variables
The concept of fuzzy numbers plays a fundamental role in
formulating quantitative fuzzy variables, i.e., the variables whose
states are fuzzy numbers.
When in addition, the fuzzy numbers represents linguistic
concepts, such as very low, high, extreme and so on, as
interpreted in a particular context, the resulting constructs are
usually called linguistic variables.
A linguistic variable is characterized by a quintuple ( )( ), , , ,x T x X G M
x =is the name of variable; X is the universe of discourse.
T(x) =is the linguistic term set of x;
G =is a syntactic rule which generates the terms in T(x) and
M =is the semantic rule which associates with each linguistic
value A its meaning M(A), where A denotes a fuzzy set in X.
55. 55
Linguistic Hedges
A linguistic variable enables its values to be described qualitatively
by a linguistic term and quantitatively by a corresponding
membership function.
The linguistic term is used to express concepts and knowledge in
human communication, whereas membership function is useful for
processing numerical input data.
For example, very, more or less, fairly, or extremely are all hedges
defined for linguistic variables.
56. 56
Linguistic Hedges (Cont...)
Let A be a linguistic value characterized by a fuzzy set with
membership function , Then is interpreted as modified
version of the original value expressed as
( ).Aµ k
A
( )[ ]∫==
X
k
A
k
xxA µ
The linguistic hedges can either concentrate (increase) or dilate
(decrease) the significance of a fuzzy set.
( ) 0,ACON ≥= kAk
( ) 10, <<= kAADIL k
Using linguistic hedges, we can define composite linguistic
terms in fuzzy reasoning.
57. 57
Fuzzy If-Then Rules
A fuzzy if-then rule (or fuzzy implication) defines a relation between
x and y.
A fuzzy if-then rule be defined as a binary fuzzy relation R on the
product space YX ×
If A and B are two fuzzy sets defined over X and Y and
then the implication is given as
YyXx ∈∈ ,
A B→
if x is A then y is B
Here "x is A" is the antecedent or premise, while "y is B" is called
the consequent or conclusion.
58. 58
Fuzzy If-Then Rules (Cont…)
Some examples of fuzzy if-then rules are:
• if risk is high then premium is high
• if interest rate is high then liquidity is low.
• if rate of return is adequate then investment will increase
59. 59
Fuzzy Reasoning/Fuzzy Expert System
An inferential procedure that derives conclusions from a set of if-
then rules and known facts.
Using compositional rules of inference and generalized modes-
ponens (GMP) rule, we can define three possible cases in fuzzy
reasoning
• Single rule with single antecedent. (SRSA)
• Single rule with multiple antecedents. (SRMA)
• Multiple rules and multiple antecedents. (MRMA)
61. 61
Fuzzy Aggregation/Averaging Operations
• A class of types of defuzzification in fuzzy inference/expert
systems.
• Using fuzzy aggregation operations on fuzzy sets, we can obtain
appropriate single fuzzy set.
• In fuzzy inference engines, these operations allow us to combine
multiple rules using single rule of inference.
62. 62
Axioms of Fuzzy Aggregation Operations (Cont…)
Formally, we define
[ ] [ ]1,01,0: →
n
h
nAAA ,...,, 21 are fuzzy sets defined on X.
Thus the aggregated fuzzy set A defined over X will be
( ) ( ) ( ) ( )( )xAxAxAhxA n...,,, 21= for each Xx∈
Fuzzy Aggregation operations are necessary in defuzzification of
ordered/unordered fuzzy knowledge.
63. 63
Axioms of Fuzzy Aggregation Operations
In order to qualify as an intuitive and meaningful aggregation
function (h), it must satisfy at least following three requirements.
Axiom 1: ( ) ( ) 11,...,1,100,...,0,0 == handh (Boundary condition)
Axiom 2: ( )naaa ,...,, 21 and ( )nbbb ,...,, 21 such that, if ii ba ≤ ,then
( ) ( )nn bbbhaaah ,...,,...,, 2,121 ≤ (Monotonically increasing)
Axiom 3: Fuzzy aggregation operation, h, is a continuous function.
64. 64
Axioms of Fuzzy Aggregation Operations (Cont…)
Other two additional axioms are:-
h is symmetric function in all its arguments; i.e.,
Axiom 5:
Axiom 4:
( ) ( ) ( ) ( )( )npppn aaahaaah ,...,,,...,, 2121 =
For any permutation of p on N
h is an idempotent function; that is,
( ) [ ]1,0,...,, ∈∀= aaaaah
65. 65
Fuzzy Idempotency for Aggregation Operations
Note that, if any aggregation operation satisfies axioms 2-5, then
it also satisfy the inequality
( ) ( ) ( )nnn aaaaaahaaa ,...,,max,...,,,...,,min 212121 ≤≤
( ) [ ]n
naaa 1,0,...,, 21 ∈for all n-tuples
66. 66
Generalized Fuzzy Aggregation Operation
** All aggregation operations between the standard fuzzy
intersection and union are idempotent.
These aggregation operations are usually called averaging
operations.
The generalized mean is defined as:
( )
αααα
α
1
21
21
...
,...,,
+++
=
n
aaa
aaah n
n
67. 67
5. Fuzzy Time Series
Pioneer Researchers and practitioners:
1. Zadeh (1975)
2. Yager R. R. (2005)
3. Kacpryzk (Germany) (Springer-Verlag)
4. Klir (2005)
5. Chen S. M. and Lee L.W. (2004, 2006,2007,2008)
6. Huang K. (2001, 2003, 2004, 2007, 2008)
7. Zimmermann (2002)
8. Oscar Castillo (2007)
9. Burney and Jilani (2006, 2007, 2008)
68. 68
Each observation is assumed interval based fuzzy variable
alongwith associated membership function.
Less than one and half decade of history of fuzzy time series.
Based on fuzzy relation and fuzzy inference rules, efficient modeling
and forecasting of fuzzy time series is possible.
Fuzzy Times Series
69. 69
Fuzzy Times Series
Time series analysis plays vital role in most of the actuarial related
problems.
Based on fuzzy relation, section 2.2.7 and fuzzy inference rules,
section 2.2.8, efficient modeling and forecasting of fuzzy time
series is possible.
This field of fuzzy time series analysis is not very mature due to
the time and space complexities in most of the actuarial related
issue.
70. 70
Review of Fuzzy Time Series
Song and Chissom (1993a; 1993b; 1994) presented the concept of fuzzy time series
based on the concepts of fuzzy set theory to forecast the historical enrollments of the
University of Alabama.
Huarng (2001b) presented the definition of two kinds of intervals in the universe of
discourse to forecast the TAIFEX.
Chen (2002) presented a method for forecasting based on high-order fuzzy time series.
Lee et. al. (2004) presented a method for temperature prediction based on two-factor
high-order fuzzy time series.
Melike and Konstsntin (2004) proposed forecasting method using first order fuzzy time
series.
Lee, Wang and Chen (2006) presented handling of forecasting problems using two-factor
high order fuzzy time series for TAIFEX and daily temperature in Taipei, Taiwan.
71. 71
Jilani T. A. and Aqil Burney S. M. (2008), A Refined Fuzzy Time Series Model for
Enrollments Problem, Physica A, Elsevier Publishers.
Jilani T. A. and Aqil Burney S. M. (2008), Multivariate Stochastic Fuzzy Forecasting
Models, Expert Systems with Applications 37(2), Elsevier Publishers.
Jilani T. A. and Aqil Burney S. M. (2007), M-Factor High Order Fuzzy Time Series
Forecasting for Road Accident Data, In IEEE-IFSA 2007, World Congress, Cancun,
Mexico, June 18-21, In Castillo, O.; Melin, P.; Montiel Ross, O.; Sepúlveda Cruz, R.;
Pedrycz, W.; Kacprzyk, J. (Eds.), Design and Analysis of Intelligent Systems
usingFuzzy Logic and Soft Computing vol. 41, Advances in Soft Computing, Berlin:
Springer-Verlag.
Jilani T. A., Aqil Burney S. M. and Ardil C.(2008), Multivariate High Order Fuzzy Time
Series Forecasting for Car Road Accidents. International Journal of Computational
Intelligence, Vol. 4, no. 1. pp. 7-16.
Review of Fuzzy Time Series (Cont…)
72. 72
Jilani T. A., Aqil Burney S. M. and Ardil C. (2007), Fuzzy metric approach for fuzzy
time series forecasting based on frequency density based partitioning, International
Conference on Machine Learning and Pattern Recognition. August 24-26 (2007),
Berlin, Germany.
Jilani T. A. and Aqil Burney S. M. (2007), A New Quantile Based Fuzzy Time Series
Forecasting Model, submitted in Computers and Mathematics With Applications
(CMWA), Elsevier Publishers.
Jilani T. A. and Aqil Burney S. M. (2007), Fuzzy Time Series Forecasting Using
Frequency Density Based Partitioning for Enrollments Problem, submitted in Expert
Systems with Applications (ESWA), Elsevier Publishers.
Review of Fuzzy Time Series (Cont…)
73. 73
Two-Factor kth-Order Fuzzy Time Series Model
We can extend the concept of single antecedent and single
consequent (one-to-one) to many antecedents and single
consequent (many-to-one).
For example, in designing two-factor kth-order fuzzy time series
model with X be the primary and Y be second fact.
We assume that there are k antecedent
and one consequent
( ) ( ) ( )( )kk YXYXYX ,,...,,,, 2211
1+kX
( ) ( ) ( ) ( )1122221111 ,,...,,,, ++ =→====== kkkkkk xXyYxXyYxXyYxXIf
74. 74
Two- Factor Fuzzy inferencing
We can extend the concept of single antecedent and single
consequent (one-to-one) to many antecedents and single
consequent (many-to-one).
For example, in designing two-factor kth-order fuzzy time series
model with X be the primary and Y be second factor.
( ) ( ) ( ) ( )1122221111 ,,...,,,, ++ =→====== kkkkkk xXyYxXyYxXyYxXIf
We assume that there are k antecedent ( ) ( ) ( )( )kk YXYXYX ,,...,,,, 2211
and one consequent 1+kX
75. 75
M-Factor and k-th Order Fuzzy Time Series Model
( ) ( )
( ) ( )
11 11 12 12 1 1 21 21 22 22 2 2
1 1 2 2 1, 1 1, 1
, ,..., , , ,..., ,...,
, ,...,
1,2,..., , 1,2,...,
k k k k
m m m m mk mk m k m k
X x X x X x X x X x X x
X x X x X x X x
for i m j k
+ + + +
= = = = = =
= = = =
= =
If
then
In the similar way, we can define m-factor (i=1,2,…,m) and kth
order (k=1,2,…,k) fuzzy time series as
76. 76
• We can define relationship among present and future state of a
time series with the help of fuzzy sets.
Fuzzy Time Series
kA , respectively, where UAA kj ∈, ,then kj AA → represented the
Assume the fuzzified data of the thi ( )thi 1+ day areand jA and
andjAfuzzy logical relationship between kA
77. 77
Fuzzy Time Series
• Let ( ) ( ),...2,1,0...,,tY =t be the universe of discourse and ( ) RtY ⊆
Assume that ( ) ,...2,1, =itfi is defined in the universe of discourse
( )tY and ( )tF is a collection of ( ) ( ),...2,1,0...,,tf i =i , then ( )tF
is called a fuzzy time series of ( ) ,...2,1,tY =i
• Using fuzzy relation, we define, ( ) ( ) ( )1,1 −−= ttRtFtF , where ( ), 1R t t −
is a fuzzy relation and “ ” is the max–min composition operator,
then ( )tF is caused by ( )1−tF ( )tF ( )1−tF, where and
are fuzzy sets.
78. 78
( )tF ( )tF
( ) ( ) ( )1 , 2 ,...,F t F t F t n− − −
Let be a fuzzy time series. If is caused by
then the fuzzy logical relationship is represented by
( ) ( ) ( ) ( )tFtFtFntF →−−− 1,2,...,
is called the one-factor nth order fuzzy time series forecasting
model.
Univariate Vector Fuzzy Logic Inferencing
New Forecasting Methods Based on M-Factors High-Order Fuzzy
Time Series
79. 79
Bivariate Vector Fuzzy Logic Inferencing
New Forecasting Methods Based on M-Factors High-Order Fuzzy
Time Series
Let ( )tFbe a fuzzy time series. If( )tF is caused by
then this fuzzy logical relationship is represented by
( ) ( )( ) ( ) ( )( ) ( ) ( )( )1 2 1 2 1 21 , 1 , 2 , 2 ,..., ,F t F t F t F t F t n F t n− − − − − −
( ) ( )( ) ( ) ( )( ) ( ) ( )( ) ( )tFtFtFtFtFntFntF →−−−−−− 1,1,2,2,...,, 212121
and
is called the two-factors nth order fuzzy time series forecasting
model, where ( )tF1
( )tF2 are called the main factor and the
Secondary factor FTS respectively.
80. 80
• In the similar way, we can define m-factor nth-order fuzzy logical
relationship as
Mutivariate Vector Fuzzy Logic Inferencing
( ) ( ) ( )( ) ( ) ( ) ( )( )
( ) ( ) ( )( ) ( )tFtFtFtF
tFtFtFntFntFntF
m
mm
→−−−
−−−−−−
1,...,1,1
,2,...,2,2,...,,...,,
21
2121
Here ( )1F t is called the main factor and ( ) ( ) ( )2 3, ,..., mF t F t F t
secondary factor FTS.
are called
New Forecasting Methods Based on M-Factors High-Order Fuzzy
Time Series
81. 81
New Forecasting Methods Based on M-Factors High-
Order Fuzzy Time Series
Steps:
Step 1) Define the universe of discourse, U of the main factor
[ ]min 1 max 2,U D D D D= − −
where
minD and maxD are the minimum and the maximum values of the main
1D , 2D
proper positive real numbers to divide the universe of discourse into
n-equal length intervals 1 2,, ..., lu u u
factor of the known historical data, respectively, and are two
82. 82
Some Observations
• Here we can implement any of the fuzzy membership function to
define the FTS in above equations.
• Comparative study by using different membership functions is
also possible. However, we have used triangular membership
function due to low computational cost.
• Using fuzzy composition rules, we establish a fuzzy inference
system for FTS forecasting with higher accuracy
• Using fuzzy composition rules, we establish a fuzzy inference
system for FTS forecasting with higher accuracy
• The accuracy of forecast can be improved by considering higher
number of factors and higher dependence on history.
83. Some work in Actuarial Science ,
Health Management
• E- Health Management etc.Management
• Mobile Health Management(Internet of
Things)
• Temporal Database and Fuzzy Logic
• Software Engineering (SCM)
• Medical Image Analysis using Soft
Computing Techniques
83