Fuzzy systems identification with orthogonal matching pursuit

A. Shmilovici, O. Maimon

Research output: Contribution to conferencePaperpeer-review

1 Scopus citations

Abstract

A recursive algorithm is described for computing the representation of functions with respect to a nonorthogonal and possibly overcomplete dictionary of elementary building blocks. This algorithm, which follows the Orthogonal Matching Pursuit algorithm, is used for the identification of fuzzy systems where the membership functions are the basic building blocks. The algorithm is demonstrated on the identification of the Glycolytic chaotic time series.

Original languageEnglish
Pages2059-2064
Number of pages6
StatePublished - 1 Dec 1996
Externally publishedYes
EventProceedings of the 1996 5th IEEE International Conference on Fuzzy Systems. Part 3 (of 3) - New Orleans, LA, USA
Duration: 8 Sep 199611 Sep 1996

Conference

ConferenceProceedings of the 1996 5th IEEE International Conference on Fuzzy Systems. Part 3 (of 3)
CityNew Orleans, LA, USA
Period8/09/9611/09/96

Fingerprint

Dive into the research topics of 'Fuzzy systems identification with orthogonal matching pursuit'. Together they form a unique fingerprint.

Cite this