An adaption technique to SVD reduced rule bases

Research output: Paper

1 Citation (Scopus)

Abstract

The practically non-universal approximation property, shown by Tikk et al. and the exponential complexity problem of widely adopted fuzzy logic techniques, shown by Kóczy and Hirota, reveal the contradictious features of fuzzy rule bases in pursuing of good approximation. As a result complexity reduction topic emerged in fuzzy theory. One of the natural disadvantages of using complexity reduction is that the adaptivity property of the reduced approximation becomes strictly restricted. This paper proposes a technique, to singular value decomposition (SVD) based reduction developed in [1,8,9], which may alleviate the adaptivity restriction. A high order tensor projection is proposed here as key idea.

Original languageEnglish
Pages2488-2493
Number of pages6
Publication statusPublished - dec. 1 2001
EventJoint 9th IFSA World Congress and 20th NAFIPS International Conference - Vancouver, BC, Canada
Duration: júl. 25 2001júl. 28 2001

Other

OtherJoint 9th IFSA World Congress and 20th NAFIPS International Conference
CountryCanada
CityVancouver, BC
Period7/25/017/28/01

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Cite this

Baranyi, P., Várkonyi-Kóczy, A. R., Yam, Y., Várlaki, P., & Michelberger, P. (2001). An adaption technique to SVD reduced rule bases. 2488-2493. Paper presented at Joint 9th IFSA World Congress and 20th NAFIPS International Conference, Vancouver, BC, Canada.