Abstract

We propose a hybrid algorithm of fuzzy versions of two genetics-based machine learning approaches: Michigan and Pittsburgh approaches. First, we examine the performance of each approach by computer simulations on commonly used data sets. Simulation results clearly demonstrate that each approach has its own advantages and disadvantages. While the Michigan approach has high search ability to efficiently find good fuzzy rules in large search spaces for high-dimensional pattern classification problems, it can not directly optimize fuzzy rule-based systems. On the other hand, the Pittsburgh approach can directly optimize fuzzy rule-based systems while its search ability to find good fuzzy rules is not high. Then we combine these two approaches into a single hybrid algorithm. Our hybrid algorithm is based on the Pittsburgh approach where a set of fuzzy rules is coded as a string. The Michigan approach is used as a mutation operation in our hybrid algorithm for partially modifying each string by generating new rules from existing good rules. In this manner, our hybrid algorithm utilizes the advantages of the two approaches.

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.