Inference Algorithm Independent SVD Fuzzy Rule Base Complexity Reduction | Zendy

Péter Bárányi | Zendy; Yeung Yamb | Zendy; Chi Tin Yang | Zendy; Péter Várlakic | Zendy; Pél Michelberger | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Inference Algorithm Independent SVD Fuzzy Rule Base Complexity Reduction

Author(s) -

Péter Bárányi,

Yeung Yamb,

Chi Tin Yang,

Péter Várlakic,

Pél Michelberger

Publication year - 2001

Publication title -

journal of advanced computational intelligence and intelligent informatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.172

H-Index - 20

eISSN - 1343-0130

pISSN - 1883-8014

DOI - 10.20965/jaciii.2001.p0022

Subject(s) - computer science , reduction (mathematics) , algorithm , inference , computational complexity theory , fuzzy rule , fuzzy logic , fuzzy control system , artificial intelligence , data mining , mathematics , geometry

This paper is motivated by the fact that fuzzy technique is popular engineering tool, however, its use is restricted by its exponential complexity. One of the complexity reduction techniques is the SVD based reduction method which deals with arbitrary shaped fuzzy sets. Despite its advantages it is applicable to rule bases only which are based on product-sum-gravity (PSG) inference algorithm. This paper introduces the extension of the PSG based SVD-reduction method to arbitrary inference based fuzzy algorithms. An example with the control of an automatic guided system is presented to demonstrate the reduction process.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research