SlideShare una empresa de Scribd logo
1 de 58
Descargar para leer sin conexión
Fuzzy Rule Based Networks
Alexander Gegov
University of Portsmouth, UK
alexander.gegov@port.ac.uk
Presentation Outline

Part 1 - Theory: Introduction
                 Types of Fuzzy Systems
                 Formal Models for Fuzzy Networks
                 Basic Operations in Fuzzy Networks
                 Structural Properties of Basic Operations
                Advanced Operations in Fuzzy Networks
Part 2 - Applications: Feedforward Fuzzy Networks
                       Feedback Fuzzy Networks
                       Evaluation of Fuzzy Networks
                       Fuzzy Network Toolbox
                       Conclusion
                       References

                                                             2
Introduction

Modelling Aspects of Systemic Complexity
 • non-linearity (input-output functional relationships)
 • uncertainty (incomplete and imprecise data)
 • dimensionality (large number of inputs and outputs)
 • structure (interacting subsystems)

Complexity Management by Fuzzy Systems
 • model feasibility (achievable in the case of non-linearity)
 • model accuracy (achievable in the case of uncertainty)
 • model efficiency (problematic in the case of dimensionality)
 • model transparency (problematic in the case of structure)


                                                                  3
Types of Fuzzy Systems

Fuzzification
 • triangular membership functions
 • trapezoidal membership functions

Inference
  • truncation of rule membership functions by firing strengths
  • scaling of rule membership functions by firing strengths

Defuzzification
 • centre of area of rule base membership function
 • weighted average of rule base membership function


                                                                  4
Types of Fuzzy Systems

Logical Connections
 • disjunctive antecedents and conjunctive rules
 • conjunctive antecedents and conjunctive rules
 • disjunctive antecedents and disjunctive rules
 • conjunctive antecedents and disjunctive rules

Inputs and Outputs
  • single-input-single-output
  • single-input-multiple-output
  • multiple-input-single-output
  • multiple-input-multiple-output


                                                   5
Types of Fuzzy Systems

Operation Mode
 • Mamdani (conventional fuzzy system)
 • Sugeno (modern fuzzy system)
 • Tsukamoto (hybrid fuzzy system)

Rule Base
 • single rule base (standard fuzzy system)
 • multiple rule bases (hierarchical fuzzy system)
 • networked rule bases (fuzzy network)




                                                     6
Types of Fuzzy Systems




Figure 1: Standard fuzzy system

                                  7
Types of Fuzzy Systems




Figure 2: Hierarchical fuzzy system

                                      8
Types of Fuzzy Systems




Figure 3: Fuzzy network

                          9
Formal Models for Fuzzy Networks

Node Modelling by If-then Rules

Rule 1: If x is low, then y is small
Rule 2: If x is average, then y is medium
Rule 3: If x is high, then y is big

Node Modelling by Integer Tables

Linguistic terms for x Linguistic terms for y
1 (low)                  1 (small)
2 (average)              2 (medium)
3 (high)                 3 (big)

                                                10
Formal Models for Fuzzy Networks

Node Modelling by Boolean Matrices

x/y         1 (small) 2 (medium) 3 (big)
1 (low)         1         0         0
2 (average)     0         1         0
3 (high)        0         0         1

Node Modelling by Binary Relations

{(1, 1), (2, 2), (3, 3)}




                                           11
Formal Models for Fuzzy Networks

Network Modelling by Grid Structures

           Layer 1

Level 1    N11(x, y)

Network Modelling by Interconnection Structures

           Layer 1

Level 1    y


                                                  12
Formal Models for Fuzzy Networks

Network Modelling by Block Schemes

x N11 y


Network Modelling by Topological Expressions

[N11] (x | y)




                                               13
Basic Operations in Fuzzy Networks

Horizontal Merging of Nodes

[N11] (x11 | z11,12) * [N12] (z11,12 | y12) = [N11*12] (x11 | y12)

* symbol for horizontal merging

Horizontal Splitting of Nodes

[N11/12] (x11 | y12) = [N11] (x11 | z11,12) / [N12] (z11,12 | y12)

/ symbol for horizontal splitting



                                                                     14
Basic Operations in Fuzzy Networks

Vertical Merging of Nodes

[N11] (x11 | y11) + [N21] (x21 | y21) = [N11+21] (x11, x21 | y11, y21)

+ symbol for vertical merging

Vertical Splitting of Nodes

[N11–21] (x11, x21 | y11, y21) = [N11] (x11 | y11) – [N21] (x21 | y21)

– symbol for vertical splitting



                                                                         15
Basic Operations in Fuzzy Networks

Output Merging of Nodes

[N11] (x11,21 | y11) ; [N21] (x11,21 | y21) = [N11;21] (x11,21 | y11, y21)

; symbol for output merging

Output Splitting of Nodes

[N11:21] (x11, 21 | y11, y21) = [N11] (x11,21 | y11) : [N21] (x11,21 | y21)

: symbol for output splitting



                                                                              16
Structural Properties of Basic Operations

Associativity of Horizontal Merging

[N11] (x11 | z11,12) * [N12] (z11,12 | z12,13) * [N13] (z12,13 | y13) =

[N11*12] (x11 | z12,13) * [N13] (z12,13 | y13) =

[N11] (x11 | z11,12) * [N12*13] (z11,12 | y13) =

[N11*12*13] (x11 | y13)




                                                                          17
Structural Properties of Basic Operations

Variability of Horizontal Splitting

[N11/12/13] (x11 | y13) =

[N11] (x11 | z11,12) / [N12/13] (z11,12 | y13) =

[N11/12] (x11 | z12,13) / [N13] (z12,13 | y13) =

[N11] (x11 | z11,12) / [N12] (z11,12 | z12,13) / [N13] (z12,13 | y13)




                                                                        18
Structural Properties of Basic Operations

Associativity of Vertical Merging

[N11] (x11 | y11) + [N21] (x21 | y21) + [N31] (x31 | y31) =

[N11+21] (x11, x21 | y11, y21) + [N31] (x31 | y31) =

[N11] (x11 | y11) + [N21+31] (x21, x31 | y21, y31) =

[N11+21+31] (x11, x21, x31 | y11, y21, y31)




                                                              19
Structural Properties of Basic Operations

Variability of Vertical Splitting

[N11–21–31] (x11, x21, x31 | y11, y21, y31) =

[N11] (x11 | y11) – [N21–31] (x21, x31 | y21, y31) =

[N11–21] (x11, x21 | y11, y21) – [N31] (x31 | y31) =

[N11] (x11 | y11) – [N21] (x21 | y21) – [N31] (x31 | y31)




                                                            20
Structural Properties of Basic Operations

Associativity of Output Merging

[N11] (x11,21,31 | y11) ; [N21] (x11,21,31 | y21) ; [N31] (x11,21,31 | y31) =

[N11;21] (x11,21,31 | y11, y21) ; [N31] (x11,21,31 | y31) =

[N11] (x11,21,31 | y11) ; [N21;31] (x11,21,31 | y21, y31) =

[N11;21;31] (x11,21,31 | y11, y21, y31)




                                                                                21
Structural Properties of Basic Operations

Variability of Output Splitting

[N11:21:31] (x11,21,31 | y11, y21, y31) =

[N11] (x11,21,31 | y11) : [N21:31] (x11,21,31 | y21, y31) =

[N11:21] (x11,21,31 | y11, y21) : [N31] (x11,21,31 | y31) =

[N11] (x11,21,31 | y11) : [N21] (x11,21,31 | y21) : [N31] (x11,21,31 | y31)




                                                                              22
Advanced Operations in Fuzzy Networks

Node Transformation in Input Augmentation

[N] (x | y) ⇒ [NAI] (x , xAI | y)

Node Transformation in Output Permutation
                      PO
[N] (x | y1, y2) ⇒ [N ] (x | y2, y1)

Node Transformation in Feedback Equivalence

[N] (x, z | y, z) ⇒ [NEF] (x, xEF | y, yEF)


                                              23
Advanced Operations in Fuzzy Networks

Node Identification in Horizontal Merging

A*U =C

A, C – known nodes, U – non-unique unknown node

U*B=C

B, C – known nodes, U – non-unique unknown node




                                                  24
Advanced Operations in Fuzzy Networks

A*U*B=C

A, B, C – known nodes, U – non-unique unknown node

A*U=D
D*B=C

D – non-unique unknown node

U*B=E
A*E=C

E – non-unique unknown node
                                                     25
Advanced Operations in Fuzzy Networks

Node Identification in Vertical Merging

A+U=C

A, C – known nodes, U – unique unknown node

U+B=C

B, C – known nodes, U – unique unknown node




                                              26
Advanced Operations in Fuzzy Networks

A+U+B=C

A, B, C – known nodes, U – unique unknown node

A+U=D
D+B=C

D – unique unknown node

U+B=E
A+E=C

E – unique unknown node
                                                 27
Advanced Operations in Fuzzy Networks

Node Identification in Output Merging

A;U =C

A, C – known nodes, U – unique unknown node

U;B=C

B, C – known nodes, U – unique unknown node




                                              28
Advanced Operations in Fuzzy Networks

A;U;B=C

A, B, C – known nodes, U – unique unknown node

A;U=D
D;B=C

D – unique unknown node

U;B=E
A;E=C

E – unique unknown node
                                                 29
Feedforward Fuzzy Networks

Network with Single Level and Single Layer
 • fuzzy system

1,1

[N11] (x11 | y11)




                                             30
Feedforward Fuzzy Networks

Network with Single Level and Multiple Layers
 • queue of ‘n’ fuzzy systems

1,1 … 1,n




                                                31
Feedforward Fuzzy Networks

Network with Multiple Levels and Single Layer
 • stack of ‘m’ fuzzy systems

1,1
…
m,1




                                                32
Feedforward Fuzzy Networks

Network with Multiple Levels and Multiple Layers
 • grid of ‘m by n’ fuzzy systems

1,1 … 1,n
… … …
m,1 … m,n




                                                   33
Feedback Fuzzy Networks

Network with Single Local Feedback
 • one node embraced by feedback

N(F) N     N N(F)
N    N     N N

N    N     N N
N(F) N     N N(F)
N(F) – node embraced by feedback
N – nodes with no feedback


                                     34
Feedback Fuzzy Networks

Network with Multiple Local Feedback
 • at least two nodes embraced by separate feedback

N(F1) N(F2)     N     N          N(F1) N
N     N         N(F1) N(F2)      N     N(F2)
N(F1) N         N      N(F1)     N     N(F1)
N(F2) N         N      N(F2)     N(F2) N

N(F1), N(F2) – nodes embraced by separate feedback
N – nodes with no feedback



                                                      35
Feedback Fuzzy Networks

Network with Single Global Feedback
 • one set of at least two adjacent nodes embraced by feedback

N1(F) N2(F)     N     N
N     N         N1(F) N2(F)

N1(F) N         N     N1(F)
N2(F) N         N     N2(F)

{N1(F), N2(F)} – set of nodes embraced by feedback
N – nodes with no feedback


                                                                 36
Feedback Fuzzy Networks

Network with Multiple Global Feedback
 • at least two sets of nodes embraced by separate feedback with
   at least two adjacent nodes in each set

N1(F1) N2(F1)       N1(F1) N1(F2)
N1(F2) N2(F2)       N2(F1) N2(F2)

{N1(F1), N2(F1)}, {N1(F2), N2(F2)} – sets of nodes embraced
by separate feedback




                                                               37
Evaluation of Fuzzy Networks

Linguistic Evaluation Metrics
 • composition of hierarchical into standard fuzzy systems
 • decomposition of standard into hierarchical fuzzy systems

Composition Formula
             x–1                   x–1
NE,x =   *p=1      (N1,p +   +q=p+1 Iq,p)

NE,x – equivalent node for a fuzzy network with x inputs




                                                               38
Evaluation of Fuzzy Networks

Decomposition Algorithm

1. Find N1,1 from the first two inputs and the output.
2. If x=2, go to end.
3. Set k=3.
4. While k≤x, do steps 5-7.
5. Find NE,k from the first k inputs and the output.
6. Derive N1,k–1 from the formula for NE,k, if possible.
7. Set k=k+1.
8. Endwhile.

NE,k – equivalent node for a fuzzy subnetwork with first k inputs

                                                                    39
Evaluation of Fuzzy Networks

Functional Evaluation Metrics
 • model performance indicators
 • applications to case studies

Feasibility Index (FI)
              n
FI =   sum i=1 (pi   / n)

n – number of non-identity nodes
p i – number of inputs to the i-th non-identity node
lower FI ⇒ better feasibility


                                                       40
Evaluation of Fuzzy Networks

Accuracy Index (AI)

AI = sum i=1nl sum j=1qil sum k=1vji (|yjik – djik| / vij)

nl – number of nodes in the last layer
qil – number of outputs from the i-th node in the last layer
vji – number of discrete values for the j-th output from the i-th
node in the last layer
yjik , djik – simulated and measured k-th discrete value for the j-th
output from the i-th node in the last layer
lower AI ⇒ better accuracy


                                                                    41
Evaluation of Fuzzy Networks

Efficiency Index (EI)

EI = sum i=1n (qiFID . riFID)

n – number of non-identity nodes
FID – fuzzification-inference-defuzzification
  FID
qi – number of outputs from the i-th non-identity node with an
associated FID sequence
riFID – number of rules for the i-th non-identity node with an
associated FID sequence
lower EI ⇒ better efficiency


                                                                 42
Evaluation of Fuzzy Networks

Transparency Index (TI)

TI = (p + q) / (n + m)

p – overall number of inputs
q – overall number of outputs
n – number of non-identity nodes
m – number of non-identity connections
lower TI ⇒ better transparency




                                         43
Evaluation of Fuzzy Networks

Case Study 1 (Ore Flotation)

Inputs:
x1 – copper concentration in ore pulp
x2 – iron concentration in ore pulp
x3 – debit of ore pulp

Output:
y – new copper concentration in ore pulp




                                           44
Evaluation of Fuzzy Networks




 Figure 4: Standard fuzzy system (SFS) for case study 1

                                                          45
Evaluation of Fuzzy Networks




 Figure 5: Hierarchical fuzzy system (HFS) for case study 1

                                                              46
Evaluation of Fuzzy Networks




 Figure 6: Fuzzy network (FN) for case study 1

                                                 47
Evaluation of Fuzzy Networks

 Table 1: Models performance for case study 1

 Index / Model Standard       Hierarchical   Fuzzy
               Fuzzy System   Fuzzy System   Network
 Feasibility   3              2              2
 Accuracy      4.35           4.76           4.60
 Efficiency    343            126            343
 Transparency 4               1.33           1.33

 FI – FN better than SFS and equal to HFS
 AI – FN worse than SFS and better than HFS
 EI – FN equal to SFS and worse than HFS
 TI – FN better than SFS and equal to HFS
                                                       48
Evaluation of Fuzzy Networks

Case Study 2 (Retail Pricing)

Inputs:
x1 – expected selling price for retail product
x2 – difference between selling price and cost for retail product
x3 – expected percentage to be sold from retail product

Output:
y – maximum cost for retail product




                                                                    49
Evaluation of Fuzzy Networks

             100

             90

             80

             70

             60
    output




             50

             40

             30

             20

             10

              0
                   0   20   40     60          80     100   120   140
                                 input permutations

 Figure 7: Standard fuzzy system (SFS) for case study 2

                                                                        50
Evaluation of Fuzzy Networks

             100



             80



             60
    output




             40



             20



              0
                   0   20   40     60           80    100   120   140
                                 input permutations

 Figure 8: Hierarchical fuzzy system (HFS) for case study 2

                                                                        51
Evaluation of Fuzzy Networks

             100



             80



             60
    output




             40



             20



              0
                   0   20   40     60          80     100   120   140
                                 input permutations

 Figure 9: Fuzzy network (FN) for case study 2

                                                                        52
Evaluation of Fuzzy Networks

 Table 2: Models performance for case study 2

 Index / Model Standard       Hierarchical   Fuzzy
               Fuzzy System   Fuzzy System   Network
 Feasibility   3              2              2
 Accuracy      2.86           5.57           3.64
 Efficiency    125            80             125
 Transparency 4               1.33           1.33

 FI – FN better than SFS and equal to HFS
 AI – FN worse than SFS and better than HFS
 EI – FN equal to SFS and worse than HFS
 TI – FN better than SFS and equal to HFS
                                                       53
Evaluation of Fuzzy Networks

Composition of Hierarchical into Standard Fuzzy System
 • full preservation of model feasibility
 • maximal improvement of model accuracy
 • fixed loss of model efficiency
 • full preservation of model transparency

Decomposition of Standard into Hierarchical Fuzzy System
 • no change of model feasibility
 • minimal loss of model accuracy
 • fixed improvement of model efficiency
 • no change of model transparency


                                                           54
Fuzzy Network Toolbox

Toolbox Details
 • developed by the PhD student Nedyalko Petrov
 • implemented in the Matlab environment
 • to be uploaded on the Mathworks web site
 • to be uploaded on the Springer web site

Toolbox Structure
 • Matlab files for basic operations on nodes
 • Matlab files for advanced operations on nodes
 • Matlab files for auxiliary operations
 • Word files with illustration examples


                                                   55
Conclusion

Theoretical Significance of Fuzzy Networks
 • novel application of discrete mathematics and control theory
 • detailed validation by test examples and case studies

Methodological Impact of Fuzzy Networks
 • extension of standard and hierarchical fuzzy systems
 • bridge between standard and hierarchical fuzzy systems
 • novel framework for non-fuzzy rule based systems

Application Areas of Fuzzy Networks
 • modelling and simulation in the mining industry
 • modelling and simulation in the retail industry

                                                                  56
Conclusion

Other Applications of Fuzzy Networks
 • finance (mortgage evaluation)
 • healthcare (radiotherapy margins)
 • robotics (path planning)
 • games (obstacle avoidance)
 • sports (boxer training)
 • security (terrorist threat)
 • environment (natural preservation)




                                        57
References

A.Gegov, Complexity Management in Fuzzy Systems,
Springer, Berlin, 2007

A.Gegov, Fuzzy Networks for Complex Systems,
Springer, Berlin, 2010




                                                   58

Más contenido relacionado

La actualidad más candente

Introduction to Neural Networks and Deep Learning
Introduction to Neural Networks and Deep LearningIntroduction to Neural Networks and Deep Learning
Introduction to Neural Networks and Deep LearningVahid Mirjalili
 
Rabbit challenge 3 DNN Day1
Rabbit challenge 3 DNN Day1Rabbit challenge 3 DNN Day1
Rabbit challenge 3 DNN Day1TOMMYLINK1
 
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...ieijjournal
 
Mm chap08 -_lossy_compression_algorithms
Mm chap08 -_lossy_compression_algorithmsMm chap08 -_lossy_compression_algorithms
Mm chap08 -_lossy_compression_algorithmsEellekwameowusu
 
Fourier basics
Fourier basicsFourier basics
Fourier basicsNGHIPHAM14
 
Performance evaluation of ds cdma
Performance evaluation of ds cdmaPerformance evaluation of ds cdma
Performance evaluation of ds cdmacaijjournal
 
Kernels and Support Vector Machines
Kernels and Support Vector  MachinesKernels and Support Vector  Machines
Kernels and Support Vector MachinesEdgar Marca
 
image-deblurring
image-deblurringimage-deblurring
image-deblurringErik Mayer
 
Fixed-Point Code Synthesis for Neural Networks
Fixed-Point Code Synthesis for Neural NetworksFixed-Point Code Synthesis for Neural Networks
Fixed-Point Code Synthesis for Neural Networksgerogepatton
 
Ee2 chapter1 number_system
Ee2 chapter1 number_systemEe2 chapter1 number_system
Ee2 chapter1 number_systemCK Yang
 
Detailed Description on Cross Entropy Loss Function
Detailed Description on Cross Entropy Loss FunctionDetailed Description on Cross Entropy Loss Function
Detailed Description on Cross Entropy Loss Function범준 김
 
CYCLIC RESOLVING NUMBER OF GRID AND AUGMENTED GRID GRAPHS
CYCLIC RESOLVING NUMBER OF GRID AND AUGMENTED GRID GRAPHSCYCLIC RESOLVING NUMBER OF GRID AND AUGMENTED GRID GRAPHS
CYCLIC RESOLVING NUMBER OF GRID AND AUGMENTED GRID GRAPHSijcoa
 
Efficient Technique for Image Stenography Based on coordinates of pixels
Efficient Technique for Image Stenography Based on coordinates of pixelsEfficient Technique for Image Stenography Based on coordinates of pixels
Efficient Technique for Image Stenography Based on coordinates of pixelsIOSR Journals
 
High Speed Memory Efficient Multiplier-less 1-D 9/7 Wavelet Filters Based NED...
High Speed Memory Efficient Multiplier-less 1-D 9/7 Wavelet Filters Based NED...High Speed Memory Efficient Multiplier-less 1-D 9/7 Wavelet Filters Based NED...
High Speed Memory Efficient Multiplier-less 1-D 9/7 Wavelet Filters Based NED...IJERA Editor
 

La actualidad más candente (18)

Introduction to Neural Networks and Deep Learning
Introduction to Neural Networks and Deep LearningIntroduction to Neural Networks and Deep Learning
Introduction to Neural Networks and Deep Learning
 
Rabbit challenge 3 DNN Day1
Rabbit challenge 3 DNN Day1Rabbit challenge 3 DNN Day1
Rabbit challenge 3 DNN Day1
 
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
 
Mm chap08 -_lossy_compression_algorithms
Mm chap08 -_lossy_compression_algorithmsMm chap08 -_lossy_compression_algorithms
Mm chap08 -_lossy_compression_algorithms
 
Fourier basics
Fourier basicsFourier basics
Fourier basics
 
Performance evaluation of ds cdma
Performance evaluation of ds cdmaPerformance evaluation of ds cdma
Performance evaluation of ds cdma
 
Kernels and Support Vector Machines
Kernels and Support Vector  MachinesKernels and Support Vector  Machines
Kernels and Support Vector Machines
 
image-deblurring
image-deblurringimage-deblurring
image-deblurring
 
Fixed-Point Code Synthesis for Neural Networks
Fixed-Point Code Synthesis for Neural NetworksFixed-Point Code Synthesis for Neural Networks
Fixed-Point Code Synthesis for Neural Networks
 
Ee2 chapter1 number_system
Ee2 chapter1 number_systemEe2 chapter1 number_system
Ee2 chapter1 number_system
 
Detailed Description on Cross Entropy Loss Function
Detailed Description on Cross Entropy Loss FunctionDetailed Description on Cross Entropy Loss Function
Detailed Description on Cross Entropy Loss Function
 
CYCLIC RESOLVING NUMBER OF GRID AND AUGMENTED GRID GRAPHS
CYCLIC RESOLVING NUMBER OF GRID AND AUGMENTED GRID GRAPHSCYCLIC RESOLVING NUMBER OF GRID AND AUGMENTED GRID GRAPHS
CYCLIC RESOLVING NUMBER OF GRID AND AUGMENTED GRID GRAPHS
 
Solution homework2
Solution homework2Solution homework2
Solution homework2
 
Branch&bound at
Branch&bound atBranch&bound at
Branch&bound at
 
Efficient Technique for Image Stenography Based on coordinates of pixels
Efficient Technique for Image Stenography Based on coordinates of pixelsEfficient Technique for Image Stenography Based on coordinates of pixels
Efficient Technique for Image Stenography Based on coordinates of pixels
 
High Speed Memory Efficient Multiplier-less 1-D 9/7 Wavelet Filters Based NED...
High Speed Memory Efficient Multiplier-less 1-D 9/7 Wavelet Filters Based NED...High Speed Memory Efficient Multiplier-less 1-D 9/7 Wavelet Filters Based NED...
High Speed Memory Efficient Multiplier-less 1-D 9/7 Wavelet Filters Based NED...
 
support vector machine
support vector machinesupport vector machine
support vector machine
 
Rough K Means - Numerical Example
Rough K Means - Numerical ExampleRough K Means - Numerical Example
Rough K Means - Numerical Example
 

Similar a Aleksander gegov

Computer Architecture 3rd Edition by Moris Mano CH 01-CH 02.ppt
Computer Architecture 3rd Edition by Moris Mano CH  01-CH 02.pptComputer Architecture 3rd Edition by Moris Mano CH  01-CH 02.ppt
Computer Architecture 3rd Edition by Moris Mano CH 01-CH 02.pptHowida Youssry
 
Introduction to Neural networks (under graduate course) Lecture 6 of 9
Introduction to Neural networks (under graduate course) Lecture 6 of 9Introduction to Neural networks (under graduate course) Lecture 6 of 9
Introduction to Neural networks (under graduate course) Lecture 6 of 9Randa Elanwar
 
Logic gates and boolean algebra.ppt
Logic gates and boolean algebra.pptLogic gates and boolean algebra.ppt
Logic gates and boolean algebra.pptbcanawakadalcollege
 
digital logic circuits, logic gates, boolean algebra
digital logic circuits, logic gates, boolean algebradigital logic circuits, logic gates, boolean algebra
digital logic circuits, logic gates, boolean algebradianaandino4
 
Ch1-2, Digital Logic Circuit and Digital Components.ppt
Ch1-2, Digital Logic Circuit and Digital Components.pptCh1-2, Digital Logic Circuit and Digital Components.ppt
Ch1-2, Digital Logic Circuit and Digital Components.pptJamesRodriguez109117
 
FPL15 talk: Deep Convolutional Neural Network on FPGA
FPL15 talk: Deep Convolutional Neural Network on FPGAFPL15 talk: Deep Convolutional Neural Network on FPGA
FPL15 talk: Deep Convolutional Neural Network on FPGAHiroki Nakahara
 
Hardware Acceleration for Machine Learning
Hardware Acceleration for Machine LearningHardware Acceleration for Machine Learning
Hardware Acceleration for Machine LearningCastLabKAIST
 
Spectral cnn
Spectral cnnSpectral cnn
Spectral cnnBrian Kim
 
Adaptive neural network controller Presentation
Adaptive neural network controller PresentationAdaptive neural network controller Presentation
Adaptive neural network controller PresentationNguyen Cong Dan
 
Introduction to Neural Netwoks
Introduction to Neural Netwoks Introduction to Neural Netwoks
Introduction to Neural Netwoks Abdallah Bashir
 

Similar a Aleksander gegov (20)

Computer Architecture 3rd Edition by Moris Mano CH 01-CH 02.ppt
Computer Architecture 3rd Edition by Moris Mano CH  01-CH 02.pptComputer Architecture 3rd Edition by Moris Mano CH  01-CH 02.ppt
Computer Architecture 3rd Edition by Moris Mano CH 01-CH 02.ppt
 
Introduction to Neural networks (under graduate course) Lecture 6 of 9
Introduction to Neural networks (under graduate course) Lecture 6 of 9Introduction to Neural networks (under graduate course) Lecture 6 of 9
Introduction to Neural networks (under graduate course) Lecture 6 of 9
 
Logic gates
Logic gatesLogic gates
Logic gates
 
Digital logic circuit
Digital logic circuitDigital logic circuit
Digital logic circuit
 
CH1_2.ppt
CH1_2.pptCH1_2.ppt
CH1_2.ppt
 
Ch1 2
Ch1 2Ch1 2
Ch1 2
 
Logic gates and boolean algebra.ppt
Logic gates and boolean algebra.pptLogic gates and boolean algebra.ppt
Logic gates and boolean algebra.ppt
 
digital logic circuits, logic gates, boolean algebra
digital logic circuits, logic gates, boolean algebradigital logic circuits, logic gates, boolean algebra
digital logic circuits, logic gates, boolean algebra
 
CH1_2.ppt
CH1_2.pptCH1_2.ppt
CH1_2.ppt
 
Ch1-2, Digital Logic Circuit and Digital Components.ppt
Ch1-2, Digital Logic Circuit and Digital Components.pptCh1-2, Digital Logic Circuit and Digital Components.ppt
Ch1-2, Digital Logic Circuit and Digital Components.ppt
 
Ch1 2 (2)
Ch1 2 (2)Ch1 2 (2)
Ch1 2 (2)
 
FPL15 talk: Deep Convolutional Neural Network on FPGA
FPL15 talk: Deep Convolutional Neural Network on FPGAFPL15 talk: Deep Convolutional Neural Network on FPGA
FPL15 talk: Deep Convolutional Neural Network on FPGA
 
Neural network
Neural networkNeural network
Neural network
 
ann-ics320Part4.ppt
ann-ics320Part4.pptann-ics320Part4.ppt
ann-ics320Part4.ppt
 
ann-ics320Part4.ppt
ann-ics320Part4.pptann-ics320Part4.ppt
ann-ics320Part4.ppt
 
Hardware Acceleration for Machine Learning
Hardware Acceleration for Machine LearningHardware Acceleration for Machine Learning
Hardware Acceleration for Machine Learning
 
Spectral cnn
Spectral cnnSpectral cnn
Spectral cnn
 
Adaptive neural network controller Presentation
Adaptive neural network controller PresentationAdaptive neural network controller Presentation
Adaptive neural network controller Presentation
 
Introduction to Neural Netwoks
Introduction to Neural Netwoks Introduction to Neural Netwoks
Introduction to Neural Netwoks
 
06075626 (1)
06075626 (1)06075626 (1)
06075626 (1)
 

Más de Institude Technology Bandung (8)

04 fuzzy ruledecompositions
04 fuzzy ruledecompositions04 fuzzy ruledecompositions
04 fuzzy ruledecompositions
 
Steven chris zhou
Steven chris zhouSteven chris zhou
Steven chris zhou
 
Logika fuzzy
Logika fuzzyLogika fuzzy
Logika fuzzy
 
Modul algoritma dan pemograman
Modul algoritma dan pemogramanModul algoritma dan pemograman
Modul algoritma dan pemograman
 
Kc slide-02
Kc slide-02Kc slide-02
Kc slide-02
 
04.08121302
04.0812130204.08121302
04.08121302
 
Skep 40-iii-2010 ac incident accident report
Skep 40-iii-2010 ac incident  accident reportSkep 40-iii-2010 ac incident  accident report
Skep 40-iii-2010 ac incident accident report
 
Its master-16003-presentation-1224025
Its master-16003-presentation-1224025Its master-16003-presentation-1224025
Its master-16003-presentation-1224025
 

Aleksander gegov

  • 1. Fuzzy Rule Based Networks Alexander Gegov University of Portsmouth, UK alexander.gegov@port.ac.uk
  • 2. Presentation Outline Part 1 - Theory: Introduction Types of Fuzzy Systems Formal Models for Fuzzy Networks Basic Operations in Fuzzy Networks Structural Properties of Basic Operations Advanced Operations in Fuzzy Networks Part 2 - Applications: Feedforward Fuzzy Networks Feedback Fuzzy Networks Evaluation of Fuzzy Networks Fuzzy Network Toolbox Conclusion References 2
  • 3. Introduction Modelling Aspects of Systemic Complexity • non-linearity (input-output functional relationships) • uncertainty (incomplete and imprecise data) • dimensionality (large number of inputs and outputs) • structure (interacting subsystems) Complexity Management by Fuzzy Systems • model feasibility (achievable in the case of non-linearity) • model accuracy (achievable in the case of uncertainty) • model efficiency (problematic in the case of dimensionality) • model transparency (problematic in the case of structure) 3
  • 4. Types of Fuzzy Systems Fuzzification • triangular membership functions • trapezoidal membership functions Inference • truncation of rule membership functions by firing strengths • scaling of rule membership functions by firing strengths Defuzzification • centre of area of rule base membership function • weighted average of rule base membership function 4
  • 5. Types of Fuzzy Systems Logical Connections • disjunctive antecedents and conjunctive rules • conjunctive antecedents and conjunctive rules • disjunctive antecedents and disjunctive rules • conjunctive antecedents and disjunctive rules Inputs and Outputs • single-input-single-output • single-input-multiple-output • multiple-input-single-output • multiple-input-multiple-output 5
  • 6. Types of Fuzzy Systems Operation Mode • Mamdani (conventional fuzzy system) • Sugeno (modern fuzzy system) • Tsukamoto (hybrid fuzzy system) Rule Base • single rule base (standard fuzzy system) • multiple rule bases (hierarchical fuzzy system) • networked rule bases (fuzzy network) 6
  • 7. Types of Fuzzy Systems Figure 1: Standard fuzzy system 7
  • 8. Types of Fuzzy Systems Figure 2: Hierarchical fuzzy system 8
  • 9. Types of Fuzzy Systems Figure 3: Fuzzy network 9
  • 10. Formal Models for Fuzzy Networks Node Modelling by If-then Rules Rule 1: If x is low, then y is small Rule 2: If x is average, then y is medium Rule 3: If x is high, then y is big Node Modelling by Integer Tables Linguistic terms for x Linguistic terms for y 1 (low) 1 (small) 2 (average) 2 (medium) 3 (high) 3 (big) 10
  • 11. Formal Models for Fuzzy Networks Node Modelling by Boolean Matrices x/y 1 (small) 2 (medium) 3 (big) 1 (low) 1 0 0 2 (average) 0 1 0 3 (high) 0 0 1 Node Modelling by Binary Relations {(1, 1), (2, 2), (3, 3)} 11
  • 12. Formal Models for Fuzzy Networks Network Modelling by Grid Structures Layer 1 Level 1 N11(x, y) Network Modelling by Interconnection Structures Layer 1 Level 1 y 12
  • 13. Formal Models for Fuzzy Networks Network Modelling by Block Schemes x N11 y Network Modelling by Topological Expressions [N11] (x | y) 13
  • 14. Basic Operations in Fuzzy Networks Horizontal Merging of Nodes [N11] (x11 | z11,12) * [N12] (z11,12 | y12) = [N11*12] (x11 | y12) * symbol for horizontal merging Horizontal Splitting of Nodes [N11/12] (x11 | y12) = [N11] (x11 | z11,12) / [N12] (z11,12 | y12) / symbol for horizontal splitting 14
  • 15. Basic Operations in Fuzzy Networks Vertical Merging of Nodes [N11] (x11 | y11) + [N21] (x21 | y21) = [N11+21] (x11, x21 | y11, y21) + symbol for vertical merging Vertical Splitting of Nodes [N11–21] (x11, x21 | y11, y21) = [N11] (x11 | y11) – [N21] (x21 | y21) – symbol for vertical splitting 15
  • 16. Basic Operations in Fuzzy Networks Output Merging of Nodes [N11] (x11,21 | y11) ; [N21] (x11,21 | y21) = [N11;21] (x11,21 | y11, y21) ; symbol for output merging Output Splitting of Nodes [N11:21] (x11, 21 | y11, y21) = [N11] (x11,21 | y11) : [N21] (x11,21 | y21) : symbol for output splitting 16
  • 17. Structural Properties of Basic Operations Associativity of Horizontal Merging [N11] (x11 | z11,12) * [N12] (z11,12 | z12,13) * [N13] (z12,13 | y13) = [N11*12] (x11 | z12,13) * [N13] (z12,13 | y13) = [N11] (x11 | z11,12) * [N12*13] (z11,12 | y13) = [N11*12*13] (x11 | y13) 17
  • 18. Structural Properties of Basic Operations Variability of Horizontal Splitting [N11/12/13] (x11 | y13) = [N11] (x11 | z11,12) / [N12/13] (z11,12 | y13) = [N11/12] (x11 | z12,13) / [N13] (z12,13 | y13) = [N11] (x11 | z11,12) / [N12] (z11,12 | z12,13) / [N13] (z12,13 | y13) 18
  • 19. Structural Properties of Basic Operations Associativity of Vertical Merging [N11] (x11 | y11) + [N21] (x21 | y21) + [N31] (x31 | y31) = [N11+21] (x11, x21 | y11, y21) + [N31] (x31 | y31) = [N11] (x11 | y11) + [N21+31] (x21, x31 | y21, y31) = [N11+21+31] (x11, x21, x31 | y11, y21, y31) 19
  • 20. Structural Properties of Basic Operations Variability of Vertical Splitting [N11–21–31] (x11, x21, x31 | y11, y21, y31) = [N11] (x11 | y11) – [N21–31] (x21, x31 | y21, y31) = [N11–21] (x11, x21 | y11, y21) – [N31] (x31 | y31) = [N11] (x11 | y11) – [N21] (x21 | y21) – [N31] (x31 | y31) 20
  • 21. Structural Properties of Basic Operations Associativity of Output Merging [N11] (x11,21,31 | y11) ; [N21] (x11,21,31 | y21) ; [N31] (x11,21,31 | y31) = [N11;21] (x11,21,31 | y11, y21) ; [N31] (x11,21,31 | y31) = [N11] (x11,21,31 | y11) ; [N21;31] (x11,21,31 | y21, y31) = [N11;21;31] (x11,21,31 | y11, y21, y31) 21
  • 22. Structural Properties of Basic Operations Variability of Output Splitting [N11:21:31] (x11,21,31 | y11, y21, y31) = [N11] (x11,21,31 | y11) : [N21:31] (x11,21,31 | y21, y31) = [N11:21] (x11,21,31 | y11, y21) : [N31] (x11,21,31 | y31) = [N11] (x11,21,31 | y11) : [N21] (x11,21,31 | y21) : [N31] (x11,21,31 | y31) 22
  • 23. Advanced Operations in Fuzzy Networks Node Transformation in Input Augmentation [N] (x | y) ⇒ [NAI] (x , xAI | y) Node Transformation in Output Permutation PO [N] (x | y1, y2) ⇒ [N ] (x | y2, y1) Node Transformation in Feedback Equivalence [N] (x, z | y, z) ⇒ [NEF] (x, xEF | y, yEF) 23
  • 24. Advanced Operations in Fuzzy Networks Node Identification in Horizontal Merging A*U =C A, C – known nodes, U – non-unique unknown node U*B=C B, C – known nodes, U – non-unique unknown node 24
  • 25. Advanced Operations in Fuzzy Networks A*U*B=C A, B, C – known nodes, U – non-unique unknown node A*U=D D*B=C D – non-unique unknown node U*B=E A*E=C E – non-unique unknown node 25
  • 26. Advanced Operations in Fuzzy Networks Node Identification in Vertical Merging A+U=C A, C – known nodes, U – unique unknown node U+B=C B, C – known nodes, U – unique unknown node 26
  • 27. Advanced Operations in Fuzzy Networks A+U+B=C A, B, C – known nodes, U – unique unknown node A+U=D D+B=C D – unique unknown node U+B=E A+E=C E – unique unknown node 27
  • 28. Advanced Operations in Fuzzy Networks Node Identification in Output Merging A;U =C A, C – known nodes, U – unique unknown node U;B=C B, C – known nodes, U – unique unknown node 28
  • 29. Advanced Operations in Fuzzy Networks A;U;B=C A, B, C – known nodes, U – unique unknown node A;U=D D;B=C D – unique unknown node U;B=E A;E=C E – unique unknown node 29
  • 30. Feedforward Fuzzy Networks Network with Single Level and Single Layer • fuzzy system 1,1 [N11] (x11 | y11) 30
  • 31. Feedforward Fuzzy Networks Network with Single Level and Multiple Layers • queue of ‘n’ fuzzy systems 1,1 … 1,n 31
  • 32. Feedforward Fuzzy Networks Network with Multiple Levels and Single Layer • stack of ‘m’ fuzzy systems 1,1 … m,1 32
  • 33. Feedforward Fuzzy Networks Network with Multiple Levels and Multiple Layers • grid of ‘m by n’ fuzzy systems 1,1 … 1,n … … … m,1 … m,n 33
  • 34. Feedback Fuzzy Networks Network with Single Local Feedback • one node embraced by feedback N(F) N N N(F) N N N N N N N N N(F) N N N(F) N(F) – node embraced by feedback N – nodes with no feedback 34
  • 35. Feedback Fuzzy Networks Network with Multiple Local Feedback • at least two nodes embraced by separate feedback N(F1) N(F2) N N N(F1) N N N N(F1) N(F2) N N(F2) N(F1) N N N(F1) N N(F1) N(F2) N N N(F2) N(F2) N N(F1), N(F2) – nodes embraced by separate feedback N – nodes with no feedback 35
  • 36. Feedback Fuzzy Networks Network with Single Global Feedback • one set of at least two adjacent nodes embraced by feedback N1(F) N2(F) N N N N N1(F) N2(F) N1(F) N N N1(F) N2(F) N N N2(F) {N1(F), N2(F)} – set of nodes embraced by feedback N – nodes with no feedback 36
  • 37. Feedback Fuzzy Networks Network with Multiple Global Feedback • at least two sets of nodes embraced by separate feedback with at least two adjacent nodes in each set N1(F1) N2(F1) N1(F1) N1(F2) N1(F2) N2(F2) N2(F1) N2(F2) {N1(F1), N2(F1)}, {N1(F2), N2(F2)} – sets of nodes embraced by separate feedback 37
  • 38. Evaluation of Fuzzy Networks Linguistic Evaluation Metrics • composition of hierarchical into standard fuzzy systems • decomposition of standard into hierarchical fuzzy systems Composition Formula x–1 x–1 NE,x = *p=1 (N1,p + +q=p+1 Iq,p) NE,x – equivalent node for a fuzzy network with x inputs 38
  • 39. Evaluation of Fuzzy Networks Decomposition Algorithm 1. Find N1,1 from the first two inputs and the output. 2. If x=2, go to end. 3. Set k=3. 4. While k≤x, do steps 5-7. 5. Find NE,k from the first k inputs and the output. 6. Derive N1,k–1 from the formula for NE,k, if possible. 7. Set k=k+1. 8. Endwhile. NE,k – equivalent node for a fuzzy subnetwork with first k inputs 39
  • 40. Evaluation of Fuzzy Networks Functional Evaluation Metrics • model performance indicators • applications to case studies Feasibility Index (FI) n FI = sum i=1 (pi / n) n – number of non-identity nodes p i – number of inputs to the i-th non-identity node lower FI ⇒ better feasibility 40
  • 41. Evaluation of Fuzzy Networks Accuracy Index (AI) AI = sum i=1nl sum j=1qil sum k=1vji (|yjik – djik| / vij) nl – number of nodes in the last layer qil – number of outputs from the i-th node in the last layer vji – number of discrete values for the j-th output from the i-th node in the last layer yjik , djik – simulated and measured k-th discrete value for the j-th output from the i-th node in the last layer lower AI ⇒ better accuracy 41
  • 42. Evaluation of Fuzzy Networks Efficiency Index (EI) EI = sum i=1n (qiFID . riFID) n – number of non-identity nodes FID – fuzzification-inference-defuzzification FID qi – number of outputs from the i-th non-identity node with an associated FID sequence riFID – number of rules for the i-th non-identity node with an associated FID sequence lower EI ⇒ better efficiency 42
  • 43. Evaluation of Fuzzy Networks Transparency Index (TI) TI = (p + q) / (n + m) p – overall number of inputs q – overall number of outputs n – number of non-identity nodes m – number of non-identity connections lower TI ⇒ better transparency 43
  • 44. Evaluation of Fuzzy Networks Case Study 1 (Ore Flotation) Inputs: x1 – copper concentration in ore pulp x2 – iron concentration in ore pulp x3 – debit of ore pulp Output: y – new copper concentration in ore pulp 44
  • 45. Evaluation of Fuzzy Networks Figure 4: Standard fuzzy system (SFS) for case study 1 45
  • 46. Evaluation of Fuzzy Networks Figure 5: Hierarchical fuzzy system (HFS) for case study 1 46
  • 47. Evaluation of Fuzzy Networks Figure 6: Fuzzy network (FN) for case study 1 47
  • 48. Evaluation of Fuzzy Networks Table 1: Models performance for case study 1 Index / Model Standard Hierarchical Fuzzy Fuzzy System Fuzzy System Network Feasibility 3 2 2 Accuracy 4.35 4.76 4.60 Efficiency 343 126 343 Transparency 4 1.33 1.33 FI – FN better than SFS and equal to HFS AI – FN worse than SFS and better than HFS EI – FN equal to SFS and worse than HFS TI – FN better than SFS and equal to HFS 48
  • 49. Evaluation of Fuzzy Networks Case Study 2 (Retail Pricing) Inputs: x1 – expected selling price for retail product x2 – difference between selling price and cost for retail product x3 – expected percentage to be sold from retail product Output: y – maximum cost for retail product 49
  • 50. Evaluation of Fuzzy Networks 100 90 80 70 60 output 50 40 30 20 10 0 0 20 40 60 80 100 120 140 input permutations Figure 7: Standard fuzzy system (SFS) for case study 2 50
  • 51. Evaluation of Fuzzy Networks 100 80 60 output 40 20 0 0 20 40 60 80 100 120 140 input permutations Figure 8: Hierarchical fuzzy system (HFS) for case study 2 51
  • 52. Evaluation of Fuzzy Networks 100 80 60 output 40 20 0 0 20 40 60 80 100 120 140 input permutations Figure 9: Fuzzy network (FN) for case study 2 52
  • 53. Evaluation of Fuzzy Networks Table 2: Models performance for case study 2 Index / Model Standard Hierarchical Fuzzy Fuzzy System Fuzzy System Network Feasibility 3 2 2 Accuracy 2.86 5.57 3.64 Efficiency 125 80 125 Transparency 4 1.33 1.33 FI – FN better than SFS and equal to HFS AI – FN worse than SFS and better than HFS EI – FN equal to SFS and worse than HFS TI – FN better than SFS and equal to HFS 53
  • 54. Evaluation of Fuzzy Networks Composition of Hierarchical into Standard Fuzzy System • full preservation of model feasibility • maximal improvement of model accuracy • fixed loss of model efficiency • full preservation of model transparency Decomposition of Standard into Hierarchical Fuzzy System • no change of model feasibility • minimal loss of model accuracy • fixed improvement of model efficiency • no change of model transparency 54
  • 55. Fuzzy Network Toolbox Toolbox Details • developed by the PhD student Nedyalko Petrov • implemented in the Matlab environment • to be uploaded on the Mathworks web site • to be uploaded on the Springer web site Toolbox Structure • Matlab files for basic operations on nodes • Matlab files for advanced operations on nodes • Matlab files for auxiliary operations • Word files with illustration examples 55
  • 56. Conclusion Theoretical Significance of Fuzzy Networks • novel application of discrete mathematics and control theory • detailed validation by test examples and case studies Methodological Impact of Fuzzy Networks • extension of standard and hierarchical fuzzy systems • bridge between standard and hierarchical fuzzy systems • novel framework for non-fuzzy rule based systems Application Areas of Fuzzy Networks • modelling and simulation in the mining industry • modelling and simulation in the retail industry 56
  • 57. Conclusion Other Applications of Fuzzy Networks • finance (mortgage evaluation) • healthcare (radiotherapy margins) • robotics (path planning) • games (obstacle avoidance) • sports (boxer training) • security (terrorist threat) • environment (natural preservation) 57
  • 58. References A.Gegov, Complexity Management in Fuzzy Systems, Springer, Berlin, 2007 A.Gegov, Fuzzy Networks for Complex Systems, Springer, Berlin, 2010 58