Sei sulla pagina 1di 7

Hybrid fuzzy support vector classier machine and modied genetic algorithm

for automatic car assembly fault diagnosis


Qi Wu
*
Jiangsu Key Laboratory for Design and Manufacture of Micro-Nano Biomedical Instruments, Southeast University, Nanjing 211189, China
a r t i c l e i n f o
Keywords:
Fuzzy m-support vector classier machine
Triangular fuzzy number
Genetic algorithm
Fault diagnosis
a b s t r a c t
This paper presents a new version of fuzzy support vector machine to diagnose automatic car assembly
fault diagnosis, the input and output variables are described as fuzzy numbers and the metric on fuzzy
number space is dened. Then by combining the fuzzy theory with v-support vector machine, the fuzzy
v-support vector classier machine (Fv-SVCM) is proposed. A fault diagnosis method based on Fv-SVCM
andits relevant parameter-choosing algorithmis put forward. The results of the application incar assembly
diagnosis conrmthe feasibility and the validity of the diagnosis method. Compared with the fuzzy neural
network (FNN) model, Fv-SVCM method requires fewer samples and has better estimating precision.
2010 Elsevier Ltd. All rights reserved.
1. Introduction
Since the maintenance has signicant impacts in car manufac-
turing industry, it has received a deep attention from the expert
and practical maintenance. According to study, maintenance costs
are a major part of the total operating costs of all manufacturing
and production plants, which can make or break a business.
Depending on the specic industry, maintenance costs can repre-
sent from 15% to 40% of the costs of goods produced. In fact, these
costs are associated with maintenance labour and materials and
are likely to go even higher in the future with the addition of fac-
tory automation through the development of new technologies.
Nowadays, the development of maintenance strategy is sup-
ported by computer technology both in hardware and software.
A recent developed method is using articial intelligent (AI) tech-
niques as tool for maintenance routine. Based on the idea perform-
ing an excellent and easy maintenance program; it leads the
practical maintenance to create an intelligent maintenance system.
Intelligent maintenance consists of parts (hardware and software),
which are possible for the system to do maintenance routine in
such a way like human being. Application of expert system (ES)
as a branch of AI in maintenance is one of solution. The basic idea
of ES is simply that expertise, which is the vast body of task-spe-
cic knowledge, is transferred from a human to a computer. This
knowledge is then stored in the computer and users call upon
the computer for specic advice as needed. The computer can
make inferences and arrive at a specic conclusion. Then, like hu-
man consultant, it gives advice and explains, if necessary, the logic
behind the advice (Demetgul, Tansel, & Taskin, 2009; Wu & Liu,
2009).
Support vector machine (SVM) is a relatively new computa-
tional learning method based on the statistical learning theory
and can serve as ES. Some seminal papers introduced below to
show the development of SVM that originally came from statistical
learning theory (SLT) developed by Vapnik (1995). SVM is based on
VapnikChervonenkis theory (VC-theory) that recently emerged as
a general mathematical framework for estimating (learning)
dependencies from nite samples. This theory combines funda-
mental concepts and principles related to learning, well-dened
formulation, and self-consistent mathematical theory. Moreover,
conceptual framework of VC-theory can be used for improved
understanding various learning method developed in statistics,
neural networks, fuzzy systems, signal processing, etc. A major
conceptual contribution of VC-theory is revisiting the problem
statement appropriate for modern learning method that makes a
clear distinction between the problem formulation and solution
approach used to solve the problem.
As time goes by, SVM becomes famous and popular in machine
learning community due to the excellence of generalization ability
than the traditional method such as neural network. Therefore,
SVM have been successfully applied to a number of applications
ranging from face detection, verication, and recognition, object
detection and recognition, handwritten character and digit recogni-
tion, text detection and categorization, speech and speaker verica-
tion, recognition, information and image retrieval, prediction and so
on Widodo and Yang (2007a, 2007b), Yang, Zhang, and Zhu (2007),
Yuan and Chu (2007), Fei, Miao, and Liu (2009), Xiang, Zhou, An,
Peng, and Yang (2008), Widodo and Yang (2008), Camci and Chin-
nam (2008), Juang, Sun, and Chen (2009), Hotta (2008), Wu (2010),
Wu (2009, 2003), Wu and Law (2010), Li, Lord, Zhang, and Xie
0957-4174/$ - see front matter 2010 Elsevier Ltd. All rights reserved.
doi:10.1016/j.eswa.2010.07.052

Tel.: +86 25 51166581; fax: +86 25 511665260.


E-mail addresses: wuqivr@hotmail.com, hmwuqi@polyu.edu.hk
Expert Systems with Applications 38 (2011) 14571463
Contents lists available at ScienceDirect
Expert Systems with Applications
j our nal homepage: www. el sevi er . com/ l ocat e/ eswa
(2008), Zhang and Randall (2009). However, papers discussing the
use of SVM in automatic car assembly fault diagnosis are few.
In automatic car assembly fault diagnosis problem, SVM is em-
ployed for recognizing special patterns from acquired signal, and
then these patterns are classied according to the fault occurrence
in the machine. After signal acquisition, a feature representation
method can be performed to dene the features, e.g., statistical fea-
ture of signal for classication purposes. These features can be con-
sidered as patterns that should be recognized using SVM.
Meantime, SVM can solve the learning problem with a small
number of samples. Due to the fact that it is hard to obtain sufcient
fault samples in practice, SVM is introduced into automatic car
assembly fault diagnosis due to its high accuracy and good general-
ization for a smaller number of samples. Moreover, some potential
inuencing factors are fuzzy and uncertain in automatic car assem-
bly fault diagnosis. The standard SVM is hard to handle the fuzzy
sample set. Therefore, a new fuzzy SVM should be explored.
By combining the fuzzy theory with support vector machine,
here we put forward a new fuzzy SVCM, called Fv-SVCM, short
for fuzzy v-support vector classier machine. Based on the Fv-
SVCM, a diagnosing method for car assembly is proposed. The rest
of the study is organized as follows. Fv-SVCM is proposed in Sec-
tion 2. A modied genetic algorithm is also proposed to seek the
optimal unknown parameters of the Fv-SVCM model in Section 3.
Section 4 gives the diagnosing algorithms and steps based on the
Fv-SVCM model and the modied GA. Section 5 presents the sim-
ulation results. The nal conclusion is drawn in Section 6.
2. Fuzzy support vector classier machine
2.1. Preliminary denitions
Denition 1. Suppose M 2 T(R) is triangular fuzzy number (TFN) in
triangular fuzzy space, whose membership function is represented
as follows:
l
M
x
xa
M
r
M
a
M
; a
M
6 x < r
M
1; x r
M
xb
M
r
M
b
M
; r
M
6 x < b
M
_

_
1
where a
M
6 r
M
< b
M
, a
M
, r
M
, b
M
2 R, a
M
6 x < b
M
, x 2 R. Then we have
the formulation M = (a
M
, r
M
, b
M
) in which r
M
is the center, a
M
is the
left boundary and b
M
is the right boundary.
The standard triangular fuzzy number is difcult to deal with
input variable of SVM, the extended version of Denition 1 is con-
sidered and described as following:
Denition 2. a r
2
; Dr; Dr is extended triangular fuzzy number
(ETFN) in which r
2
2 R is the center, Dr = r
2
r
1
is the left spread
and Dr r
3
r
2
is the right spread, where Dr > 0 and Dr > 0.
Let A r
A
; Dr
A
; Dr
A
and B r
B
; Dr
B
; Dr
B
be two ETFNs, whose
k-cuts are shown in Fig. 1. In the space T(R) of all ETFNs, we dene
linear operations by the extension principle: A B r
A

r
B
; maxDr
A
; Dr
B
; maxDr
A
; Dr
B
; kA kr
A
; Dr
A
; Dr
A
if k P0; kA
kr
A
; Dr
A
; Dr
A
if k < 0, and ABr
A
r
B
; maxDr
A
; Dr
B
;
maxDr
A
; Dr
B
.
k-Cut of A can be labelled as A
k
Ak; Ak for k 2 [0, 1], where
A(k) and Ak are two boundaries of the k-cut, as shown in Fig. 1.
The k-cut of a fuzzy number is always a closed and bounded
interval. By the Hausdorff distance of real numbers, we can dene
a metric in T(R) as
DA; B sup
k
maxfjAk Bkj; jAk Bkjg 2
where A
k
Ak; Ak and B
k
Bk; Bk are k-cuts of two fuzzy
numbers.
Theorem 1. In T(R), the Hausdorff metric can be obtained as follows:
DA; B max jr
A
Dr
A
r
B
Dr
B
j; jr
A
r
B
j; jr
A
Dr
A
r
B
Dr
B
j
_ _
3
Proof. The lower boundary of the k-cut of A meets the following
formula
k
Ak r
A
Dr
A

Dr
A
: 4
Then we have A(k) = r
A
+ (k 1)Dr
A
. In the same way, we can obtain
Ak r
A
1 kDr
A
, B(k) = r
B
+ (k 1)Dr
B
and Bk r
B
1
kDr
B
. According to the denition of Eq. (2), we get
DA; B sup
k
max jr
A
r
B
k1Dr
A
Dr
B
j; jr
A
r
B
f
1kDr
A
Dr
B
j
_
max sup
k
jr
A
r
B
k1Dr
A
Dr
B
j; sup
k
jr
A
r
B

_
1kDr
A
Dr
B
j
_
5
For the given triangular fuzzy numbers A and B, (r
A
r
B
) + (k 1)(-
Dr
A
Dr
B
) and r
A
r
B
1 kDr
A
Dr
B
are two linear func-
tions of k. As k 2 [0, 1], the following formulas must hold:
sup
k
jr
A
r
B
k 1Dr
A
Dr
B
j maxfjr
A
Dr
A

r
B
Dr
B
j; jr
A
r
B
jg 6
sup
k
jr
A
r
B
1 kDr
A
Dr
B
j maxfjr
A
Dr
A

r
B
Dr
B
j; jr
A
r
B
jg 7
Substituting (6) and (7) into (5), we can obtain Eq. (3). This com-
pletes the proof of Theorem 1. h
Deduction 1. If A and B are two symmetric triangular fuzzy num-
bers in T(R), where A = (r
A
, Dr
A
) and B = (r
B
, Dr
B
), then the Hausdorff
metric of A and B can be written as
DA; B max jr
A
Dr
A
r
B
Dr
B
j; jr
A
Dr
A
r
B
Dr
B
j f g 8
Proof. For symmetric triangular fuzzy numbers A and B, we have
Dr
A
Dr
A
and Dr
B
Dr
B
. From Theorem 1, the following formulas
must hold:
DA; B maxfjr
A
Dr
A
r
B
Dr
B
j; jr
A
r
B
j;
jr
A
Dr
A
r
B
Dr
B
jg
maxfjr
A
r
B
Dr
A
Dr
B
j; jr
A
r
B
j;
jr
A
r
B
Dr
A
Dr
B
jg
maxfjr
A
r
B
Dr
A
Dr
B
j;
jr
A
r
B
Dr
A
Dr
B
jg
maxfjr
A
Dr
A
r
B
Dr
B
j; jr
A
Dr
A
r
B
Dr
B
jg 9
This completes the proof of Deduction 1. h
Fig. 1. The k-cuts of two triangular fuzzy numbers.
1458 Q. Wu/ Expert Systems with Applications 38 (2011) 14571463
2.2. Fuzzy support vector classier machine
Suppose a set of fuzzy training samples fx
i
; y
i
g
l
i1
, where
x
i
2 T(R)
d
and y
i
2 T(R). T(R)
d
is the set of d dimensional vectors of
ETFNs. For computational simplicity, only symmetric triangular
fuzzy numbers are taken into account, i.e. x
i
r
x
i
; Dr
x
i
and
y
i
r
y
i
; Dr
y
i
, where Dr
x
i
Dr
x
i
; r
y
i
Dr
y
i
.
We consider the approximation function f(x) = sgn(wx + b),
where w = (w
1
, w
2
, . . . , w
n
), and wx denotes an inner product of w
and x. In T(R), f(x) can be written as
f x sgnw r
x
b; qDr
x
; w 2 R
d
; b 2 R 10
where qDr
x
maxDr
x
1
; Dr
x
2
; . . . ; Dr
x
d
.
Then, the fuzzy v-support vector classier machine (Fv-SVCM),
whose e-insensitive tube and architecture are illuminated in Figs. 2
and 3, respectively, solves the following quadratic programming
problem:
min
w;n;q;b
sw; n; q; e
1
2
kwk
2
vq
1
l

2
k1

l
i1
n
ki
s:t:
r
y
i
w r
x
i
b Pq n
1i
Dr
y
i
w Dr
x
i
b Pq n
2i
n
ki
P0; q P0
_

_
11
where a
ki
are the Lagrange multiplies associated with the constrains
of Eq. (11). v 2 (0, 1] is an adjustable parameter. Parameter q ap-
pears as the variable of optimal problem.
Problem (11) is a quadratic programming (QP) problem. By
introducing Lagrangian multipliers, a Lagrangian function can be
dened as follows:
Lw; b; a; b; n; q; d
1
2
kwk
2
vq
1
l

2
k1

l
i1
n
ki

l
i1
a
1i
r
y
i
w r
x
i
b
Pqn
1i
bn
1i

l
i1
a
2i
Dr
y
i
w Dr
x
i
b
Pqn
2i
bn
2i
dq 12
where a a
11
; . . . ; a
1l
; a
21
; . . . ; a
2l

T
2 R
l

; b b
1
; . . . ; b
l

T
2 R
l

;
d > 0 are Lagrangian multipliers. Differentiating the Lagrangian
function (11) with respect to w, b, q, n, we have
r
w
Lw; b; q; n 0 ) w

2
k1

l
i1
a
ki
r
y
i
/r
x
i

r
b
Lw; b; q; n 0 )

2
k1

l
i1
a
ki
r
y
i
0
r
q
Lw; b; q; n 0 ) v

2
k1

l
i1
a
ki
d 0
r
n
Lw; b; q; n 0 )

2
k1

l
i1
a
ki
b
i

1
l
_

_
13
By substituting Eq. (13) into Eq. (12), we can obtain the corre-
sponding dual form of function (11) as follows:
max
a;a

Wa


1
2

l
i;j1
r
y
i
Dr
y
i
qDr
x
i
r
y
j
Dr
y
j
qDr
x
j

a
1i
a
1j
KDr
x
i
Dr
x
j

1
2

l
i;j1
r
y
i
Dr
y
i
qDr
x
i

_ _
r
y
j
Dr
y
j
qDr
x
j

_ _
a
2i
a
2j
KDr
x
i
Dr
x
j

s:t:

2
k1

l
i1
a
ki
r
y
i
0
0 6 a
ki
6
1
l

2
k1

l
i1
a
ki
Pv
_

_
14
Selecting the appropriate v and K(x, x
0
), we can construct and
solve the optimal problem(14) by QP method to obtain the optimal
solution a

1
; . . . ; a

l

T
.
Select
j 2 S

i a

i
2 0; 1=l; y
i
1

_ _
; k 2 S

ija

i
2 0; 1=l; y
i
1
_ _
,
then we have
b
1
2

l
i1
a
1i
r
y
i
Dr
y
i
q Dr
x
i
_ _ _ _
K Dr
x
i
Dr
x
j
_ _
K Dr
x
i
Dr
x
k
_ _
_ _

1
2

l
i1
a
2i
r
y
i
Dr
y
i
q Dr
x
i
_ _ _ _
K Dr
x
i
Dr
x
j
_ _
K Dr
x
i
Dr
x
k
_ _
_ _
15
The relation between x and f(x) of the FvSVCM is described as
follows
f x sgn

2
k1

l
i1
a
ki
a

ki
r
y
i
Dr
y
i
qDr
x
i

_ _
Kr
x
i
r
x
b; qDr
x

_ _ _ _
16
Fig. 2. The e-insensitive tube of Fv-SVCM.
Fig. 3. The architecture of Fv-SVCM.
Q. Wu/ Expert Systems with Applications 38 (2011) 14571463 1459
Well-known kernel functions are Kx
i
; x
j
x
0
i
x
j
(linear), Kx
i
; x
j

cx
0
i
x
j
r
_ _
d
; c > 0 (polynomial), K(x
i
, x
j
) = exp (ckx
i
x
j
k
2
), c > 0
(radial basis function), and Kx
i
; x
j
tanhcx
0
i
x
j
r (sigmoid).
The radial kernel is a popular choice in the SVM literature.
3. The modied genetic algorithm
Genetic algorithm (GA) is a stochastic global search technique
that solves problems by imitating processes during natural
evolution. Based on the survival and reproduction of the tness,
GA continually exploits new and better solutions without any
pre-assumptions, such as continuity and unimodality. GA has been
successfully applied to many complex optimization problems and
shows its merits over traditional optimization methods, especially
when the system under study has multiple optimum solutions
(Huang, Chen, Wu, & Huang, 2009; Samanta, 2004). GA evolves a
population of candidate solutions. Each solution is represented
by a chromosome that is usually coded as a binary string. The t-
ness of each chromosome is then evaluated using a performance
function after the chromosome has been decoded. Upon comple-
tion of the evaluation, a biased roulette wheel is used to randomly
select pairs of chromosomes and to undergo genetic operations
that mimic natural phenomena observed in nature (such as cross-
over and mutation). This evolution process continues until the
stopping criteria are reached. A real-coded GA proposed in this
experiment is a genetic algorithm representation that uses a vector
of oating-point numbers to encode the chromosome. The cross-
over operator of a real-coded GA is performed by borrowing the
concept of convex combination of vectors. The mutation operator
proposed for real-coded GA is to change the gene with some prob-
ability in the problems domain. With some modications of genet-
ic operators, real-coded GA has resulted in better performance than
binary coded GA for continuous problems.
GA differs from conventional nonlinear optimization techniques
in that it searches by maintaining a population (or data base) of
solutions from which better solutions are created rather than mak-
ing incremental changes to a single solution to the problem. GA
simultaneously possesses a large number of candidate solutions
to a problem, called a population. The key feature of GA is the
manipulation of a population whose individuals are characterized
by possessing a chromosome.
Two important issues in GA are the genetic coding used to de-
ne the problem and the evaluation function, called tness func-
tion. Each individual solution in GA is represented by a string
called chromosome. The initial solution population is generated
randomly, which evolves into the next generation by genetic oper-
ators such as selection, crossover and mutation. The solutions
coded by strings are evaluated by the tness function. The selec-
tion operator allows strings with higher tness to appear with
higher probability in the next generation. Crossover is performed
between two selected individuals, called parents, by exchanging
parts of their strings, starting from a randomly chosen crossover
point. This operator tends to enable the evolutionary process to
move toward promising regions of the search space. Mutation is
used to search for further problem space and to avoid local conver-
gence of GA.
It is difcult to nd the optimal parameters of Eq. (14) by the
simple GA when fault pattern with multi-dimension, small sam-
ples and nonlinearity are used as the training set. Some improve-
ments on the simple GA are presented below:
3.1. Niching technique
A niching technique-simple sub-population scheme and deter-
ministic crowding are included in this review. In simple sub-pop-
ulation scheme, the population is divided into sub-populations,
in each of which an individual in each sub-population can only per-
form mating with other individuals from the same sub-population.
Each individual will be tagged or labelled to indicate which sub-
population it belongs to. In this case, evolution strategy is sharing.
The optimal solutions are treated as resources. Overcrowding on
one particular optimal solution implies that the resource is over-
used. In this case, the perceived tness of that solution will de-
crease. On the other hand, if a few individuals are concentrated
on one solution, that resource is underused. The perceived tness
of that solution will increase. This is a modication to the internal
structure of genetic algorithm. It is a change in the perception of
genetic algorithm to the objective function, but not the objective
function itself.
Crowding method is a method for maintaining sub-populations
in genetic algorithm at different niches in multimodal tness land-
scape. In crowding method, a small set of parents is selected from
the population. Each child will replace an individual from this set
which is most similar to itself. In this method, stochastic replace-
ment errors prevent the algorithm from locating all niches. In
deterministic crowding, the children compete against their parents
for inclusion in the newgeneration. Unlike general crowding meth-
od, all parents have to participate in the competition. In determin-
istic crowding, similarity between children and parents can be
measured using either genotypic or phenotypic distance.
3.2. The tness assignment based on linear ranking
To distinguish the excellent chromosomes, the mapping rela-
tion is established among the objective function, chromosome po-
sition and tness value. The chromosomes are arranged by
descending order of objective function values. The excellent chro-
mosomes are sent into sub-population with a niching technique
according to this tness ranking rule: the chromosome with a big-
ger objective function value arranged in the front position has les-
ser tness value, while the chromosomes with lesser tness value
are inferior. Then, the chromosome with the least tness value is
arranged in the rst position of objective function value rank.
The most excellent chromosome is arranged in the last position
of objective function value ranking. The tness value of each chro-
mosome is determined by its position in the ranked population.
The computing formulation of tness value is
FitnV 2 sp 2 sp 1
Pos 1
Pop size 1
17
where sp is assigned press difference, Pos the position of chromo-
some, and Pop_size the population size. FitnV 2 [1, 2].
3.3. Selection
The population of the next generation is rst formed by means
of a probabilistic reproduction process. In general, there are two
types of reproduction processes: generational reproduction and
steady-state reproduction. Generational reproduction replaces
the entire population with a new one. In contrast, steady-state
reproduction replaces only a few individuals in a generation.
Whichever type of reproduction is used, individuals with higher
tness usually have a greater chance of contributing to the gener-
ation of offspring. Several selection methods may be used to deter-
mine the tness of an individual. The hybrid selection based on the
proportional selection and ranking is employed for the selection
schemes in the proposed GA in this paper. Then, the excellent chro-
mosomes controlled by parameter sub_n 2 (0, 1] are sent into sub-
population by a niching technique. The selected probability (P(x
i
))
of the ith chromosome x
i
is
1460 Q. Wu/ Expert Systems with Applications 38 (2011) 14571463
Px
i

f x
i

Pop size
i1
f x
i

18
where Pop_size denotes the size of population, and f(x
i
) the tness
function of chromosome x
i
.
The above resultant population is sometimes called the inter-
mediate population with a niching technique.
3.4. Mutation
The intermediate population is processed by using crossover
and mutation to form the next generation. To secure the excellent
chromosome, some additional measures are taken as follows: the
inferior chromosomes of the latest generation population are
substituted by the excellent ones of intermediate population via
the substituting probability (substitute_P) to form the next genera-
tion population.
4. The forecasting algorithms and steps
GA is considered as an excellent technique to solve the combi-
natorial optimization problems. The modied GA is also a random
search method, which is based on the concept of natural selection
and a niching technique operator. It starts with an initial popula-
tion and then applies a mixture of reproduction, crossover, and
mutation to create new and hopefully better populations.
The steps of the modied GA are listed below:
Algorithm 1: The modied genetic algorithm
Step 1: Data preparation: Training and testing sets are repre-
sented as Tr and Te respectively.
Step 2: gen = 0.
Step 3: Initialize the parameters: the crossover probability (P
c
),
mutation probability (P
m
), pressure difference (sp), size
of population (Pop_size), maximal genetic generation
(Max_gen), iterative variable (gen), rst generation popula-
tion Chrom(gen), child generation population with niching
technique (SelCh(gen + 1)), niching coefcient (sub_n) con-
trolling excellent chromosomes into SelCh(gen + 1), opti-
mal tness of objective function (ObjV), and current
mutation substituting probability (substitute_P).
Step 4: Compute the objective function, evaluate the tness and
obtain the global optimal tness.
Step 5: If the global optimal tness value meets the limitation of
accuracy, or Algorithm 1 has been carried out for many
generations and the optimal tness value has not changed
obviously, then go to Step 9 otherwise go to the next Step.
Step 6: gen = gen + 1.
Step 7: Send the excellent chromosomes in Chrom(gen 1) into
the current child generation population SelCh(gen) by
parameter sub_n. Perform crossover and mutation opera-
tion. The size of the obtained new population New_Sel-
Ch(gen) is less than that of the latest generation
population Chrom(gen 1).
Step 8: Substitute the optimal chromosomes (whose number is
equal to the product of substitute_P and the size of
New_SelCh(gen)) from population New_SelCh(gen) for infe-
rior chromosomes in population Chrom(gen 1) to form
population Chrom(gen). The current generation population
Chrom(gen) has the same size as the last generation popu-
lation Chrom(gen 1). Then go to Step 4.
Step 9: End the training procedure, and output the optimal
chromosome.
The steps of the fault diagnosis method based on Fv-SVCM are
described as follows:
Step 1: Initialize the original data by fuzzication and normaliza-
tion, and then form training and testing sample set.
Step 2: Select the kernel function K(x, x
0
), call Algorithm 1 and get
the optimal parameters. Construct the QP problem (14) of
the Fv-SVCM.
Step 3: Solve the optimization problem (14) and obtain the
parameters a
ki
.
Step 4: For a new diagnosing task, extract fault factors and form a
set of input variables x. Then compute the diagnosing
results by Eq. (16).
5. Experiment
To analyze the performance of the Fv-SVCM model, the fault
diagnosis of car assembly line is studied. The car assembly line is
a type of fuzzy fault system inuenced by manufacture equip-
ments and some state factors of production environment in manu-
facturing system and its diagnosis action is usually driven by many
uncertain factors. In our experiments, car assembly line pattern are
selected from past production record in a typical company. The de-
tailed characteristic data and fault pattern series of the car assem-
bly line compose the corresponding training and testing sample
sets. During the process of the car assembly line fault diagnosis,
eight inuencing factors, viz., numerical information: oscillating
signal from machines (A, B, D, E, H), linguistic information (C, F
and G) are taken into account. In fact, all the numerical variables
Table 1
Sample set of fault diagnosis.
No. A B C D E F G H Membership
1 0.4966 0.4154 0.89 0.8121 0.3603 0.82 0.59 0.0743 0.89(+)
2 0.8998 0.305 0.45 0.6101 0.5485 0.16 0.94 0.1932 0.94(+)
3 0.8216 0.8744 0.71 0.7015 0.2618 0.39 0.28 0.3796 0.33()
4 0.6449 0.015 0.12 0.0922 0.5973 0.52 0.88 0.2764 0.43()
5 0.818 0.768 0.27 0.4249 0.0493 0.71 0.10 0.7709 0.47()
6 0.6602 0.9708 0.25 0.3756 0.5711 0.56 0.06 0.3139 0.14()
7 0.342 0.9901 0.86 0.1662 0.7009 0.46 0.23 0.6382 0.13()
8 0.2897 0.7889 0.23 0.8332 0.9623 0.44 0.93 0.9866 0.53(+)
9 0.3412 0.4387 0.80 0.8386 0.7505 0.08 0.06 0.5029 0.72(+)
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
56 0.5678 0.6756 0.45 0.9862 0.1614 0.11 0.51 0.7157 0.17()
57 0.7942 0.6992 0.45 0.4733 0.8295 0.76 0.45 0.2507 0.02(+)
58 0.0592 0.7275 0.41 0.9028 0.9561 0.37 0.70 0.9339 0.79()
59 0.6029 0.4784 0.90 0.4511 0.5955 0.82 0.58 0.1372 0.51(+)
60 0.0503 0.5548 0.06 0.8045 0.0287 0.04 0.50 0.5216 0.21(+)
Q. Wu/ Expert Systems with Applications 38 (2011) 14571463 1461
from (1) through (17) are the normalized values although they are
not marked by bars. The fault sample is shown in Table 1.
The Fv-SVCM has been implemented in Matlab 7.1 program-
ming language. The experiments are made on a 1.80 GHz Core
(TM) 2 CPU personal computer (PC) with 1.0 G memory under
Microsoft Windows XP professional. The initial parameters of Fv-
SVCM are Max_gen = 100, Max_cgen = 100, Pop_size = 80, Chaos_-
Pop_size = 80, sub_n = 0.9, P
c
= 0.9, P
m
= 0.1, substitute_P = 0.9,
sp = 0.2, C 2 [0.01, 100], v 2 [0.01, 1], and r 2 [0.01, 1]. Gaussian ra-
dial basis function can be ascertained as a kernel function of the
Fv-SVCM model, two parameters also are determined as follows:
v 2 [0, 1] and r 2 (0, 1]. The optimal combinational parameters
are obtained by the modied GA, viz., v = 0.97 and r = 0.84. The
change trend of the tness function is shown in Fig. 4. It is obvious
that the proposed GA is convergent.
To analyze the diagnosing capacity of the Fv-SVCM model, stan-
dard v-SVCM model and fuzzy neural network (FNN) model are se-
lected to handle the above car assembly line pattern. For standard
v-SVCM model and fuzzy neural network (FNN) model, center of
triangular fuzzy numbers of original sample is used as the sample
data. To analyze the error trend well, the diagnosing results of the
latest 10 pattern points are used to analyze the diagnosis perfor-
mance of the above models. Their diagnosing results are shown
in Tables 2 and 3. The diagnosing precision of Fv-SVCMis the better
than that of standard v-SVCM and FNN.
In the Fv-SVCM model, the most diagnosis error is 0.02 (No. 6),
and the least diagnosis error is 0 (No. 10). In the v-SVCM model, the
most diagnosis error is 0.03 (No. 2), and the least diagnosis error is
0 (No. 10). In the FNN model, the most diagnosis error is 0.05 (Nos.
2 and 4), and the least diagnosis error is 0.02 (Nos. 6, 8, 9 and 10).
Diagnosing errors of the latest 10 pattern points from the above
three models are shown in Table 3. Considering the enterprise
manufacturing environment, some errors exist inevitably in the
process of data gather and estimation. Thus, the above diagnosing
results are satisfying. The results of application in car assembly line
indicate that the diagnosing method based on Fv-SVCM is effective
and feasible.
For analyzing the diagnosing capability of the proposed model,
the comparison among different diagnosing approaches is shown
in Table 4. The classier indexes are adopted as follows: one-
class-error ratio (the negative class is judged into positive class),
two-class-error ratio (the positive class is judged into negative
class). It is obvious that the classier indexes of Fv-SVCM are better
than that of v-SVCM and FNN. The result show that the proposed
model based on Fv-SVCM is effective and feasible.
It is obvious that the left and right parts of triangular fuzzy
number can represent the uncertain information part of expert
knowledge. For ordinary fuzzy SVRM, the all fuzzy information is
transformed into a crisp number or membership, the diagnosing
analysis is based on the dealt sample set with crisp numbers. The
major novelty of the present work is that the inputs and outputs
are described by triangular fuzzy numbers, and hence it allows a
more effective description of diagnosing system involving uncer-
tainties. Additionally, the parameters pertaining in formulation
are determined via GA-based search. Compared with ordinary
SVRM, the proposed model, whose constraint conditions of the
proposed model are three times that of standard SVRM, establishes
the optimal problem based on the left, middle and right of triangu-
lar fuzzy number respectively. In a word, the uncertain information
is considered into the establishment of the novel Fv-SVCM, as is
suitable to complex nonlinear fuzzy diagnosing problems with
uncertain inuencing factors.
6. Conclusion
In this paper, a new version of SVM, named Fv-SVCM, is pro-
posed to establish the nonlinear diagnosing system of car assembly
line. The Fv-SVCM model can handle fuzzy fault pattern and pro-
Fig. 4. The change trend of the tness function.
Table 2
The diagnosis results from the latest 10 pattern points.
No. Actual membership Actual pattern FNN Predicting pattern v-SVCM Predicting pattern Fv-SVCM Predicting pattern
1 0.77 1 0.73 1 0.75 1 0.76 1
2 0.37 +1 0.42 1 0.40 +1 0.38 +1
3 0.44 1 0.41 1 0.46 1 0.45 1
4 0.48 1 0.53 +1 0.47 1 0.475 1
5 0.6 +1 0.56 1 0.58 +1 0.59 +1
6 0.17 1 0.15 1 0.18 1 0.19 1
7 0.02 +1 0.017 1 0.024 +1 0.021 +1
8 0.79 1 0.81 1 0.77 1 0.785 1
9 0.51 +1 0.49 1 0.49 1 0.50 +1
10 0.21 +1 0.23 1 0.21 1 0.21 +1
Table 3
Diagnosing error of the latest 10 pattern points.
Model 1 2 3 4 5 6 7 8 9 10
FNN 0.04 0.05 0.03 0.05 0.04 0.02 0.03 0.02 0.02 0.02
v-SVC 0.02 0.03 0.02 0.01 0.02 0.01 0.004 0.02 0.02 0
Fv-SVCM 0.01 0.01 0.01 0.005 0.01 0.02 0.001 0.005 0.01 0
Table 4
Precision analysis of fault diagnosis
Model OCER (%) TCER (%) ER (%)
FNN 10 10 20
v-SVC 10 0 10
Fv-SVCM 0 0 0
Note: OCER: one-class-error ratio; TCER: two-class-error ratio; ER: error ratio.
1462 Q. Wu/ Expert Systems with Applications 38 (2011) 14571463
vide better classier precision, compared with fuzzy neural net-
work. Therefore, the Fv-SVCM, which can deal with fault diagnosis
with fuzzy input variables effectively, extends the application
scope of support vector classier machine.
The performance of the Fv-SVCM is evaluated using the fault
pattern of car assembly line, and the simulation results demon-
strate that the Fv-SVCM is effective in handling uncertain data
and nite samples. Moreover, it is shown that the modied GA pre-
sented here is available for the Fv-SVCM to seek optimized
parameters.
Acknowledgements
This research was partly supported by the National Natural Sci-
ence Foundation of China under Grant 60904043, a research grant
funded by the Hong Kong Polytechnic University, China Postdoc-
toral Science Foundation (20090451152), Jiangsu Planned Projects
for Postdoctoral Research Funds (0901023C) and Southeast Univer-
sity Planned Projects for Postdoctoral Research Funds.
References
Camci, F., & Chinnam, R. B. (2008). General support vector representation machine
for one-class classication of non-stationary classes. Pattern Recognition, 41(10),
30213034.
Demetgul, M., Tansel, I. N., & Taskin, S. (2009). Fault diagnosis of pneumatic systems
with articial neural network algorithms. Expert Systems with Applications,
36(7), 1051210519.
Fei, S. W., Miao, Y. B., & Liu, C. L. (2009). Fault diagnosis of power transformer based
on support vector machine with genetic algorithm. Expert Systems with
Applications, 36(8), 1135211357.
Hotta, K. (2008). Robust face recognition under partial occlusion based on support
vector machine with local Gaussian summation kernel. Image and Vision
Computing, 26(11), 14901498.
Huang, C. J., Chen, Y. J., Wu, C. F., & Huang, Y. A. (2009). Application of neural
networks and genetic algorithms to the screening for high quality chips. Applied
Soft Computing, 9(2), 824832.
Juang, C. F., Sun, W. K., & Chen, G. C. (2009). Object detection by color histogram-
based fuzzy classier with support vector learning. Neurocomputing, 72(1012),
24642476.
Li, X., Lord, D., Zhang, Y., & Xie, Y. (2008). Predicting motor vehicle crashes using
support vector machine models. Accident Analysis & Prevention, 40, 16111618.
Samanta, B. (2004). Articial neural networks and genetic algorithms for gear fault
detection. Mechanical Systems and Signal Processing, 18(5), 12731282.
Thissen, U., Brakel, R., Weijer, A. P., Melssen, W. J., & Buydens, L. M. C. (2003). Using
support vector machines for time series prediction. Chemometrics and Intelligent
Laboratory Systems, 69, 3549.
Vapnik, V. (1995). The nature of statistical learning. New York: Springer.
Widodo, A., & Yang, B. S. (2007a). Support vector machine in machine condition
monitoring and fault diagnosis. Mechanical Systems and Signal Processing, 21(6),
25602574.
Widodo, A., & Yang, B. S. (2007b). Application of nonlinear feature extraction and
support vector machines for fault diagnosis of induction motors. Expert Systems
with Applications, 33(1), 241250.
Widodo, A., & Yang, B. S. (2008). Wavelet support vector machine for induction
machine fault diagnosis based on transient current signal. Expert Systems with
Applications, 35.
Wu, Q. (2009). The forecasting model based on wavelet v-support vector machine.
Expert Systems with Applications, 36(4), 76047610.
Wu, Q. (2010). A hybrid-forecasting model based on Gaussian support vector
machine and chaotic particle swarm optimization. Expert Systems with
Applications, 37(3), 23882394.
Wu, Q., & Law, R. (2010). Complex system fault diagnosis based on a fuzzy robust
wavelet support vector classier and an adaptive Gaussian particle swarm
optimization. Information Sciences, in press.
Wu, J. D., & Liu, C. H. (2009). An expert system for fault diagnosis in internal
combustion engines using wavelet packet transform and neural network. Expert
Systems with Applications, 36(3), 42784286.
Xiang, X., Zhou, J., An, X., Peng, B., & Yang, J. (2008). Fault diagnosis based on Walsh
transform and support vector machine. Mechanical Systems and Signal
Processing, 22(7), 16851693.
Yang, J., Zhang, Y., & Zhu, Y. (2007). Intelligent fault diagnosis of rolling element
bearing based on SVMs and fractal dimension. Mechanical Systems and Signal
Processing, 21(5), 20122024.
Yuan, S. F., & Chu, F. L. (2007). Fault diagnostics based on particle swarm
optimization and support vector machines. Mechanical Systems and Signal
Processing, 21(4), 17871798.
Zhang, Y., & Randall, R. B. (2009). Rolling element bearing fault diagnosis based on
the combination of genetic algorithms and fast kurtogram. Mechanical Systems
and Signal Processing, 23(5), 15091517.
Q. Wu/ Expert Systems with Applications 38 (2011) 14571463 1463

Potrebbero piacerti anche