• 検索結果がありません。

A Study on the Fuzzy Modeling of Nonlinear Systems Using Kernel Machines

N/A
N/A
Protected

Academic year: 2021

シェア "A Study on the Fuzzy Modeling of Nonlinear Systems Using Kernel Machines"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)

SUMMARY OF Ph.D. DISSERTATION

School

Integrated Design Engineering

Student Identification Number SURNAME, First name KIM, Jongcheol Title

A Study on the Fuzzy Modeling of Nonlinear Systems Using Kernel Machines

Abstract

This thesis presents new approaches to fuzzy inference system for modeling nonlinear systems based on input and output data using kernel machines. It is important issue how to select the best structure and parameters of the fuzzy model from given input-output data. To solve this problem, the state-of-the-art kernel machine is used as the fuzzy inference engine. In the proposed fuzzy system, the number of fuzzy rules and the parameter values of membership functions are automatically generated using extended kernel machines such as an extended Support Vector Machine (SVM), an extended Feature Vector Selection (FVS) and an extended Relevance Vector Machine (RVM). As the basic structure of the proposed fuzzy inference system, the Takagi-Sugeno (TS) fuzzy model is used. In addition, the number of fuzzy rules can be reduced by adjusting the linear transformation matrix or the parameter values of a kernel function using the gradient descent method.

Chapter 1 describes the motivation, background, contribution and the outline of this work.

Chapter 2 describes the preliminaries of the fuzzy system, statistical learning theory and kernel-induced feature space. In particular, the fuzzy set and logic, fuzzy reasoning and TS fuzzy model in fuzzy system are introduced. In statistical learning theory, generalization error, empirical risk minimization and structure risk minimization principle are presented. In kernel-induced feature space, learning in feature space and kernel function are described.

Chapter 3 describes the fuzzy inference system using an extended SVM. The extended SVM is proposed as fuzzy inference engine. The structure and learning algorithm of the FIS using an extended SVM are presented. The proposed FIS is tested in three numerical examples.

Chapter 4 describes the fuzzy inference system using an extended FVS. The extended FVS is also proposed as fuzzy inference engine. The learning algorithm of the extended FVS is faster than the extended SVM. The extended FVS consists of the linear transformation part of input variables and the kernel mapping part. The linear transformation of input variables is used to solve problem selecting the best shape of the Gaussian kernel function. The proposed FIS is evaluated in the examples of two nonlinear functions.

Chapter 5 describes the fuzzy inference system using an extended RVM. The extended RVM is also proposed as fuzzy inference engine. The extended RVM generates the smaller number of fuzzy rules than the extended SVM. The extended RVM does not need the linear transformation of input variables because the basis function of the extended RVM is not restricted within the limitation of the kernel function. The structure and learning algorithm of the FIS using an extended RVM are presented. The proposed FIS is evaluated in the examples of nonlinear dynamic systems and robot arm data.

Chapter 6 concludes this thesis.

参照

関連したドキュメント

The shortage that not any quasi-triangular fuzzy number has opposite (inverse) can be solved if the set of quasi-triangular fuzzy numbers is included isomorphically in an extended

If condition (2) holds then no line intersects all the segments AB, BC, DE, EA (if such line exists then it also intersects the segment CD by condition (2) which is impossible due

To overcome the drawbacks associated with current MSVM in credit rating prediction, a novel model based on support vector domain combined with kernel-based fuzzy clustering is

Park [16], using the idea of intuitionistic fuzzy sets which was introduced by Atanassov [2], has defined the notion of intuitionistic fuzzy metric spaces with the help of

In particular, Proposition 2.1 tells you the size of a maximal collection of disjoint separating curves on S , as there is always a subgroup of rank rkK = rkI generated by Dehn

We show that a discrete fixed point theorem of Eilenberg is equivalent to the restriction of the contraction principle to the class of non-Archimedean bounded metric spaces.. We

BOUNDARY INVARIANTS AND THE BERGMAN KERNEL 153 defining function r = r F , which was constructed in [F2] as a smooth approx- imate solution to the (complex) Monge-Amp` ere

Abstract. Recently, the Riemann problem in the interior domain of a smooth Jordan curve was solved by transforming its boundary condition to a Fredholm integral equation of the