# Fuzzy Weighted Least Squares Support Vector Regression with Data Reduction for Nonlinear System Modeling

Authors: Xiaoyong Liu; Aijia Ouyang; Zhonghua Yun
Journal: Mathematical Problems in Engineering
 (2018)

---

## Abstract

This paper proposes a fuzzy weighted least squares support vector regression (FW-LSSVR) with data reduction for nonlinear system modeling based only on the measured data. The proposed method combines the advantages of data reduction with some ideas of fuzzy weighted mechanism. It not only possesses the capability of illuminating local characteristic of the modeled plant but also can deal with the problem of boundary effects resulted from local LSSVR method when the modeled data is at the boundary of whole data subset. Furthermore, in comparison of the SVR, the proposed method only utilizes fewer hyperparameters to construct model, and the overlap factorλ can be chosen in relatively smaller value than SVR to further reduce more computational time. First of all, distilling the original input space into several regions with fuzzy partition by applying Gustafson-Kessel clustering algorithm (GKCA) is a foundation for data reduction and the overlap factor is introduced to reduce the size of subsets. Following that, those subset regression models (SRMs) which can be simultaneously solved by LSSVR are integrated into an overall output of the estimated nonlinear system by fuzzy weighted. Finally, the proposed method is demonstrated by experimental analysis and compared with local LSSVR, weighted SVR, and global LSSVR methods by using the index of computational time and root-mean-square error (RMSE).


---

## Body

## 1. Introduction

It is well known that, in a large number of applications such as advanced control, process simulation, fault detection, or other research areas, a significant problem is to construct mathematical model of estimated system only based on its measured data. Some major theories or methods on identifying nonlinear system have been independently developed in various research field including fuzzy system [1], neural networks [2], and other approach [3]. However, LSSVR method [4], like SVR [5], also adopts the structural risk minimization and has the better equilibrium between sparsity and modeling accuracy. Furthermore, LSSVR, by substituting a set of equality conditions for complex inequalities ones, translates complex quadratic optimization as a simple linear programming, which is greatly relieve computational load. In literature [6], the power of generalization for LSSVR is no worse than that SVR.Therefore, the LSSVR has been attracting extensive attentions and has obtained successful application like time series prediction [7, 8], subspace identification [9, 10], signal processing [11, 12], and other applications [13, 14] during the past few years. In spite of the LSSVR approach, referred to as the global LSSVR (G-LSSVR) approach, has become an effective tool in various applications, and can identify an estimated model whose modeling accuracy is guaranteed by obtaining an appropriate mathematical model [15] and a proper hyperparameter set which usually consists of the two variables: the kernel width (σ) and the penalty factor (γ). Generally, it is an insignificant for global-LSSVR to derive a well local behavior. We discovers in literature [15, 16] that G-LSSVR has also some defective in illuminating local behavior.Recently, local modeling approaches, as an alternative efficient algorithm, because of their superiorities to identify various areas of estimated nonlinear system, seem desirable. In the literature [17], a local fusion modeling method based on LSSVR and nerofuzzy has been proposed. It employs LSSVR and a learning method named as layering two kind of problem to construct each local model. In the literature [18], it adopts another approach which makes use of interest training point to identify local model instead of all points and by applying vector-norm distance [19] to search for K nearest points. To seek a set of optimal data points, a Euclidian distance measurement method [20, 21] is proposed and the local model is set up according to these neighboring points. From the pointview of capturing the local behavior, our aims are to construct their connection between some models and the localized support vector regression (LSVR) method [22] has been proposed. Considering the much more computational time of G-LSSVR, a local grey SVR [23] is developed to speed up the calculational time. Further, by introducing regularization, a general local and global learning framework [24] formulates multiple classifier in each data of neighbours.Nevertheless, the local modeling approaches or local-LSSVR have more superiorities in identifying local characteristics than that approaches such as global-SVR or LSSVR; it is still unsatisfactory in modeling global capability. First, due to the different criterion to selectK nearest neighbor training data in subsets, the better performance for local-LSSVR is not derived when those training data are at the boundary area. Second, because the number of constructing all local models is equal to the size of testing set, the local LSSVR approach generally leads to a heavy computation load [16]. Third, it generates boundary effects resulting from local LSSVR method when the modeled data is at the boundary of whole data subset.Based on the above consideration, our aims present a FW-LSSVR method for nonlinear system modeling based only on the obtained measure data. The paper integrates the superiorities of GKCA, weighted average mechanism, and some ideas from LSSVR. First of all, distilling the original input space into several regions with fuzzy partition by applying GKCA is a foundation for data reduction. Following that, those subset regression models (SRMs) which can be simultaneously solved by LSSVR are integrated into an overall output of the estimated nonlinear system by fuzzy weighted. The proposed method not only possesses the capability of illuminating local characteristic of the estimated models but also can deal with the problem of boundary effects resulted from local LSSVR method. Furthermore, in comparison of the support vector regression (SVR), the proposed method only utilizes fewer hyperparameters to construct model, and the overlap factorλ is chosen in relatively smaller value than SVR to further reduce more computational time. Finally, experimental analysis demonstrates that our approach not only overcomes the disadvantages of local LSSVR, weighted SVR, and global LSSVR methods in the process of modeling nonlinear system but also has better root-mean-square error (RMSE) performance and needs less computational time.The paper is organised as follows: brief descriptions for LSSVR and GKCA in Section2 are firstly given, the proposed method is introduced in detail in Sections 3 and 4 shows several examples for demonstrating our approach, and Section 5 summarizes the whole paper.


## 2. Preliminaries

### 2.1. Least Squares Support Vector Regression

It has been shown that the generalization performance for LSSVR presented by [25] is comparable to that of the SVR through a meticulous empirical study [6]. Next, we will concisely introduce LSSVR with the following training points, where x
k
∈
R
n is the input pattern and y
k is the corresponding target.(1)
x
1
,
y
1
,
…
,
x
N
,
y
NThe LSSVR can be represented for a test input x as(2)
f
x
=
∑
k
=
1
N
α
k
K
x
,
x
k
+
bBecause of adopting the Gaussian kernel width, kernel function K
(
x
,
x
k
) in (2) can further be rewritten as(3)
f
x
=
∑
k
=
1
N
α
k
exp
⁡
-
x
-
x
k
2
2
σ
2
+
bwhere support-value-vector α
=
[
α
1
,
α
2
,
…
,
α
N
]
T and bias b are solved by formulating the following optimization [25]:(4)
m
i
n
w
,
b
,
ξ
k
2
ȷ
1
w
,
b
,
ξ
=
1
2
w
T
w
+
γ
1
2
∑
k
=
1
N
ξ
k
2
s
.
t
.
y
k
=
w
T
Φ
x
k
+
b
+
ξ
k
,
k
=
1,2
,
…
,
N
.where Φ
(
·
) represents a feature mapping which nonlinear space is transformed to a high-dimensional linear space and parameter γ
∈
R
+ is regularization constant which governs the relative importance between the data fitting and the smoothness of the solution. Using Lagrange multiplier method for (4) gives rise to an unconstrained optimization problem:(5)
L
1
w
,
b
,
ξ
;
α
=
ȷ
1
w
,
b
,
ξ
-
∑
k
=
1
N
α
k
w
T
Φ
x
k
+
b
+
ξ
k
-
y
kIn terms of the KKT condition, one derives(6)
∂
L
1
∂
w
=
0
→
w
=
∑
k
=
1
N
α
k
Φ
x
k
∂
L
1
∂
b
=
0
→
∑
k
=
1
N
α
k
=
0
∂
L
1
∂
ξ
k
=
0
→
α
k
=
γ
ξ
k
∂
L
1
∂
α
k
=
0
→
w
T
Φ
x
k
+
b
-
y
k
+
ξ
k
=
0
,
k
=
1,2
,
…
,
NConsequently, learning process of LSSVR corresponding to (5) is implemented by solving(7)
0
1
N
T
1
N
Ω
+
γ
-
1
I
N
b
α
=
0
ywhere y
=
[
y
1
,
y
2
,
…
,
y
N
]
T, 1
N
=
[
1,1
,
…
,
1
]
T, Ω
i
j
=
K
(
x
i
,
x
j
)
=
Φ
(
x
i
)
T
Φ
(
x
j
), and ∀
i
,
j
=
1,2
,
…
,
N, with K
(
·
,
·
) a positive-definitive Mercer kernel function meeting the Merer’s theorem.


### 2.2. Gustafson-Kessel Clustering Algorithm

Clustering analysis plays an important role in classification and regression problem. In order to study some important characteristics of complex system, it is crucial for researchers to decompose an original data set into several subsets which is well reflect a system’s behavior. Especially, GKCA [26] used for extracting various clustering center in different shape and direction for a larger data set [27] and is superior to conventional FCM. GKCA can be achieved by minimizing the following objective function:(8)
J
=
∑
k
=
1
R
∑
i
=
1
N
μ
i
k
m
x
i
-
ν
k
T
M
k
x
i
-
ν
k
(9)
∑
k
=
1
R
μ
i
k
=
1
,
i
=
1,2
,
…
,
N
μ
i
k is a component from fuzzy matrix U, M
k is defined by (12), R describes the number of clustering center ν
k, and it needs to be predefined. In a nutshell, GKCA can be boiled down to the following steps:(1) calculating the cluster centers(10)
ν
k
l
=
∑
i
=
1
N
μ
i
k
l
-
1
m
x
i
∑
i
=
1
N
μ
i
k
l
-
1
m
,
1
≤
k
≤
Rwhere l denotes iteration number and N is the number of all data points.(2) computingF
k according to the definition of covariance(11)
F
k
=
∑
i
=
1
N
μ
i
k
l
-
1
m
x
i
-
ν
k
l
x
i
-
ν
k
l
T
∑
i
=
1
N
μ
i
k
l
-
1
m
,
1
≤
k
≤
R(3) computing the distance(12)
M
k
=
det
⁡
F
k
1
/
n
F
k
-
1
d
i
k
M
k
2
=
x
i
-
ν
k
l
T
M
k
x
i
-
ν
k
l (4) revising the components μ
i
k of fuzzy matrix (13)
μ
i
k
l
=
1
∑
j
=
1
R
d
i
k
M
k
/
d
j
k
M
k
2
/
m
-
1
,
1
≤
i
≤
N
,
1
≤
k
≤
RThe iteration stops when the difference between the fuzzy partition matrices U
(
l
) and U
(
l
-
1
) in the following iterations are lower than δ.


## 2.1. Least Squares Support Vector Regression

It has been shown that the generalization performance for LSSVR presented by [25] is comparable to that of the SVR through a meticulous empirical study [6]. Next, we will concisely introduce LSSVR with the following training points, where x
k
∈
R
n is the input pattern and y
k is the corresponding target.(1)
x
1
,
y
1
,
…
,
x
N
,
y
NThe LSSVR can be represented for a test input x as(2)
f
x
=
∑
k
=
1
N
α
k
K
x
,
x
k
+
bBecause of adopting the Gaussian kernel width, kernel function K
(
x
,
x
k
) in (2) can further be rewritten as(3)
f
x
=
∑
k
=
1
N
α
k
exp
⁡
-
x
-
x
k
2
2
σ
2
+
bwhere support-value-vector α
=
[
α
1
,
α
2
,
…
,
α
N
]
T and bias b are solved by formulating the following optimization [25]:(4)
m
i
n
w
,
b
,
ξ
k
2
ȷ
1
w
,
b
,
ξ
=
1
2
w
T
w
+
γ
1
2
∑
k
=
1
N
ξ
k
2
s
.
t
.
y
k
=
w
T
Φ
x
k
+
b
+
ξ
k
,
k
=
1,2
,
…
,
N
.where Φ
(
·
) represents a feature mapping which nonlinear space is transformed to a high-dimensional linear space and parameter γ
∈
R
+ is regularization constant which governs the relative importance between the data fitting and the smoothness of the solution. Using Lagrange multiplier method for (4) gives rise to an unconstrained optimization problem:(5)
L
1
w
,
b
,
ξ
;
α
=
ȷ
1
w
,
b
,
ξ
-
∑
k
=
1
N
α
k
w
T
Φ
x
k
+
b
+
ξ
k
-
y
kIn terms of the KKT condition, one derives(6)
∂
L
1
∂
w
=
0
→
w
=
∑
k
=
1
N
α
k
Φ
x
k
∂
L
1
∂
b
=
0
→
∑
k
=
1
N
α
k
=
0
∂
L
1
∂
ξ
k
=
0
→
α
k
=
γ
ξ
k
∂
L
1
∂
α
k
=
0
→
w
T
Φ
x
k
+
b
-
y
k
+
ξ
k
=
0
,
k
=
1,2
,
…
,
NConsequently, learning process of LSSVR corresponding to (5) is implemented by solving(7)
0
1
N
T
1
N
Ω
+
γ
-
1
I
N
b
α
=
0
ywhere y
=
[
y
1
,
y
2
,
…
,
y
N
]
T, 1
N
=
[
1,1
,
…
,
1
]
T, Ω
i
j
=
K
(
x
i
,
x
j
)
=
Φ
(
x
i
)
T
Φ
(
x
j
), and ∀
i
,
j
=
1,2
,
…
,
N, with K
(
·
,
·
) a positive-definitive Mercer kernel function meeting the Merer’s theorem.


## 2.2. Gustafson-Kessel Clustering Algorithm

Clustering analysis plays an important role in classification and regression problem. In order to study some important characteristics of complex system, it is crucial for researchers to decompose an original data set into several subsets which is well reflect a system’s behavior. Especially, GKCA [26] used for extracting various clustering center in different shape and direction for a larger data set [27] and is superior to conventional FCM. GKCA can be achieved by minimizing the following objective function:(8)
J
=
∑
k
=
1
R
∑
i
=
1
N
μ
i
k
m
x
i
-
ν
k
T
M
k
x
i
-
ν
k
(9)
∑
k
=
1
R
μ
i
k
=
1
,
i
=
1,2
,
…
,
N
μ
i
k is a component from fuzzy matrix U, M
k is defined by (12), R describes the number of clustering center ν
k, and it needs to be predefined. In a nutshell, GKCA can be boiled down to the following steps:(1) calculating the cluster centers(10)
ν
k
l
=
∑
i
=
1
N
μ
i
k
l
-
1
m
x
i
∑
i
=
1
N
μ
i
k
l
-
1
m
,
1
≤
k
≤
Rwhere l denotes iteration number and N is the number of all data points.(2) computingF
k according to the definition of covariance(11)
F
k
=
∑
i
=
1
N
μ
i
k
l
-
1
m
x
i
-
ν
k
l
x
i
-
ν
k
l
T
∑
i
=
1
N
μ
i
k
l
-
1
m
,
1
≤
k
≤
R(3) computing the distance(12)
M
k
=
det
⁡
F
k
1
/
n
F
k
-
1
d
i
k
M
k
2
=
x
i
-
ν
k
l
T
M
k
x
i
-
ν
k
l (4) revising the components μ
i
k of fuzzy matrix (13)
μ
i
k
l
=
1
∑
j
=
1
R
d
i
k
M
k
/
d
j
k
M
k
2
/
m
-
1
,
1
≤
i
≤
N
,
1
≤
k
≤
RThe iteration stops when the difference between the fuzzy partition matrices U
(
l
) and U
(
l
-
1
) in the following iterations are lower than δ.


## 3. Fuzzy Weighted Least Squares Support Vector Regression

The paper develops a new method combining respective advantages both global and local learning method to formulate overall framework. The procedures of the proposed FW-LSSVR approach are depicted by Figure1.Figure 1
An illustration for the proposed FWA-LSSVR approach.


### 3.1. Constructing Fuzzy Weighted with Triangle Membership Functions

Applications of fuzzy concepts were early developed by Zadeh [28]. A triangular fuzzy number A
~ can be parametrized by a triplet (a
L
,
a
M
,
a
R), where a
L and a
R denote the left and right bounds, respectively, and a
M represents the mode of A
~. The membership function of the triangular fuzzy number A
~ is defined by(14)
μ
A
~
u
=
0
,
u
<
a
L
u
-
a
L
a
M
-
a
L
,
a
L
≤
u
≤
a
M
a
R
-
u
a
R
-
a
M
,
a
M
≤
u
≤
a
R
0
,
u
≥
a
RThe α-cut A
α of the fuzzy set A
~ in the universe of discourse U is defined by(15)
A
α
=
u
i
∣
μ
A
~
u
i
≥
α
,
u
i
∈
Uwhere α
∈
[
0,1
].In generally, fuzzy partition is implemented by some clustering methods and GKCA [26] is common used to decompose the original data set. It discovers that GKCA is superior to that of FCM(fuzzy c-means) and subtractive clustering. GKCA extended the standard FCM algorithms by adopting a flexible distance measure that is calculated using covariance matrices as exhibited in (11). Meanwhile, various difformities and orientation in original data set are detected by GKCA.In this paper, GKCA is used, in which it is based on the minimization of (8). As stated in Section 2.2, the iteration is to be stopped when the termination criterion is satisfied, namely, U
(
l
)
-
U
(
l
-
1
)
<
δ, and an appropriate fuzzy membership matrices is obtained finally. Following that, the cluster centers ν
k
j and spread widthes ρ
k
j are calculated, respectively, as [29](16)
ν
k
j
=
∑
i
=
1
N
x
i
j
u
k
i
∑
i
=
1
N
u
k
i
(17)
ρ
k
j
=
∑
i
=
1
N
u
k
i
x
i
j
-
ν
k
j
2
∑
i
=
1
N
u
k
i
(18)
i
=
1,2
,
…
,
N
;
k
=
1,2
,
…
,
R
;
j
=
1,2
,
…
,
nwhere N is the number of training data, R is the number of clusters, u
i
k is the degree of membership of x
i in the cluster k, x
i is the ith training data, n is a feature dimensionality, and ∥
∗
∥ measures the distance between two vectors.From (16) and (17), the weighted values can be calculated by applying triangle membership functions. In order to derive the weighted values, triangle membership function μ
k
(
x
i
j
) is constructed as follows according to (14): (19)
μ
k
x
i
j
=
0
x
i
j
≤
ν
k
j
-
λ
·
σ
k
j
x
i
j
-
ν
k
j
-
λ
·
σ
k
j
ν
k
j
-
ν
k
j
-
λ
·
σ
k
j
ν
k
j
-
λ
·
σ
k
j
<
x
i
j
<
ν
k
j
ν
k
j
+
λ
·
σ
k
j
-
x
i
j
ν
k
j
+
λ
·
σ
k
j
-
ν
k
j
ν
k
j
<
x
i
j
<
ν
k
j
+
λ
·
σ
k
j
0
x
i
j
≥
ν
k
j
+
λ
·
σ
k
j
1
x
i
j
=
ν
k
j Instead of (15), α-cut A
α of the fuzzy set A
~, the overlap factor λ is introduced into triangle membership functions to more readily dominate the size of original data subsets, and the degree of fulfilment β
k
(
x
i
) is calculated in terms of(20)
β
k
x
i
=
μ
k
x
i
1
·
μ
k
x
i
2
⋯
μ
k
x
i
n
=
∏
j
=
1
n
μ
k
x
i
j
i
=
1,2
,
…
,
N
;
j
=
1,2
,
…
,
n
k
=
1,2
,
…
,
RBy the normalized firing level of the kth fuzzy sets, weighted values ω
k
(
x
i
) is finally calculated as(21)
ω
k
x
=
β
k
x
∑
k
=
1
R
β
k
xIn some applications [30], Gaussian membership function is adopted(22)
μ
k
x
i
j
=
exp
⁡
-
θ
x
i
j
-
ι
k
j
2
i
=
1
,
2
,
…
,
N
;
k
=
1,2
,
…
,
R
;
j
=
1,2
,
…
,
nwhere θ
=
4
/
τ
2 and τ
≥
0 describing the width of the Gaussian fuzzy function, which is usually chosen as a interval [
0.3,0.5
].


### 3.2. FW-LSSVR with Data Reduction

Takagi-Sugeno fuzzy models [31] have recently become a powerful practical instrument in identifying the complex system. Based on the fuzzy partition, nonlinear description of estimated system can well be expanded into several simple linear descriptions by applying rules of if-then(23)
R
i
:
I
f
x
i
1
i
s
μ
i
1
x
i
1
a
n
d
⋯
a
n
d
x
i
n
i
s
μ
i
n
x
i
n
t
h
e
n
y
i
=
a
i
T
x
+
b
i
i
=
1,2
,
…
,
RHere μ
i
1, μ
i
2, …, μ
i
n are the fuzzy membership function of x
n, y
n is corresponding output, and a and b are defined as consequent parameter.There are the fuzzy sets assigned to corresponding input variables, variabley
i represents the value of the ith rule output, and a
i and b
i are parameters of the consequent function.For the inputx, fuzzy weighted output f
^ can be summarized as(24)
f
^
x
=
∑
i
=
1
R
ω
i
x
a
i
T
x
+
b
iwhere ω
i
(
x
) represents the normalized firing strength of the ith rule for the kth sample and is computed by (20) and (21).Next, substituting linearizing around a point, the proposed method make use of the subset regression models (SRMs) which are simultaneously solved by LSSVR in each fuzzy partition area. Firstly, the original input data set is divided into several subsets with fuzzy partition. In each region, SRM is independently trained by LSSVR. Based on the obtained centersν
k
j and the spread width ρ
k
j from (16) and (17), the old data set is once again decomposed into a new one △
k by introducing the overlap factor λ to reduce the size of original subsets. We can perform the partition by the following pseudo code:(25)
f
o
r
k
=
1
:
R
f
o
r
i
=
1
:
N
i
f
ν
k
1
-
λ
·
ρ
k
1
≤
x
i
1
≤
ν
k
1
+
λ
·
ρ
k
1
&
&
⋯
&
&
ν
k
n
-
λ
·
ρ
k
n
≤
x
i
n
≤
ν
k
n
+
λ
·
ρ
k
n
x
i
j
,
y
i
∈
△
k
e
l
s
e
x
i
j
,
y
i
∉
△
k
e
n
d
e
n
d
e
n
dwhere the overlap factorλ is introduced to reduce the size of subsets and obtained a new training set with data reduction.Then, the obtained new training subsets will be used to construct eachS
R
M
k by (3) as follows:(26)
S
R
M
k
x
=
f
x
x
∈
△
k
=
∑
i
=
1
m
k
α
k
i
exp
⁡
-
x
-
x
i
2
2
σ
2
+
b
k
k
=
1,2
,
…
,
Rwhere S
R
M
k is termed as the kth subset regression model, the parameters α
k
i and b
k are derived by LSSVR approach, and m
k describes the size of new subset △
k. Following that, the weighted values ω
i
(
x
) computed by (21) are combined with the S
R
M
k to form the global predicted output as follows:(27)
y
^
x
i
=
∑
k
=
1
R
ω
k
x
i
S
R
M
k
x
iIt is clear from (27) that each S
R
M
k is solved by LSSVR and can be completed simultaneously. As a result, it can largely improve computational efficiency of the proposed method. In brief, the proposed approach can be summarized as follows.Step 1.
Define the overlap factorλ and select the size of clustering subsets R where R is generally selected to 2.Step 2.
Obtain the appropriate fuzzy partition matricesU by applying GKCA until the termination criterion U
(
l
)
-
U
(
l
-
1
)
<
δ is satisfied, namely, U
=
U
(
l
) finally.Step 3.
Compute the cluster centersν
k
j and the spread width ρ
k
j using (16) and (17) from the obtained matrices U and the training data X.Step 4.
Determine new training subsets△
k by (25) based on the overlap factor λ, the cluster centers, and the spread width.Step 5.
Set two hyperparameters{
σ and γ
} in the LSSVR.Step 6.
Construct each subset regression modelS
R
M
k
(
x
) by the LSSVR approach and (26) is thus obtained.Step 7.
Compute the global predicted output according to (26) and (27) finally.


## 3.1. Constructing Fuzzy Weighted with Triangle Membership Functions

Applications of fuzzy concepts were early developed by Zadeh [28]. A triangular fuzzy number A
~ can be parametrized by a triplet (a
L
,
a
M
,
a
R), where a
L and a
R denote the left and right bounds, respectively, and a
M represents the mode of A
~. The membership function of the triangular fuzzy number A
~ is defined by(14)
μ
A
~
u
=
0
,
u
<
a
L
u
-
a
L
a
M
-
a
L
,
a
L
≤
u
≤
a
M
a
R
-
u
a
R
-
a
M
,
a
M
≤
u
≤
a
R
0
,
u
≥
a
RThe α-cut A
α of the fuzzy set A
~ in the universe of discourse U is defined by(15)
A
α
=
u
i
∣
μ
A
~
u
i
≥
α
,
u
i
∈
Uwhere α
∈
[
0,1
].In generally, fuzzy partition is implemented by some clustering methods and GKCA [26] is common used to decompose the original data set. It discovers that GKCA is superior to that of FCM(fuzzy c-means) and subtractive clustering. GKCA extended the standard FCM algorithms by adopting a flexible distance measure that is calculated using covariance matrices as exhibited in (11). Meanwhile, various difformities and orientation in original data set are detected by GKCA.In this paper, GKCA is used, in which it is based on the minimization of (8). As stated in Section 2.2, the iteration is to be stopped when the termination criterion is satisfied, namely, U
(
l
)
-
U
(
l
-
1
)
<
δ, and an appropriate fuzzy membership matrices is obtained finally. Following that, the cluster centers ν
k
j and spread widthes ρ
k
j are calculated, respectively, as [29](16)
ν
k
j
=
∑
i
=
1
N
x
i
j
u
k
i
∑
i
=
1
N
u
k
i
(17)
ρ
k
j
=
∑
i
=
1
N
u
k
i
x
i
j
-
ν
k
j
2
∑
i
=
1
N
u
k
i
(18)
i
=
1,2
,
…
,
N
;
k
=
1,2
,
…
,
R
;
j
=
1,2
,
…
,
nwhere N is the number of training data, R is the number of clusters, u
i
k is the degree of membership of x
i in the cluster k, x
i is the ith training data, n is a feature dimensionality, and ∥
∗
∥ measures the distance between two vectors.From (16) and (17), the weighted values can be calculated by applying triangle membership functions. In order to derive the weighted values, triangle membership function μ
k
(
x
i
j
) is constructed as follows according to (14): (19)
μ
k
x
i
j
=
0
x
i
j
≤
ν
k
j
-
λ
·
σ
k
j
x
i
j
-
ν
k
j
-
λ
·
σ
k
j
ν
k
j
-
ν
k
j
-
λ
·
σ
k
j
ν
k
j
-
λ
·
σ
k
j
<
x
i
j
<
ν
k
j
ν
k
j
+
λ
·
σ
k
j
-
x
i
j
ν
k
j
+
λ
·
σ
k
j
-
ν
k
j
ν
k
j
<
x
i
j
<
ν
k
j
+
λ
·
σ
k
j
0
x
i
j
≥
ν
k
j
+
λ
·
σ
k
j
1
x
i
j
=
ν
k
j Instead of (15), α-cut A
α of the fuzzy set A
~, the overlap factor λ is introduced into triangle membership functions to more readily dominate the size of original data subsets, and the degree of fulfilment β
k
(
x
i
) is calculated in terms of(20)
β
k
x
i
=
μ
k
x
i
1
·
μ
k
x
i
2
⋯
μ
k
x
i
n
=
∏
j
=
1
n
μ
k
x
i
j
i
=
1,2
,
…
,
N
;
j
=
1,2
,
…
,
n
k
=
1,2
,
…
,
RBy the normalized firing level of the kth fuzzy sets, weighted values ω
k
(
x
i
) is finally calculated as(21)
ω
k
x
=
β
k
x
∑
k
=
1
R
β
k
xIn some applications [30], Gaussian membership function is adopted(22)
μ
k
x
i
j
=
exp
⁡
-
θ
x
i
j
-
ι
k
j
2
i
=
1
,
2
,
…
,
N
;
k
=
1,2
,
…
,
R
;
j
=
1,2
,
…
,
nwhere θ
=
4
/
τ
2 and τ
≥
0 describing the width of the Gaussian fuzzy function, which is usually chosen as a interval [
0.3,0.5
].


## 3.2. FW-LSSVR with Data Reduction

Takagi-Sugeno fuzzy models [31] have recently become a powerful practical instrument in identifying the complex system. Based on the fuzzy partition, nonlinear description of estimated system can well be expanded into several simple linear descriptions by applying rules of if-then(23)
R
i
:
I
f
x
i
1
i
s
μ
i
1
x
i
1
a
n
d
⋯
a
n
d
x
i
n
i
s
μ
i
n
x
i
n
t
h
e
n
y
i
=
a
i
T
x
+
b
i
i
=
1,2
,
…
,
RHere μ
i
1, μ
i
2, …, μ
i
n are the fuzzy membership function of x
n, y
n is corresponding output, and a and b are defined as consequent parameter.There are the fuzzy sets assigned to corresponding input variables, variabley
i represents the value of the ith rule output, and a
i and b
i are parameters of the consequent function.For the inputx, fuzzy weighted output f
^ can be summarized as(24)
f
^
x
=
∑
i
=
1
R
ω
i
x
a
i
T
x
+
b
iwhere ω
i
(
x
) represents the normalized firing strength of the ith rule for the kth sample and is computed by (20) and (21).Next, substituting linearizing around a point, the proposed method make use of the subset regression models (SRMs) which are simultaneously solved by LSSVR in each fuzzy partition area. Firstly, the original input data set is divided into several subsets with fuzzy partition. In each region, SRM is independently trained by LSSVR. Based on the obtained centersν
k
j and the spread width ρ
k
j from (16) and (17), the old data set is once again decomposed into a new one △
k by introducing the overlap factor λ to reduce the size of original subsets. We can perform the partition by the following pseudo code:(25)
f
o
r
k
=
1
:
R
f
o
r
i
=
1
:
N
i
f
ν
k
1
-
λ
·
ρ
k
1
≤
x
i
1
≤
ν
k
1
+
λ
·
ρ
k
1
&
&
⋯
&
&
ν
k
n
-
λ
·
ρ
k
n
≤
x
i
n
≤
ν
k
n
+
λ
·
ρ
k
n
x
i
j
,
y
i
∈
△
k
e
l
s
e
x
i
j
,
y
i
∉
△
k
e
n
d
e
n
d
e
n
dwhere the overlap factorλ is introduced to reduce the size of subsets and obtained a new training set with data reduction.Then, the obtained new training subsets will be used to construct eachS
R
M
k by (3) as follows:(26)
S
R
M
k
x
=
f
x
x
∈
△
k
=
∑
i
=
1
m
k
α
k
i
exp
⁡
-
x
-
x
i
2
2
σ
2
+
b
k
k
=
1,2
,
…
,
Rwhere S
R
M
k is termed as the kth subset regression model, the parameters α
k
i and b
k are derived by LSSVR approach, and m
k describes the size of new subset △
k. Following that, the weighted values ω
i
(
x
) computed by (21) are combined with the S
R
M
k to form the global predicted output as follows:(27)
y
^
x
i
=
∑
k
=
1
R
ω
k
x
i
S
R
M
k
x
iIt is clear from (27) that each S
R
M
k is solved by LSSVR and can be completed simultaneously. As a result, it can largely improve computational efficiency of the proposed method. In brief, the proposed approach can be summarized as follows.Step 1.
Define the overlap factorλ and select the size of clustering subsets R where R is generally selected to 2.Step 2.
Obtain the appropriate fuzzy partition matricesU by applying GKCA until the termination criterion U
(
l
)
-
U
(
l
-
1
)
<
δ is satisfied, namely, U
=
U
(
l
) finally.Step 3.
Compute the cluster centersν
k
j and the spread width ρ
k
j using (16) and (17) from the obtained matrices U and the training data X.Step 4.
Determine new training subsets△
k by (25) based on the overlap factor λ, the cluster centers, and the spread width.Step 5.
Set two hyperparameters{
σ and γ
} in the LSSVR.Step 6.
Construct each subset regression modelS
R
M
k
(
x
) by the LSSVR approach and (26) is thus obtained.Step 7.
Compute the global predicted output according to (26) and (27) finally.


## 4. Experimental Studies

For the purpose of illustrating our approach, both RMSE (root mean squares error) and computational time are considered by four simulated data experiments. All numerical experiments are carried out on the personal computer with a 2.50GHz Intel(R) Celeron(R) CPU and 2 Gbytes memory. This computer runs on Windows XP, with MATLAB R2012a and VC++ 6.0 compiler installed. The LSSVR from Matlab Toolbox was used (this toolbox has been obtained via the Internet athttp://www.esat.kuleuven.be/sista/lssvmlab/.).We evaluate the performance of the proposed approach on four benchmark data sets [15]. The index adopted for measuring modeling accuracy is selected as(28)
R
M
S
E
=
1
N
∑
k
=
1
N
y
k
-
y
^
k
2Another index is the total computational time for constructing the proposed method and the local running time for constructing those SRMs. The two indexes of the proposed method are compared with G-LSSVR, local-LSSVR, and [15]. In addition, the importance of the selected different overlap factor λ is also compared. To obtain a fair comparison, their hyperparameters are set as the same values. The local-LSSVR is shortly introduced in the following. Let the training data X
=
{
x
i
,
y
i
∣
i
=
1,2
,
…
,
N
} be obtained by experiment or a real system and x
t be generated from testing data set and devoted to the test input of predicted output. In the closest regions of x
t, there are P training inputs to be selected by applying the norm-distance approach. As a result, local-LSSVR models corresponding to all testing output are derived by P training inputs in those regions.Example 1.
The approximated function is(29)
y
x
=
10
·
e
x
p
-
x
·
cos
⁡
2
·
π
·
x
,
x
∈
0,5In this function, 501 training points and 1001 testing points are obtained from (29). Due to the use of the proposed approach, there are only two hyperparameters (i.e., σ and γ) to be chosen, whereas SVR approach needs to choose three hyperparameters (i.e., σ, γ, and ε). For comparison, Figure 2 shows the results of the WFA-LSSVR and G-LSSVR method. The two indexes both RMSE and computational time including local-LSSVR, G-LSSVR, [15] and our approach, are summarized in Tables 1 and 2, respectively. Additionally, the importance of selected different overlap factor λ is also compared by Table 3.Table 1
Comparison results of the proposed method, [15], G-LSSVR and Local-LSSVR with the hyper-parameter set {
1.5,1000
}, and the overlap factor λ as 1.5 are shown for Example 1.
R: the number of the SRMs
RMSE (Training)
RMSE (Testing)
our approach
[15]
our approach
[15]
3-SRMs
0.2172
0.8184
0.2151
0.8186
5-SRMS
0.0368
0.5446
0.0363
0.5447
7-SRMs
0.0146
0.3554
0.0140
0.3556
9-SRMs
0.0079
0.3389
0.0076
0.3391
12-SRMS
0.0042
0.1957
0.0040
0.1961
15-SRMs
0.0026
0.1471
0.0026
0.1472
G-LSSVR
1.7295
1.7298
Local-LSSVR
M=21 training points
3.7635
3.7630
M=41 training points
1.1742
1.1622
M=61 training points
0.0054
0.0050
M=81 training points
0.0028
0.0026Table 2
Computational time of the proposed method, G-LSSVR and Local-LSSVR with the hyperparameter set{
1.5,1000
}, and the overlap factor λ as 1.5 are shown for Example 1, where the T-T represents total computational time for building the overall process of the proposed method and L-T represents the computational time for constructing all SRMs.
R:the number of SRMs
3
5
7
9
12
15
Proposed approach
L-T(Second)
0.1406
01563
0.1875
0.2344
0.2813
0.2656
T-T(Second)
0.6406
0.8750
1.2813
1.2969
1.5469
1.7031
G-LSSVR
T-T(Second): 0.2500
L-T(Second): —
M: Training points
21
41
61
81
–
–
Local-LSSVR
L-T(Second)
–
–
–
–
–
–
T-T(Second)
16.2500
17.8125
17.3125
18.0625
–
–Table 3
Comparison results of the selected different overlap factorλ for our approach are shown for Example 1, where R represents the number of SRMs, L-T the computational time for constructing all SRMs, and △
i the number of data points for each training subset.
The total training data points△=501
RMSE
RMSE
L-T
R=5
△
1
△
2
△
3
△
4
△
5
△
6
△
7
(Training)
(Testing)
(second)
λ=1.5
128
159
160
160
128
–
–
0.0146
0.0142
0.1875
λ=2.5
268
183
266
183
267
–
–
0.2086
0.2081
0.3906
R=7
△
1
△
2
△
3
△
4
△
5
△
6
△
7
λ=1.5
101
134
134
133
101
133
133
0.0132
0.0129
0.2156
λ=2.5
147
215
222
222
147
215
223
0.1875
0.1869
0.5103Figure 2
Comparison of the proposed model outputs, Global-LSSVR outputs, and testing output data for Example1.If we take these tables into account, it discovers that our approach obtains a better nonlinear function approximation comparing to RMSE in Table1 for G-LSSVR, local-LSSVR and [15]. In addition, the running time of the proposed methods in Table 2 is approximately 10-times shorter comparing with local-LSSVR method at least. In other words, the proposed method leads to a less computational time than local-LSSVR. As shown in Table 2, local-LSSVR needs more computational time. The main reason is that the number of required local models is too large and is equal to the size of all testing set. From Table 3 we also see that the comparison results on RMSE and computational time corresponding to the overlap factor λ as 1.5 performed better than as 2.5. That is to say, under the circumstances to cover the training data, larger λ does not necessarily lead to a better performance. These results confirm the superiority of our proposed method over other methods.Example 2.
The approximated function with two variables was(30)
f
x
1
,
x
2
=
sin
⁡
x
1
2
+
x
2
2
(
x
1
2
+
x
2
2
)
.In this function, x
1 and x
2 equally sampling on interval [
-
5
,
5
] are used as training inputs. The number of the training data obtained is 1681 (i.e., 41×41). The number of the used test data is 6561 (i.e., 81 × 81). For comparison, the same indexes in Example 1 are used including our approach, local-LSSVR, and Global-LSSVR and [15] is summarized in Tables 4 and 5. Additionally, the importance of selected different overlap factor λ is also compared by Table 6. These results show that the proposed method (WFA-LSSVR) outperforms G-LSSVR, local-LSSVR, and [15].Table 4
Comparison results of the proposed method, [15], G-LSSVR and Local-LSSVR with the hyper-parameter set {
3,15
}, and the overlap factor λ as 1.5 are shown for Example 2.
R: the number of the SRMs
RMSE (Training)
RMSE (Testing)
our approach
[15]
our approach
[15]
4-SRMs
0.0179
0.0325
0.0180
0.0327
6-SRMS
0.0180
0.0323
0.0180
0.0325
8-SRMs
0.0177
0.0316
0.0178
0.0317
10-SRMs
0.0175
0.0305
0.0175
0.0306
G-LSSVR
0.0289
0.0284
Local-LSSVR
M=49 training points
0.1210
0.1288
M=81 training points
0.0477
0.0558
M=121 training points
0.0249
0.0282
M=169 training points
0.0160
0.0190Table 5
Computational time of the proposed method, G-LSSVR and Local-LSSVR with the hyperparameter set{
3,15
}, and the overlap factor λ as 1.5 are shown for Example 2, where the T-T represents total computational time for building the overall process of the proposed method and L-T represents the computational time for constructing all SRMs.
R:the number of SRMs
4
6
8
10
Proposed approach
L-T(Second)
0.4688
0.7031
0.7969
1.0156
T-T(Second)
3.0469
4.8125
5.1875
6.5781
G-LSSVR
T-T(Second): 3.2969
L-T (Second): —
M: Training points
49
81
121
169
Local-LSSVR
L-T(Second)
–
–
–
–
T-T(Second)
107.3438
115.6563
127.4063
155.1563Table 6
Comparison results of the selected different overlap factorλ for our approach are shown for Example 2, where R represents the number of SRMs, L-T the computational time for constructing all SRMs, and △
i the number of data points for each training subset.
The total training data points△=1681
RMSE
RMSE
L-T
R=6
△
1
△
2
△
3
△
4
△
5
△
6
△
7
△
8
(Training)
(Testing)
(second)
λ=1.5
880
880
880
920
920
1000
–
–
0.0180
0.0180
0.7031
λ=3.0
1320
1320
1360
1600
1360
1600
–
–
0.0189
0.0189
1.0781
R=7
△
1
△
2
△
3
△
4
△
5
△
6
△
7
△
8
λ=1.5
760
840
760
880
840
760
760
880
0.0177
0.0178
0.7969
λ=3.0
1280
1600
1280
1280
1280
1360
1360
1600
0.0179
0.0179
1.4375Furthermore, it demonstrates that the predicted outputs of local modeling approach base on LSSVR lead to the problem of boundary effects under the different number of M=49, 81, 121, and 169, as shown in Figure3. Figure 4 gives the estimated value of the proposed FW-LSSVR approach with 4, 6, 8 and 10 SRMs. From Tables 4 and 5 we can also see that only slightly worse results (training RMSE) were obtained by our approach than the local-LSSVR method with M=169 training data points, but running time of the local-LSSVR is significantly longer, in which has no less than 107.3438 seconds in the experiment. From Table 6, the comparison results on RMSE and computational time corresponding to the overlap factor λ as 1.5 performed better than as 3.0. That is to say, under the circumstances to cover the training data, larger λ does not necessarily lead to a better performance and conversely a large number of training data points and more computational time are required to construct all SRMs. Therefore, compared with other methods, our method achieved better testing RMSE with less computational time and also had relatively good generalization ability.Figure 3
The predicted output corresponding to the local-LSSVR technique, whereM=49, 81, 121, and 169.Figure 4
Outputs of the proposed FWA-LSSVR approach withR=4, 6, 8, and 10 SRMs are shown, respectively.Example 3.
In this example, the following nonlinear dynamic system was used:(31)
y
k
+
1
=
y
k
y
k
-
1
y
k
+
2.5
1
+
y
2
k
+
y
2
k
-
1
+
sin
⁡
2
π
k
50
+
v
k
y
0
=
0
,
y
1
=
0
,
1
≤
k
≤
100501 data points are obtained from (31) and v
(
t
) is a Gaussian noise with variance V
a
r
(
v
)=0.25 that is shown in Figure 5. The number of the used test data is 1001. In order to compare the performance of the proposed method with other approach, the results and the curves are given in Table 7 and in Figure 5, respectively. These results show that the proposed method outperforms G-LSSVR, local-LSSVR, and [15], and RMSE in Table 7 indicates the proposed method had the best generalization performance. In addition, the running time of the proposed methods in Table 8 is approximately 10 times shorter comparing with local-LSSVR method at least. In other words, the proposed method leads to a less computational time than local-LSSVR. As shown in Table 8, local-LSSVR needs more computational time. Additionally, the importance of selected different overlap factor λ is also compared by Table 9.Table 7
Comparison results of the proposed method, [15], G-LSSVR and Local-LSSVR with the hyper-parameter set {
1,1000
}, and the overlap factor λ as 1.5 are shown for Example 3.
R: the number of the SRMs
RMSE (Training)
RMSE (Testing)
our approach
[15]
our approach
[15]
3-SRMs
0.2523
0.2715
0.2546
0.2832
5-SRMS
0.2531
0.2659
0.2661
0.2762
7-SRMs
0.2287
0.2487
0.2537
0.2645
9-SRMs
0.2298
0.2465
0.2464
0.2583
G-LSSVR
0.2922
0.3185
Local-LSSVR
M=21 training points
1.8583
1.8721
M=41 training points
0.2332
0.3383
M=61 training points
0.2259
0.3267
M=81 training points
0.2433
0.3561Table 8
Comparison results of the proposed method, [15], G-LSSVR and Local-LSSVR with the hyper-parameter set {
1,1000
}, and the overlap factor λ as 1.5 are shown for Example 3.
R:the number of SRMs
3
5
7
9
Proposed approach
L-T(Second)
0.2500
0.2813
0.2656
0.3594
T-T(Second)
0.3281
1.0938
1.3438
1.5313
G-LSSVR
T-T(Second): 0.1875
L-T (Second): —
M: Training points
49
81
121
169
Local-LSSVR
L-T(Second)
–
–
–
–
T-T(Second)
16.5469
16.7813
17.9063
18.1719Table 9
Comparison results of the selected different overlap factorλ for our approach are shown for Example 3, where R represents the number of SRMs, L-T the computational time for constructing all SRMs, and △
i the number of data points for each training subset.
The total training data points△=501
RMSE
RMSE
L-T
R=5
△
1
△
2
△
3
△
4
△
5
△
6
△
7
(Training)
(Testing)
(second)
λ=1.1
106
106
118
118
117
–
–
0.2531
0.0142
0.2813
λ=2.5
268
183
266
183
267
–
–
0.2756
0.2881
0.3438
R=7
△
1
△
2
△
3
△
4
△
5
△
6
△
7
λ=1.1
83
99
98
97
98
98
83
0.2287
0.2537
0.2656
λ=2.5
222
147
147
215
222
221
215
0.2818
0.2894
0.4063Figure 5
Comparison of the proposed model outputs and original output data for Example3.Example 4.
In this section, two hundred and ninety-six simulated data generated from a real Box-Jenkins [32] system are applied to the proposed method. These data points consisted of the gas flow rate signal x
(
k
) and the concentration of C
O
2 which is described as the output of y
(
k
). Figure 6 shows the training data that include the input signal x
(
k
) and the output signal y
(
k
). To identify the model, we choose x
k
=
[
x
(
k
)
,
x
(
k
-
1
)
,
y
(
k
-
1
)
,
y
(
k
-
2
)
] as the input variables and y
(
k
) as the output variable. In this example, 5-folds cross-validation is employed to evaluate the performance. According to the cross-validation method, the (training/testing) RMSE and the computational time of the global LSSVR (G-LSSVR) approach, the local-LSSVR (L-LSSVR) approach with M
=
41
,
61
,
81, and the proposed approach R
=
4,8
,
12 SRMs are summarized in Tables 10 and 11. From Tables 10 and 11, there is a little larger RMSE (training) for our technique than that of those approaches, the RMSE (testing) corresponding to our approach is smaller than that of them, and the run time for our technique is smaller than other local modeling approaches but litter bigger that global modeling techniques based on LSSVR. Figure 7 gives the comparisons between the actual output and the predicted output of our techniques. The importance of the selected different overlap factor λ is also compared in Table 12. As shown in Table 12, although the RMSE (training) corresponding to the overlap factor λ of 3.5 is less than that of 2.8, the RMSE (testing) corresponding to the overlap factor λ as 2.8 is less than that of as 3.4. That is to say, generalization performance in relatively smaller value of λ outperforms that of the large value. Additionally, in comparison of the [15], the proposed method only utilizes fewer hyperparameters to construct model, and the overlap factor λ is chosen in relatively smaller value to further reduce more computational time.Table 10
Comparison results of the proposed method, [15], G-LSSVR and Local-LSSVR with the hyper-parameter set {
25,1000
}, and the overlap factor λ as 2.8 are shown for Example 4.
R: the number of the SRMs
RMSE (Training)
RMSE (Testing)
our approach
[15]
our approach
[15]
4-SRMs
0.2544
0.1589
0.3304
0.5163
8-SRMS
0.2506
0.1365
0.3321
0.4861
12-SRMs
0.2491
0.1248
0.3338
0.4218
G-LSSVR
0.2480
0.3355
Local-LSSVR
M=41 training points
0.3328
0.3805
M=61 training points
0.3234
0.3666
M=81 training points
0.3237
0.3366Table 11
Computational time of the proposed method, G-LSSVR and Local-LSSVR with the hyperparameter set{
25,1000
}, and the overlap factor λ as 2.8 are shown for Example 4, where the T-T represents total computational time for building the overall process of the proposed method and L-T represents the computational time for constructing all SRMs.
R:the number of SRMs
4
8
12
Proposed approach
L-T(Second)
1.5938
2.1407
3.3437
T-T(Second)
2.4375
3.6875
4.8438
G-LSSVR
T-T(Second): 0.8281
L-T (Second): —
M: Training points
41
61
81
Local-LSSVR
L-T(Second)
–
–
–
T-T(Second)
25.4375
25.7813
26.3906Table 12
Comparison results of the selected different overlap factorλ for our approach are shown for Example 4, where R represents the number of SRMs, L-T the computational time for constructing all SRMs, and △
i the number of data points for each training subset.
The total training data points△=296, λ=2.8
RMSE
RMSE
L-T
(Training)
(Testing)
(second)
R=4
△
1
△
2
△
3
△
4
C
V
1
162
197
194
160
0.2236
0.4429
0.2969
C
V
2
155
190
190
161
0.2801
0.2374
0.3438
C
V
3
196
191
163
148
0.2883
0.2004
0.3750
C
V
4
146
162
196
176
0.2563
0.3282
0.2656
C
V
5
197
162
160
194
0.2236
0.4429
0.3125
(
C
V
1
+
C
V
2
+
C
V
3
+
C
V
4
+
C
V
5
)
/
5
0.2544
0.3304
1.5938
The total training data points△=296, λ=3.5
RMSE
RMSE
L-T
(Training)
(Testing)
(second)
R=4
△
1
△
2
△
3
△
4
C
V
1
208
193
219
217
0.2151
0.4381
0.4219
C
V
2
215
213
197
200
0.2637
0.2728
0.3125
C
V
3
218
222
200
192
0.2761
0.2066
0.3906
C
V
4
196
183
218
205
0.2465
0.3437
0.3438
C
V
5
227
219
208
193
0.2151
0.4381
0.2969
(
C
V
1
+
C
V
2
+
C
V
3
+
C
V
4
+
C
V
5
)
/
5
0.2433
0.3399
1.7747Figure 6
The simulated data set obtained from Box and Jenkins is used to validate the proposed method.Figure 7
Comparison of the proposed model outputs and original output data for Box and Jenkins example.


## 5. Conclusion

In this paper, a fuzzy weighted least squares support vector regression (FW-LSSVR) method for nonlinear system modeling have been proposed and illustrated based on the advantages of fuzzy weighted mechanism and some ideas from LSSVR. Considering that each training subset is mutually independent, all SRMs can be constructed simultaneously and our method can largely reduce computational time. As shown in our experimental results, there have better superiorities in calculation time and modeling accuracy for our approach than those approaches such as local or global modeling method. It is noted that, run time for our technique is smaller than other local modeling approaches but litter bigger that global modeling techniques based on LSSVR. Nevertheless, modeling accuracy for our approach has a considerable improvement than other techniques. Furthermore, in comparison with SVR, the proposed method only utilizes fewer hyperparameters to construct model, and the overlap factorλ is chosen in relatively smaller value than SVR to further reduce more computational time.



---

*Source: 7387650-2018-12-10.xml*