1 / 25

Soft Computing For Controle

Evolving Fuzzy Rules with Genetic Programming and Clustering. Soft Computing For Controle. G-REX (Previous work). The transformation of an highly accurate opaque model to a comprehensible model . Genetic programming Black box Arbitary representation and fitness function

gizela
Download Presentation

Soft Computing For Controle

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Evolving Fuzzy Rules with Genetic Programming and Clustering Soft Computing For Controle

  2. G-REX (Previous work) • The transformation of an highly accurate opaque model to a comprehensible model. • Genetic programming • Black box • Arbitary representation and fitness function • Balances Accuracy and Comprehensibility IF Age > 25 IF Salary > 5000 Reject Accept Reject

  3. GP - Crossover

  4. Background • Evolving Fuzzy Decision Trees With Genetic Programming and Clustering • J. Eggermont, (2001) • Automatic fuzzyfication using K-Means • Genetic Programming • Fuzzy Representation

  5. Membership functions • Three types of membership function • Distances does not need to be equal • Based on medioids/centroids

  6. Membership functions

  7. K-means • Most frequently used clustering method • Fast, deterministic and easy to implement. • J.B MacWueen (1967) • K- stand for the number of clusters • Each cluster is represented by one membership function • A cluster is represented by a centroid. • The mean value of the members • An instance belongs to the closest centroid

  8. 1 • Euclidian distance

  9. 2 • The new centroid is the mean of its members

  10. 3 • Recalculate members • Repeat until no change

  11. Kaufmans Initialization • K-Means is sensitive to the initialization method • Pêna J.M. Lozano J. A. and Larranga P. (1999) • An Empirical Investigation of Four Initialization Methods for the K-Means Algorithm Step 1. The instance closest to the mean value Step 2-3 Choose a instance far away from the other medioids with many instance close by.

  12. Membership functions • Three types of membership function • Distance does not need to be equal • Based on medioids

  13. GP Representation • All variables with less than k unique values are treated as crisp sets.

  14. Representation

  15. Calculating membership values

  16. Fitness function Not precise enough Reward is equal to the membership Value for the correctly predicted instance 1- the MSE of each membership function

  17. Experiments • 5 classification datasets • Only continuous variables • IRIS, WINE • Categorical and continuous • COLIC, CLEAVLAND, PIMA • 10-fold cross validation • Stratification • Fuzzy GP vs standard GP (if rules) • Evaluated against • Accuracy (ACC) • Area under ROC-curve (AUC) • Brier Score (BRI)

  18. Results

  19. Iris

  20. Wine

  21. Horse Colic

  22. PIMA Diabetes

  23. Cleveland (Heart disease)

  24. Disscussion • Current membership function removes information from the variable • A way to handle outliers • Some extremely simply if rules are better for some dataset. • Categorical variables • Should not be used as only method • Easy to remember rules but how accurate will they be as a decision support? • Gives a comprehensible explanation that could ad trust and there by improve predictions.

  25. Future work • Alternative membership function • Fuzzy regression ?

More Related