Scheduled System Maintenance on December 17th, 2014:
IEEE Xplore will be upgraded between 2:00 and 5:00 PM EST (18:00 - 21:00) UTC. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Enhanced Karnik--Mendel Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dongrui Wu ; Ming Hsieh Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA ; Mendel, J.M.

The Karnik-Mendel (KM) algorithms are iterative procedures widely used in fuzzy logic theory. They are known to converge monotonically and superexponentially fast; however, several (usually two to six) iterations are still needed before convergence occurs. Methods to reduce their computational cost are proposed in this paper. Extensive simulations show that, on average, the enhanced KM algorithms can save about two iterations, which corresponds to more than a 39% reduction in computation time. An additional (at least) 23% computational cost can be saved if no sorting of the inputs is needed.

Published in:

Fuzzy Systems, IEEE Transactions on  (Volume:17 ,  Issue: 4 )