SVD-based complexity reduction of rule-bases with nonlinear antecedent fuzzy sets

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

With the help of the singular value decomposition (SVD) based complexity reduction method, not only can the redundancy of fuzzy rule-bases be eliminated, but further reduction can also be made, considering the allowable error. Namely, in the case of higher allowable error, the result may be a less complex fuzzy inference system, with a smaller rule-base. This property of the SVD-based reduction method makes possible the usage of fuzzy systems, even in cases when the available time and resources are limited. The original SVD-based reduction method was proposed for rule-bases with linear antecedent fuzzy sets. This limitation remained valid in the later extensions, as well. The purpose of this paper is to give a formal mathematical proof for the original formulas with nonlinear antecedent fuzzy sets and thus to end this limitation.

Original languageEnglish
Pages (from-to)217-221
Number of pages5
JournalIEEE Transactions on Instrumentation and Measurement
Volume51
Issue number2
DOIs
Publication statusPublished - Apr 1 2002

Keywords

  • Anytime systems
  • Complexity reduction
  • Fuzzy rule bases with nonlinear antecedent fuzzy sets
  • Nonexact complexity reduction
  • Singular value decomposition

ASJC Scopus subject areas

  • Instrumentation
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'SVD-based complexity reduction of rule-bases with nonlinear antecedent fuzzy sets'. Together they form a unique fingerprint.

  • Cite this