Abstract

This paper proposes a genetic-based algorithm for generating simple and well-defined Takagi-Sugeno-Kang (TSK) models. The method handles several attributes simultaneously, such as the input partition, feature selection and estimation of the consequent parameters. The model building process comprises three stages. In stage one, structure learning is formulated as an objective weighting optimization problem. Apart from the mean square error (MSE) and the number of rules, three additional criteria are introduced in the fitness function for measuring the quality of the partitions. Optimization of these measures leads to models with representative rules, small overlapping and efficient data cover. To obtain models with good local interpretation, the consequent parameters are determined using a local MSE function while the overall model is evaluated on the basis of a global MSE function. The initial model is simplified at stage two using a rule base simplification routine. Similar fuzzy sets are merged and the “don’t care” premises are recognized. Finally, the simplified models are fine-tuned at stage three to improve the model performance. The suggested method is used to generate TSK models with crisp and polynomial consequents for two benchmark classification problems, the iris and the wine data. Simulation results reveal the effectiveness of our method. The resulting models exhibit simple structure, interpretability and superior recognition rates compared to other methods of the literature.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.