1. Fuzzy rule-based system derived from similarity to prototypes Włodzisław Duch Department of Informatics, Nicolaus Copernicus University, Poland School of Computer Engineering, Nanyang Technological University, Singapore Marcin Blachnik Division of Computer Methods, Department of Elektrotehnology, The Silesian University of Technology, Poland

2. Plan 1. What is it all about? 2. Fuzzy rule systems and prototype rule based systems. 3. From prototype rules to fuzzy rules and vice versa, with examples. 4. Results of applications on real datasets. 5. Conclusions.

3. Motivation Understanding data, situations, recognizing objects or making diagnosis people frequently use similarity to known cases, and rarely use logical reasoning, but soft computing experts use logic instead of similarity... Relations between similarity and logic are not clear. Q 1 : How to obtain the same decision borders in Fuzzy Logic systems and Prototype Rule Based systems? Q 2 : What type of similarity measure corresponds to a typical fuzzy functions and vice versa? Q 3 : How to transform one type of a system into another type preserving their decision borders? Q 4 : Are there any advantages of such transformations? Q 5 : Can we understand data better using prototypes instead of logical rules?

4. Fuzzy Rule Based System Learning process includes: –for each feature, select shapes of membership functions and the number of these functions; –optimize parameters of the membership functions (such as positions and spreads) using training data; –aggregate input information and calculate final rule activations for each category; –assign membership degrees to output classes; –write the set of F-rules and interpret them.

5. Prototype Rule Based System Learning process involves: specify the number and positions of prototypes; select similarity or dissimilarity (distance) functions (we use distance functions); calculate distance (similarity) to each prototype; assign P-rule to the output class as a rule; choices are: If P=argmin p’ (D(X,P’)) Then Class(X)=Class(P) This is a nearest prototype rule, similar to the fuzzy logic rule: If R=max k MembF k (X) Then Class(X)<=Class(R) Another form of P-rules is based on similarity threshold: If D(X,P)≤d p Then C Taking D  (X,P) distance crisp logic rules are obtained

6. Advantages of prototype based rules Inspired by cognitive psychology: it may be easier to understand prototypes and similarity than fuzzy rules P-rules may be defined for nominal features using probabilistic distance measures (such as VDM), while F-rules require numerical inputs. Many algorithms for prototype selection and optimization exist but they have not been applied to understand data and their relation to fuzzy rules have not been explored; Applications of P-rules to real datasets give excellent results generating small number of prototypes.

7. Value Difference Matrix (VDM) VDM – probability difference measure for 1 attribute for many attributes VDM measure can be also applied for continuous features, in the simplest way using discretization and interpolation, or other probability estimation techniques (Gaussian smoothing, Parzen windows, etc).

8. P-rules  F-rules Condition: preserve classification borders Q: how are membership functions and distance functions related? Can one obtain new, interesting membership functions from known distance functions and vice versa? For all additive distance functions exp transformation changes distances D of P-rules into products of MF of F-rules: MF=exp(-D) Example: Euclidean distance is equivalent to Gaussian MFs Algebraic (product) T-norm is obtained with Gaussian MFs

9. Visualization Decision border MF for attrib 1 MF for attrib 2 Euclidean distance function Square of Canberra distance function

10. VDM distance => membership functions Decision border MF for attrib 1 MF for attrib 2 DVDM distance function IVDM distance function

11. Inverse transformation For all product T-norm D =  ln(F) Advantages: New type of distance functions are generated. Example: distances generated from triangular functions.

12. Applications to real data 1. Gene expression data for 2 types of leukaemia (Golub et al, Science 286 (1999) 531-537 Description: 2 classes, 1100 features, 3 most relevant selected. Used methods: 1 prototype/class LVQ, DVDM similarity measure. Results (number of misclassified vectors): 2. Searching for Promoters in DNA strings Description: 2 classes, 57 features, all symbolic features. Used methods: 9 prototypes for promoters, 12 for nonpromoters, generated using C-means + LVQ, with VDM similarity measure. Results: 5 misclassified vectors in leave one out test. Data Set Golub et al P-rules Train30 Test53

13. Conclusions First step in understanding relations between fuzzy and similarity-based systems was made. Prototype rules can be expressed using fuzzy rules and vice versa. New possibilities in both fields: –new type of membership functions; –new type of distance functions; VDM measure used in P-rules leads to a natural shape of membership functions in fuzzy logic for symbolic data. Expert knowledge can be captured in both types of rules, but sometimes it is easier to express as P-rules and sometimes as F-rules. Many open problems remain.

14. Thank You for lending your ears... Speaker: Marcin Blachnik