# A Novel Classification Approach through Integration of Rough Sets and Back-Propagation Neural Network

Authors: Lei Si; Xin-hua Liu; Chao Tan; Zhong-bin Wang
Journal: Journal of Applied Mathematics
 (2014)

---

## Abstract

Classification is an important theme in data mining. Rough sets and neural networks are the most common techniques applied in data mining problems. In order to extract useful knowledge and classify ambiguous patterns effectively, this paper presented a hybrid algorithm based on the integration of rough sets and BP neural network to construct a novel classification system. The attribution values were discretized through PSO algorithm firstly to establish a decision table. The attribution reduction algorithm and rules extraction method based on rough sets were proposed, and the flowchart of proposed approach was designed. Finally, a prototype system was developed and some simulation examples were carried out. Simulation results indicated that the proposed approach was feasible and accurate and was outperforming others.


---

## Body

## 1. Introduction

Across a wide variety of fields, data are being accumulated at a dramatic pace, especially in the age of internet [1, 2]. There is much useful information hidden in the accumulated voluminous data, but it is very hard for us to obtain it. Thus, a new generation of computational tool is needed to assist humans in extracting knowledge and classifying the rapidly growing digital data; otherwise, these data are useless for us.Neural networks are applied in several engineering fields such as classification problems and pattern recognition. Artificial neural network in its most general form attempts to produce systems that work in a similar way to biological nervous systems. It has the ability to simulate human thinking and owns powerful function and incomparable superiority in terms of establishing nonlinear and experiential knowledge simulation models [3–6]. Back-propagation neural network (BP neural network for short) is the core of feed-forward networks and embodies the essence of artificial neural network. However, conventional BP algorithm has slow convergence rate, weak fault tolerance, and nonunique results. Although many improved strategies have been proposed, such as additional momentum method, adaptive learning method, elastic BP method, and conjugate gradient method [7–9], the problems above have still not been solved completely, especially when BP neural networks are applied in multidimensional and uncertain fields. Therefore, newer techniques must be coupled with neural networks to create more efficient and complex intelligent systems [10].In an effort to model vagueness, rough sets theory was proposed by Pawlak in 1982 [11, 12]. Its outstanding feature is not to need the specific relation description about some characteristics or attributes, but to determine the approximate region of existing problems and find out the inherent rules through the indiscernibility relations and indiscernibility classes. This theory has been successfully applied in many fields such as machine learning, data mining, data analysis, and expert systems [13, 14]. In the paper, rough sets theory and BP neural network are presented as an integrated method because they can discover patterns in ambiguous and imperfect data and provide tools for data analysis. The decision table is established reasonably through discretizing attribution values. The features of decision table are analyzed using rough sets and subsequently a classification model based on these features is built through integration of rough sets and BP neural network. Actually, this model uses the decision rules which are extracted by the algorithm based on value reduction for classification problems.The paper is structured as follows. Some related works are outlined based on literature in Section2. The basics of rough sets theory and BP neural network are presented in Section 3. The framework and key algorithms are proposed and the flowchart of the proposed approach is designed in Section 4. A simulation example and some comparisons are put forward to validate the proposed approach in Section 5. Our conclusions are summarized in Section 6.


## 2. Literature Review

In recent years, most of classifier architectures are mainly constructed based on artificial intelligence (AI) algorithms with the unceasing development and improvement of AI theory. In this section, we try to summarize some recent literatures which are relevant to the construction methods of classification system. Hassan et al. constructed a classifier based on neural networks and applied rough sets theory in attributes reduction to preprocess the training set of neural networks [15]. Berardi et al. proposed a principled approach to build and evaluate neural network classification models for the implementation of decision support system (DSS) and verified the optimization speed and classified samples accuracy [16]. In [17, 18], the architecture of neural network with fuzzy input was proposed to effectively improve the classification performance of neural network. Hu et al. presented a self-organized feature mapping neural network to reasonably determine the input parameters in pavement structure design [19]. In [20, 21], wavelet neural networks were applied in the construction of classification system and better prediction results were obtained. In [22, 23], a classifier in which improved particle warm algorithm was used to optimize the parameters of wavelet neural network was established and the application in nonlinear identification problems demonstrated its strong generalization capability. Sengur et al. described the usage of wavelet packet neural networks for texture classification problem and provided a wavelet packet feature extractor and a multilayer perceptron classifier [24]. Hassan presented a novel classifier architecture based on rough sets and dynamic scaling in connection with wavelet neural networks and the effectiveness was verified by the experiments [25].Although many approaches for the establishment of classification systems have been presented in above literatures, they have some common disadvantages summarized as follows. On one hand, the classification effect of signal neural network cannot be guaranteed when the networks are applied in multidimensional and uncertain fields. On the other hand, the combination method of rough sets and neural networks can only deal with classification and recognition problems that possess discretized dataset and cannot process the problems that contain continuous dataset.In this paper, a novel classification system based on the integration of rough sets and BP neural network is proposed. The attribution values are discretized through PSO and the decision table is constructed. The proposed model takes account of attributes reduction by discarding redundant attributes and a rule set is generated from the decision table. A simulation example and comparisons with other methods are carried out and the proposed approach is proved feasible and outperforming others.


## 3. Basic Theory

### 3.1. Rough Sets Theory

Fundamental to rough sets theory is the idea of an information systemIS
=
(
U
,
C
), which is essentially a finite data table consisting of different columns labeled by attributes and rows labeled by objects of interest, and entries of the table are attribute’s values. U is nonempty finite set of objects called a universe and C is a nonempty finite, where each c
∈
C is called condition attribute. In IS
=
(
U
,
C
), every B
⊆
C generates an indiscernibility relation Ind
(
B
) on U which can be defined as follows:
(1)
Ind
(
B
)
=
{
(
x
,
y
)
∈
U
×
U
:
b
(
x
)
=
b
(
y
)
,
∀
b
∈
B
}
.U
/
Ind
(
B
) is a partition of U by B. For all x
∈
U, the equivalence class of x in relation U
/
Ind
(
B
) can be defined as follows:
(2)
[
x
]
Ind
(
B
)
=
{
x
∈
U
:
b
(
y
)
=
b
(
x
)
,
∀
b
∈
B
}
.According toI, two crisp sets B
_
X and B
-
X called the lower and the upper approximation of the set of objects X can be defined as follows:
(3)
B
_
X
=
{
x
∈
U
:
[
x
]
Ind
(
B
)
⊆
U
}
,
B
-
X
=
{
x
∈
U
:
[
x
]
Ind
(
B
)
∩
X
≠
Φ
}
,
where [
x
]
Ind
(
B
) denotes the set of all equivalence classes of Ind
(
B
). B
_
X is the set of all objects from U which can be certainly classified as elements of X employing the set of attributes B.B
-
X is the set of objects of U which can be possibly classified as elements of X using the set of attributes B [25].Decision tableD
T
=
(
U
,
C
∪
D
) is a special form of an information system and the major feature is the distinguished attribute set D, where C
∩
D
=
Φ is called the decision attribute. Generally speaking, there is a certain degree of dependency between condition attribute and decision attribute, which can be defined as follows:
(4)
γ
C
(
D
)
=
PO
S
C
(
D
)
|
U
|
=
|
⋃
X
∈
U
/
D
C
_
X
|
|
U
|
,
where PO
S
C
(
D
) is referred to the C-positive region of D.Due to the relevance between condition attribute and decision attribute, not all condition attributes are necessary for decision attribute so as to introduce the attribute reduction which is a smaller set of attributes that can classify objects with the same discriminating capability as that of the original set. As well known, the reduct is not the only one [26, 27].When we want to determine the reduct of decision table, the significance degree of attributes is commonly used and can be defined as follows:(5)
sig
(
α
,
B
;
D
)
=
γ
{
α
∪
B
}
(
D
)
-
γ
B
(
D
)
,
where sig
(
α
,
B
;
D
) denotes the significance degree of attribute α to attribute B, relative to decision attribute D.For allR
∈
C, if POS
{
C
-
R
}
(
D
)
=
POS
C
(
D
), then R in C is superfluous for D. Otherwise, R in C is indispensable for D. The set composed of all attributes that are indispensable for D is called the core of C relative to D, namely, relative core CORE
D(C). This relative core cannot be removed from the system without a loss in the knowledge that can be derived from it.When determined, the relative core of decision table must be firstly judged whether it is the reduct ofC relative to D, namely, relative reduct. The judgment rules are shown as follows.If the nonempty subsetP of attribute set C satisfies the conditions: (
1
)  POS
P
(
D
)
=
POS
C
(
D
); (
2
)  ∀
R
⊆
P, POS
R
(
D
)
≠
POS
C
(
D
), then P is called a reduct of C relative to D, denoted as RED
D
(
C
).In addition, decision rules can be perceived as data patterns which represent the relationship between the attributes values of a classification system [11, 12]. The form of the decision rules can be shown as IF η THEN δ, where η is the conditional part of a rule set and it is a conjunction of selectors; δ is the decision part of attribute d
:
(
d
∈
D
) and it usually describes the class of decision attribution.


### 3.2. BP Neural Network

BP neural network (BP-NN) which is surely a back-propagating neural network belongs to the class of networks whose learning is supervised and the learning rules are provided by the training set to describe the network behavior. The topology structure of BP-NN can be shown in Figure1.Figure 1
The topology structure of BP-NN.In Figure1, input vector X
=
{
x
1
,
x
2
,
…
,
x
s
} is furnished by the condition attribution values of reduced decision table and output vector O
=
{
o
1
,
o
2
,
…
,
o
m
} is the prediction class of decision attribution. The output of hidden layer can be calculated as follows:
(6)
H
j
=
f
(
∑
i
=
1
s
ω
i
j
x
i
-
a
j
)
,
j
=
1,2
,
…
,
l
,
where ω
i
j is the connection weight between input and hidden layers; l is the number of hidden layer nodes; a
j is the threshold of hidden layer node j; f is the activation function of hidden layer and can be chosen as linear function or sigmoid function f
(
x
)
=
1
/
(
1
+
e
-
x
).The output of output layer can be calculated as follows:(7)
o
k
=
∑
j
=
1
l
H
j
ω
j
k
-
b
k
,
k
=
1,2
,
…
,
m
,
where ω
j
k is the connection weight between hidden and output layers; m is the number of output layer nodes; b
k is the threshold of output layer node k.The training of network parametersω
i
j, ω
j
k, a
j, and b
k would depend on the error value which can be calculated by the following equation:
(8)
e
k
=
Y
k
-
o
k
,
k
=
1
,
2
,
…
,
m
,
where o
k and Y
k are current and desired output values of the network, respectively. The weight values and thresholds of the network can be updated as follows:
(9)
ω
i
j
(
t
+
1
)
=
ω
i
j
(
t
)
+
ζ
(
t
)
H
j
(
1
-
H
j
)
x
i
∑
j
=
1
l
e
k
ω
j
k
,
ω
j
k
(
t
+
1
)
=
ω
j
k
(
t
)
+
ζ
(
t
)
H
j
e
k
,
a
j
(
t
+
1
)
=
a
j
(
t
)
+
ζ
(
t
)
H
j
(
1
-
H
j
)
x
i
∑
j
=
1
l
e
k
ω
j
k
,
b
k
(
t
+
1
)
=
b
k
(
t
)
+
e
k
,
where t is the current iteration times; ζ
(
t
) is the learning rate and the range is the interval of [
0
,
1
].The learning rate has great influence on the generalization effect of neural network. Larger learning rate would significantly modify the parameters of weight values and thresholds and increase the learning speed. But overlarge learning rate would produce larger fluctuations in the learning process, and excessively small learning rate would generate slower network convergence and stabilize the weight values and thresholds difficultly. Therefore, this paper presents the variable learning rate algorithm to solve the above problems, which can be described as follows:(10)
ζ
(
t
)
=
ζ
max
⁡
-
t
(
ζ
max
⁡
-
ζ
min
⁡
)
t
max
⁡
,
where ζ
max
⁡ and ζ
min
⁡ are the maximum and minimum of learning rate; t
max
⁡ is the number of maximum iterations.


## 3.1. Rough Sets Theory

Fundamental to rough sets theory is the idea of an information systemIS
=
(
U
,
C
), which is essentially a finite data table consisting of different columns labeled by attributes and rows labeled by objects of interest, and entries of the table are attribute’s values. U is nonempty finite set of objects called a universe and C is a nonempty finite, where each c
∈
C is called condition attribute. In IS
=
(
U
,
C
), every B
⊆
C generates an indiscernibility relation Ind
(
B
) on U which can be defined as follows:
(1)
Ind
(
B
)
=
{
(
x
,
y
)
∈
U
×
U
:
b
(
x
)
=
b
(
y
)
,
∀
b
∈
B
}
.U
/
Ind
(
B
) is a partition of U by B. For all x
∈
U, the equivalence class of x in relation U
/
Ind
(
B
) can be defined as follows:
(2)
[
x
]
Ind
(
B
)
=
{
x
∈
U
:
b
(
y
)
=
b
(
x
)
,
∀
b
∈
B
}
.According toI, two crisp sets B
_
X and B
-
X called the lower and the upper approximation of the set of objects X can be defined as follows:
(3)
B
_
X
=
{
x
∈
U
:
[
x
]
Ind
(
B
)
⊆
U
}
,
B
-
X
=
{
x
∈
U
:
[
x
]
Ind
(
B
)
∩
X
≠
Φ
}
,
where [
x
]
Ind
(
B
) denotes the set of all equivalence classes of Ind
(
B
). B
_
X is the set of all objects from U which can be certainly classified as elements of X employing the set of attributes B.B
-
X is the set of objects of U which can be possibly classified as elements of X using the set of attributes B [25].Decision tableD
T
=
(
U
,
C
∪
D
) is a special form of an information system and the major feature is the distinguished attribute set D, where C
∩
D
=
Φ is called the decision attribute. Generally speaking, there is a certain degree of dependency between condition attribute and decision attribute, which can be defined as follows:
(4)
γ
C
(
D
)
=
PO
S
C
(
D
)
|
U
|
=
|
⋃
X
∈
U
/
D
C
_
X
|
|
U
|
,
where PO
S
C
(
D
) is referred to the C-positive region of D.Due to the relevance between condition attribute and decision attribute, not all condition attributes are necessary for decision attribute so as to introduce the attribute reduction which is a smaller set of attributes that can classify objects with the same discriminating capability as that of the original set. As well known, the reduct is not the only one [26, 27].When we want to determine the reduct of decision table, the significance degree of attributes is commonly used and can be defined as follows:(5)
sig
(
α
,
B
;
D
)
=
γ
{
α
∪
B
}
(
D
)
-
γ
B
(
D
)
,
where sig
(
α
,
B
;
D
) denotes the significance degree of attribute α to attribute B, relative to decision attribute D.For allR
∈
C, if POS
{
C
-
R
}
(
D
)
=
POS
C
(
D
), then R in C is superfluous for D. Otherwise, R in C is indispensable for D. The set composed of all attributes that are indispensable for D is called the core of C relative to D, namely, relative core CORE
D(C). This relative core cannot be removed from the system without a loss in the knowledge that can be derived from it.When determined, the relative core of decision table must be firstly judged whether it is the reduct ofC relative to D, namely, relative reduct. The judgment rules are shown as follows.If the nonempty subsetP of attribute set C satisfies the conditions: (
1
)  POS
P
(
D
)
=
POS
C
(
D
); (
2
)  ∀
R
⊆
P, POS
R
(
D
)
≠
POS
C
(
D
), then P is called a reduct of C relative to D, denoted as RED
D
(
C
).In addition, decision rules can be perceived as data patterns which represent the relationship between the attributes values of a classification system [11, 12]. The form of the decision rules can be shown as IF η THEN δ, where η is the conditional part of a rule set and it is a conjunction of selectors; δ is the decision part of attribute d
:
(
d
∈
D
) and it usually describes the class of decision attribution.


## 3.2. BP Neural Network

BP neural network (BP-NN) which is surely a back-propagating neural network belongs to the class of networks whose learning is supervised and the learning rules are provided by the training set to describe the network behavior. The topology structure of BP-NN can be shown in Figure1.Figure 1
The topology structure of BP-NN.In Figure1, input vector X
=
{
x
1
,
x
2
,
…
,
x
s
} is furnished by the condition attribution values of reduced decision table and output vector O
=
{
o
1
,
o
2
,
…
,
o
m
} is the prediction class of decision attribution. The output of hidden layer can be calculated as follows:
(6)
H
j
=
f
(
∑
i
=
1
s
ω
i
j
x
i
-
a
j
)
,
j
=
1,2
,
…
,
l
,
where ω
i
j is the connection weight between input and hidden layers; l is the number of hidden layer nodes; a
j is the threshold of hidden layer node j; f is the activation function of hidden layer and can be chosen as linear function or sigmoid function f
(
x
)
=
1
/
(
1
+
e
-
x
).The output of output layer can be calculated as follows:(7)
o
k
=
∑
j
=
1
l
H
j
ω
j
k
-
b
k
,
k
=
1,2
,
…
,
m
,
where ω
j
k is the connection weight between hidden and output layers; m is the number of output layer nodes; b
k is the threshold of output layer node k.The training of network parametersω
i
j, ω
j
k, a
j, and b
k would depend on the error value which can be calculated by the following equation:
(8)
e
k
=
Y
k
-
o
k
,
k
=
1
,
2
,
…
,
m
,
where o
k and Y
k are current and desired output values of the network, respectively. The weight values and thresholds of the network can be updated as follows:
(9)
ω
i
j
(
t
+
1
)
=
ω
i
j
(
t
)
+
ζ
(
t
)
H
j
(
1
-
H
j
)
x
i
∑
j
=
1
l
e
k
ω
j
k
,
ω
j
k
(
t
+
1
)
=
ω
j
k
(
t
)
+
ζ
(
t
)
H
j
e
k
,
a
j
(
t
+
1
)
=
a
j
(
t
)
+
ζ
(
t
)
H
j
(
1
-
H
j
)
x
i
∑
j
=
1
l
e
k
ω
j
k
,
b
k
(
t
+
1
)
=
b
k
(
t
)
+
e
k
,
where t is the current iteration times; ζ
(
t
) is the learning rate and the range is the interval of [
0
,
1
].The learning rate has great influence on the generalization effect of neural network. Larger learning rate would significantly modify the parameters of weight values and thresholds and increase the learning speed. But overlarge learning rate would produce larger fluctuations in the learning process, and excessively small learning rate would generate slower network convergence and stabilize the weight values and thresholds difficultly. Therefore, this paper presents the variable learning rate algorithm to solve the above problems, which can be described as follows:(10)
ζ
(
t
)
=
ζ
max
⁡
-
t
(
ζ
max
⁡
-
ζ
min
⁡
)
t
max
⁡
,
where ζ
max
⁡ and ζ
min
⁡ are the maximum and minimum of learning rate; t
max
⁡ is the number of maximum iterations.


## 4. The Proposed Approach

This section tries to present a new approach aiming at connecting rough sets with BP neural network to establish a classification system. The section has five main parts and can be elaborated through the following subsections.


### 4.1. The System Construction Process

The construction process of classification system can be shown as follows.(1)
Preprocessing historical dataset to obtain the sample data is the application precondition of rough sets and BP neural network. In the process of preprocessing, the historical dataset would be discretized through PSO algorithm to construct the decision table.
(2)
Simplify the input of neural network including input dimension and training set number through the attribute reduction based on significance degree algorithm. Deleting the same row in the decision table can simplify the training samples and eliminating the superfluous column (condition attribute) can simplify the network input dimension number. Thus, reduce the decision table using some reduct or sum of several calculated reducts; that is, remove from the table attributes not belonging to the chosen reducts.
(3)
BP neural network integrated with rough sets is used to build the network over the reduced set of data. Decision rules are extracted from the reduced decision table as the basis of network structure through a value reduction algorithm of rough sets.
(4)
Perform network learning for parametersω
i
j, ω
j
k, a
j and b
k. Do this step until there is no significant change in the output of network and the system construction process can be shown as Figure 2.Figure 2
The system construction process.


### 4.2. The Discretization Algorithm for Decision Table

Due to the fact that rough sets theory cannot directly process continuous values of attributes, the decision table composed of continuous values must be discretized firstly. Thus, the positions of breakpoints must be selected appropriately to discretize the attributes values, so as to obtain fewer breakpoints, larger dependency degree between attributes, and less redundant information.In this paper, the basic particle swarm optimization algorithm (PSO) described in [28] is presented to optimize the positions of breakpoints. In PSO, a swarm of particles are initialized randomly in the solution space and each particle can be updated in a certain rule to explore the optimal solution P
best after several iterations. Particles are updated through tracking two “extremums” in each iteration. One is the optimal solution P
best found by the particle itself and another is the optimal solution G
best found by the particle swarm. The specific iteration formulas can be expressed as follows:(11)
v
i
n
+
1
=
ω
n
v
i
n
+
c
1
r
(
P
best
-
x
i
n
)
+
c
2
r
(
G
best
-
x
i
n
)
,
x
i
n
+
1
=
x
i
n
+
v
i
n
+
1
,
where i
=
1
,
2
,
…
,
M; M is the number of particles; n is the current iteration times; c
1 and c
2 are the acceleration factors; r is the random number between 0 and 1; x
i
n is the current position of particle i; v
i
n is the current update speed of particle i; ω
n is the current inertia weight and can be updated by the following equation:
(12)
ω
n
=
(
ω
max
⁡
-
ω
min
⁡
)
(
N
max
⁡
-
n
)
N
max
⁡
+
ω
min
⁡
,
where ω
max
⁡ and ω
min
⁡ are the maximum and minimum of inertia weight; N
max
⁡ is the number of maximum iterations.The main discretization steps for decision table through the PSO can be described as follows.(1)
Normalize the attribute values and initialize the breakpoints numberh, the maximum iterations N
max
⁡, the minimum dependency degree between condition attribute and decision attribute γ
min
⁡, the particles number M, the initial position x
i
0, and initial velocity v
i
0 which are h
×
μ matrixes (μ is the number of attributes).
(2)
Discretize the attribute values with the position of particlei and calculate the dependency degree γ
i as the fitness value of each particle to initialize P
best and G
best.
(3)
Updatex
i, v
i (v
i
≤
v
max
⁡), and ω
n. Discretize the attribute values and calculate the fitness value of each particle so as to update P
best and G
best.
(4)
Ifn
>
N
max
⁡ or γ
i
≥
γ
min
⁡, then the iteration is ended and G
best or x
i is output. Otherwise, go to step (
3
).
(5)
According to the needs, set differenth and return to step (
1
) to search the optimal particles. Then, compare the optimal particles and select the better one as the basis of discretization for decision table. The more detailed discretization process is elaborated in Section 4.5.


### 4.3. Rough Sets for the Attribution Reduction

One of the fundamental steps in proposed method is reduction of pattern dimensionality through feature extraction and feature selection [10]. Rough sets theory provides tools for expressing inexact dependencies within data [29]. Features may be irrelevant (having no effect on the processing performance) and attribution reduction can neglect the redundant information to enable the classification of more objects with a high accuracy [30].In this paper, the algorithm based on attribution significance degree is applied in the attribution reduction of decision table. The specific reduction steps can be described as follows.(1)
Construct the decision tableDT
=
(
U
,
C
∪
D
) and calculate the relative core CORE
D
(
C
) of original decision table. Initialize reduct
=
CORE
D(C) and the redundant attribute set redundant
=
C
-
CORE
D
(
C
)
=
{
α
1
,
α
2
,
…
,
α
τ
} (τ is the number of attributes in redundant).
(2)
IfPOS
reduct
(
D
)
=
POS
C
(
D
) and, for all R
⊆
reduct, POS
R
(
D
)
≠
POS
C
(
D
), then the set reduct is a relative reduct of decision table.
(3)
Otherwise, calculate the significance degree of each attribute in redundant, respectively, through the following equation:(13)
sig
(
α
j
,
reduct
;
D
)
=
γ
{
α
j
∪
reduct
}
(
D
)
-
γ
reduct
(
D
)
,
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
j
=
1
,
2
,
…
,
τ
.
The attribute in redundant with the maximum significance degree is marked as α
max
⁡. Update the reduct and redundant through the following equations:(14)
reduct
=
reduct
∪
{
α
max
⁡
}
,
redundant
=
redundant
-
{
α
max
⁡
}
.
(4)
Go to step(
2
) until POS
reduct
(
D
) satisfies the conditions; then output RED
D
(
C
)
=
reduct.Therefore, the irrelevant features are neglected and the DT is reduced. Thus, a reduced decision table will be constructed and can be regarded as the training set to optimize the structure of RS-BPNN classifier.


### 4.4. Rough Sets for the Rules Extraction

The knowledge in the trained network is encoded in its connection weights and it is distributed numerically throughout the whole structure of neural network. For the knowledge to be useful in the context of a classification system, it has to be articulated in a symbolic form usually in the form of IF-THEN rules. Since neural network is a “black box” for users, the rules which are implicit in the connection weights are difficult to understand, so extracting rules from neural network is extremely tough because of the nonlinear and complicated nature of data transformation conducted in the multiple hidden layers [31]. In this paper, the decision rules are indirectly extracted from the reduced decision table using the value reduction algorithm of rough sets [32]. This algorithm can be elaborated in the following steps.Step 1.
Checking the condition attributes of reduced decision table column by column. If bringing conflicting objects after deleting one column, then preserving the original attribute value of these conflicting objects; If not bringing conflicts, but containing duplicate objects, then marking this attribute value of duplicate objects as “*”; marking this attribute value as “?” for the other objects.Step 2.
Deleting the possible duplicate objects and checking every object that contains the mark “?”. If the decisions can be determined only by the unmarked attribute values, then “?” should be modified as “*”, or else as the original attribute value. If all condition attributes of a particular object are marked, then the attribute values marked with “?” should be modified as the original attribute value.Step 3.
Deleting the objects whose condition attributes are marked as “*” and the possible duplicate objects.Step 4.
If only one condition attribute value is different between any two objects and this attribute value of one object is marked as “*”, and for this object if the decision can be determined by the unmarked attribute values, then deleting another object, or else deleting this object.Each object represents a classification rule in the decision table which is value-reduced through the above steps and the number of attributes which are not marked as “*” of every object makes up the condition number of this rule. Moreover, this rule set can provide the rational basis for the structure of BP neural network.


### 4.5. The Flowchart of the Proposed Approach

According to the above description about the classifier based on integration algorithm of rough sets and BP neural network, the proposed approach is an iterative algorithm and can be coded easily on a computer, and the flowchart can be summarized as shown in Figure3.Figure 3
The flowchart of the proposed approach.


## 4.1. The System Construction Process

The construction process of classification system can be shown as follows.(1)
Preprocessing historical dataset to obtain the sample data is the application precondition of rough sets and BP neural network. In the process of preprocessing, the historical dataset would be discretized through PSO algorithm to construct the decision table.
(2)
Simplify the input of neural network including input dimension and training set number through the attribute reduction based on significance degree algorithm. Deleting the same row in the decision table can simplify the training samples and eliminating the superfluous column (condition attribute) can simplify the network input dimension number. Thus, reduce the decision table using some reduct or sum of several calculated reducts; that is, remove from the table attributes not belonging to the chosen reducts.
(3)
BP neural network integrated with rough sets is used to build the network over the reduced set of data. Decision rules are extracted from the reduced decision table as the basis of network structure through a value reduction algorithm of rough sets.
(4)
Perform network learning for parametersω
i
j, ω
j
k, a
j and b
k. Do this step until there is no significant change in the output of network and the system construction process can be shown as Figure 2.Figure 2
The system construction process.


## 4.2. The Discretization Algorithm for Decision Table

Due to the fact that rough sets theory cannot directly process continuous values of attributes, the decision table composed of continuous values must be discretized firstly. Thus, the positions of breakpoints must be selected appropriately to discretize the attributes values, so as to obtain fewer breakpoints, larger dependency degree between attributes, and less redundant information.In this paper, the basic particle swarm optimization algorithm (PSO) described in [28] is presented to optimize the positions of breakpoints. In PSO, a swarm of particles are initialized randomly in the solution space and each particle can be updated in a certain rule to explore the optimal solution P
best after several iterations. Particles are updated through tracking two “extremums” in each iteration. One is the optimal solution P
best found by the particle itself and another is the optimal solution G
best found by the particle swarm. The specific iteration formulas can be expressed as follows:(11)
v
i
n
+
1
=
ω
n
v
i
n
+
c
1
r
(
P
best
-
x
i
n
)
+
c
2
r
(
G
best
-
x
i
n
)
,
x
i
n
+
1
=
x
i
n
+
v
i
n
+
1
,
where i
=
1
,
2
,
…
,
M; M is the number of particles; n is the current iteration times; c
1 and c
2 are the acceleration factors; r is the random number between 0 and 1; x
i
n is the current position of particle i; v
i
n is the current update speed of particle i; ω
n is the current inertia weight and can be updated by the following equation:
(12)
ω
n
=
(
ω
max
⁡
-
ω
min
⁡
)
(
N
max
⁡
-
n
)
N
max
⁡
+
ω
min
⁡
,
where ω
max
⁡ and ω
min
⁡ are the maximum and minimum of inertia weight; N
max
⁡ is the number of maximum iterations.The main discretization steps for decision table through the PSO can be described as follows.(1)
Normalize the attribute values and initialize the breakpoints numberh, the maximum iterations N
max
⁡, the minimum dependency degree between condition attribute and decision attribute γ
min
⁡, the particles number M, the initial position x
i
0, and initial velocity v
i
0 which are h
×
μ matrixes (μ is the number of attributes).
(2)
Discretize the attribute values with the position of particlei and calculate the dependency degree γ
i as the fitness value of each particle to initialize P
best and G
best.
(3)
Updatex
i, v
i (v
i
≤
v
max
⁡), and ω
n. Discretize the attribute values and calculate the fitness value of each particle so as to update P
best and G
best.
(4)
Ifn
>
N
max
⁡ or γ
i
≥
γ
min
⁡, then the iteration is ended and G
best or x
i is output. Otherwise, go to step (
3
).
(5)
According to the needs, set differenth and return to step (
1
) to search the optimal particles. Then, compare the optimal particles and select the better one as the basis of discretization for decision table. The more detailed discretization process is elaborated in Section 4.5.


## 4.3. Rough Sets for the Attribution Reduction

One of the fundamental steps in proposed method is reduction of pattern dimensionality through feature extraction and feature selection [10]. Rough sets theory provides tools for expressing inexact dependencies within data [29]. Features may be irrelevant (having no effect on the processing performance) and attribution reduction can neglect the redundant information to enable the classification of more objects with a high accuracy [30].In this paper, the algorithm based on attribution significance degree is applied in the attribution reduction of decision table. The specific reduction steps can be described as follows.(1)
Construct the decision tableDT
=
(
U
,
C
∪
D
) and calculate the relative core CORE
D
(
C
) of original decision table. Initialize reduct
=
CORE
D(C) and the redundant attribute set redundant
=
C
-
CORE
D
(
C
)
=
{
α
1
,
α
2
,
…
,
α
τ
} (τ is the number of attributes in redundant).
(2)
IfPOS
reduct
(
D
)
=
POS
C
(
D
) and, for all R
⊆
reduct, POS
R
(
D
)
≠
POS
C
(
D
), then the set reduct is a relative reduct of decision table.
(3)
Otherwise, calculate the significance degree of each attribute in redundant, respectively, through the following equation:(13)
sig
(
α
j
,
reduct
;
D
)
=
γ
{
α
j
∪
reduct
}
(
D
)
-
γ
reduct
(
D
)
,
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
j
=
1
,
2
,
…
,
τ
.
The attribute in redundant with the maximum significance degree is marked as α
max
⁡. Update the reduct and redundant through the following equations:(14)
reduct
=
reduct
∪
{
α
max
⁡
}
,
redundant
=
redundant
-
{
α
max
⁡
}
.
(4)
Go to step(
2
) until POS
reduct
(
D
) satisfies the conditions; then output RED
D
(
C
)
=
reduct.Therefore, the irrelevant features are neglected and the DT is reduced. Thus, a reduced decision table will be constructed and can be regarded as the training set to optimize the structure of RS-BPNN classifier.


## 4.4. Rough Sets for the Rules Extraction

The knowledge in the trained network is encoded in its connection weights and it is distributed numerically throughout the whole structure of neural network. For the knowledge to be useful in the context of a classification system, it has to be articulated in a symbolic form usually in the form of IF-THEN rules. Since neural network is a “black box” for users, the rules which are implicit in the connection weights are difficult to understand, so extracting rules from neural network is extremely tough because of the nonlinear and complicated nature of data transformation conducted in the multiple hidden layers [31]. In this paper, the decision rules are indirectly extracted from the reduced decision table using the value reduction algorithm of rough sets [32]. This algorithm can be elaborated in the following steps.Step 1.
Checking the condition attributes of reduced decision table column by column. If bringing conflicting objects after deleting one column, then preserving the original attribute value of these conflicting objects; If not bringing conflicts, but containing duplicate objects, then marking this attribute value of duplicate objects as “*”; marking this attribute value as “?” for the other objects.Step 2.
Deleting the possible duplicate objects and checking every object that contains the mark “?”. If the decisions can be determined only by the unmarked attribute values, then “?” should be modified as “*”, or else as the original attribute value. If all condition attributes of a particular object are marked, then the attribute values marked with “?” should be modified as the original attribute value.Step 3.
Deleting the objects whose condition attributes are marked as “*” and the possible duplicate objects.Step 4.
If only one condition attribute value is different between any two objects and this attribute value of one object is marked as “*”, and for this object if the decision can be determined by the unmarked attribute values, then deleting another object, or else deleting this object.Each object represents a classification rule in the decision table which is value-reduced through the above steps and the number of attributes which are not marked as “*” of every object makes up the condition number of this rule. Moreover, this rule set can provide the rational basis for the structure of BP neural network.


## 4.5. The Flowchart of the Proposed Approach

According to the above description about the classifier based on integration algorithm of rough sets and BP neural network, the proposed approach is an iterative algorithm and can be coded easily on a computer, and the flowchart can be summarized as shown in Figure3.Figure 3
The flowchart of the proposed approach.


## 5. Simulation Example

A classifier named RS-BPNN (short for rough sets with BP neural network) has been set up and implemented by VC 6.0. In this section, an engineering application of shearer running status classification in a coal mine was put forward as a simulation example to verify the feasibility and effectiveness of the proposed approach. The classification capabilities of different types of neural network models were compared and the proposed approach was proved outperforming others.


### 5.1. The Construction of Decision Table

Due to the poor working conditions of coal mining, there are many parameters relating to the running status of shearer, mainly including cutting motor current, cutting motor temperature, traction motor current, traction motor temperature, traction speed, tilt angle of shearer body, tilt angle of rocker, and vibration frequency of rocker transmission gearbox, marked asC
1
,
C
2
,
C
3
,
C
4
,
C
5
,
C
6
,
C
7,  and C
8, respectively. According to the information database acquired from the 11070 coal face in the number 13 Mine of Pingdingshan Coal Industry Group Co., 200 groups datasets of shearer running status were rearranged as shown in Table 1. This “running status” referred to the cutting status of shearer rocker and could be expressed by the ratio of actual cutting load to rated load.Table 1
The running status of shearer and its corresponding parameters.
Samples
C
1 (A)
C
2 (°C)
C
3 (A)
C
4 (°C)
C
5 (m/min)
C
6 (°)
C
7 (°)
C
8 (Hz)
Running status
1
45.12
78.74
65.46
88.16
3.51
2.52
45.12
628.85
0.78
2
48.19
75.22
70.78
84.28
3.42
3.62
53.22
683.46
0.79
3
50.25
80.19
85.14
91.25
2.88
5.36
40.22
705.76
0.82
4
45.26
82.43
62.45
84.15
3.12
2.85
49.36
642.14
0.76
5
64.28
77.16
90.45
91.41
2.56
2.26
58.55
823.29
1.22
6
46.22
85.24
68.55
80.46
3.26
2.86
58.46
711.24
0.83
7
72.56
85.12
102.42
102.36
2.76
10.26
38.41
881.25
1.17
8
62.33
74.24
92.46
84.46
3.56
8.26
60.27
821.46
1.12
9
44.23
89.19
63.15
85.78
3.82
3.22
46.25
578.26
0.75
10
89.23
81.24
120.36
86.14
2.01
1.05
50.36
1035.48
1.63
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
198
49.22
75.24
71.22
80.25
3.46
4.26
45.26
542.16
0.72
199
68.65
87.16
118.64
90.46
4.66
4.36
49.35
845.29
1.36
200
50.22
78.15
90.46
95.44
3.22
7.22
44.21
682.64
1.11Therefore, in decision table DT, the condition attribute set and decision attribute set could be expressed asC
=
{
C
1
,
C
2
,
C
3
,
C
4
,
C
5
,
C
6
,
C
7
,
C
8
} and D
=
{
d
} (d denoted the shearer running status). The values of decision attribution were discretized based on the following assumptions: for the ratio of actual cutting load to rated load of shearer being greater than 1.6, d
=
4; for the range of this ratio being in interval of (
1.2,1.6
], d
=
3; for the range of this ratio being in interval of (
0.8
,
1.2
], d
=
2; for this ratio being less than 0.8, d
=
1. The discretized values of condition attributes could be determined through the algorithm described in Section 4.2.The condition attributes to be discretized wereC
1
~
C
8, so μ
=
8. Other parameters of PSO were initialized as follows: M
=
100, N
max
⁡
=
200, γ
min
⁡
=
0.9, v
max
⁡
=
0.6, c
1
=
c
2
=
1.6, r is a random number from [
0,1
], ω
max
⁡
=
0.9, and ω
min
⁡
=
0.4. As the breakpoints number h had greater influence on the dependency degree γ
C
(
D
) of discretized decision table, the comparison of two important parameters: dependency degree and simulation time, was analyzed when h was assigned various values. The comparison results were shown in Figure 4.Figure 4
The change curves of dependency degree and simulation time.From Figure4, it was observed that the dependency degree and simulation time both showed ascending tendency with the increase of breakpoints number h. The dependency degree was not significantly increased and the simulation time was obviously increased when h
≥
2. So, h was considered being equal to 2 and γ
C
(
D
)
=
0.98. The breakpoints of each attribute value were shown in Table 2. The breakpoints were applied to discretizing the parameter values in Table 1. If the value was in interval of (
0
,
Br
1
], the discretized attribution value was labeled as 1; if the value was in interval of (
Br
1
,
Br
2
), the discretized attribution value was labeled as 2; otherwise, it was labeled as 3. The discretized decision table was shown in Table 3.Table 2
The corresponding breakpoints of each attribute value ath
=
2.
Breakpoints
C
1 (A)
C
2 (°C)
C
3 (A)
C
4 (°C)
C
5 (m/min)
C
6 (°)
C
7 (°)
C
8 (Hz)
Br1
48.56
81.49
82.37
84.79
2.41
4.16
47.35
651.28
Br2
65.25
85.78
95.42
90.25
3.24
7.38
54.25
847.46Table 3
The discretized decision table.
U
C
D
C
1
C
2
C
3
C
4
C
5
C
6
C
7
C
8
d
1
1
1
1
2
3
1
1
1
1
2
1
1
1
1
3
1
2
2
1
3
2
1
2
3
2
2
1
2
2
4
1
2
1
1
2
1
2
1
1
5
3
1
2
3
2
1
3
2
3
6
1
2
1
1
3
1
3
2
2
7
3
2
3
3
2
3
1
3
2
8
2
1
2
1
3
3
3
2
2
9
1
3
1
2
3
1
1
1
2
10
3
1
3
2
1
1
2
3
4
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
198
2
1
1
1
3
2
1
1
1
199
3
3
3
3
3
2
2
2
2
200
2
1
2
3
2
2
1
2
2


### 5.2. Relative Reduct and Rules Extraction

Through the attribution reduction algorithm presented in Section4.3, the function “CORE
(
C
,
D
)” was invoked to obtain the relative core of decision table and CORE
D
(
C
)
=
{
C
1
,
C
8
}, shown in Figure 5. As the minimum relative reduct of decision table, RED
D
(
C
)
=
{
C
1
,
C
3
,
C
5
,
C
6
,
C
8
} was determined by invoking function “Reduct.”Figure 5
Attribution reduction.In the module of “Rough Set for Attribution Reduction,” a new decision table of200
×
6 was established by the attributions {
C
1
,
C
3
,
C
5
,
C
6
,
C
8
} and decision attribution {
d
}. The function “Refresh (DT)” was called to reject the repeated objects in this new decision table and a reduced decision table was provided finally, containing 79 objects, as shown in Figure 6. Subsequently, the decision rules were extracted through function “Extract rules” which was based on the value reduction algorithm and 25 rules were obtained, as shown in Figure 6. The extracted rules could reveal the potential rules (knowledge) in dataset; for example, the first rule “1
2
3
*
1
1” in Figure 6 illustrated that if cutting motor current C
1
∈
(
0
,
48.56
], traction motor current C
3
∈
(
82.37
,
95.42
), traction speed C
5
∈
[
3.24
,
+
∞
), tilt angle of shearer body C
6 was arbitrary value, and vibration frequency of rocker transmission gearbox C
8
∈
(
0
,
651.28
], then the running status class was 1, which was in accordance with engineering practice situation. Moreover, RS-BPNN classifier, in fact, was to diagnose the status of objects according to these potential rules (knowledge) and the structure of network could be constructed reasonably based on the number of rules so as to enhance the classification accuracy.Figure 6
Rules extraction.


### 5.3. The Structure and Testing of RS-BPNN Classifier

Because the dataset obtained 25 rules (knowledge), the RS-BPNN should be constructed with double hidden layers and the number of neurons was5
×
5, which must completely contain these rules (knowledge). The number of input layer notes s
=
5; the number of output layer notes m
=
1. Other parameters of network were determined as follows: ζ
max
⁡
=
0.9; ζ
min
⁡
=
0.4; t
max
⁡
=
500; the initial connection weights were assigned somewhat random values. The structure of RS-BPNN classifier was shown in Figure 7.Figure 7
The structure of RS-BPNN classifier.The reduced decision table, as the training set, was presented to the network several times. The testing set, composed of 40 samples extracted from the information database randomly, was not seen by the network during the training phase and it was only used for testing the generalization of neural network after it was trained, as shown in Table4.Table 4
The testing samples for the classifier.
Samples
C
1 (A)
C
2 (°C)
C
3 (A)
C
4 (°C)
C
5 (m/min)
C
6 (°)
C
7 (°)
C
8 (Hz)
d
1
75.24
71.38
128.45
85.46
2.00
1.02
52.45
1038.44
1.65
2
89.46
78.25
110.46
80.57
2.86
2.15
49.21
992.46
1.78
3
55.46
80.19
81.14
90.25
2.89
3.36
56.22
810.76
1.08
4
75.26
82.43
62.45
84.15
3.12
3.55
52.46
900.47
1.39
5
56.28
78.16
100.45
90.41
2.56
8.26
58.55
523.29
0.68
6
49.25
86.24
68.55
80.46
3.26
3.06
60.46
711.24
0.72
7
60.56
80.12
112.42
92.36
2.76
7.48
48.41
871.25
0.92
8
70.33
70.24
96.46
80.46
3.76
3.26
60.27
921.46
1.22
9
74.23
85.19
113.15
79.78
2.32
2.25
56.25
1000.46
1.66
10
89.23
76.24
120.36
85.14
3.31
4.25
55.46
1035.48
1.63
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
38
58.46
74.24
90.22
80.25
2.46
3.26
55.26
849.16
1.35
39
65.02
87.16
118.64
90.46
5.06
9.24
48.26
1025.29
1.75
40
50.22
85.15
81.25
89.44
3.34
3.46
44.25
672.64
0.72After the training phase, the RS-BPNN classifier was obtained. In order to test the performance of this classifier expediently, a testing interface was designed as shown in Figure8. The testing set was imported with the “Import samples” button and was processed with the functions of “Discretize” and “Reduce attribution.” The prediction results of RS-BPNN classifier were output through the function of “Classify” in Figure 8. The contrast of prediction class and actual class was shown brightly in Figure 9.Figure 8
The testing interface of RS-BPNN classifier.The contrast of prediction class and actual class.
(a)
(b)When the classification accuracy of RS-BPNN was computed in Figure8, the output of classifier was impossibly equal to desired output. Therefore, it allowed the output to differ from the desired value. If the difference between classifier output and required value of decision was less than some present value, it was regarded as a correct one. This tolerance margin was decided during simulation evaluation and finally it was 5% of the desired value. Seen from Figures 8 and 9, the classification accuracy was 90.00% and the average classification error was 2.02%. The present model showed higher accuracy and lower error for the classification of shearer running status. The testing results showed that the proposed classifier was proved to be satisfactory and could be used in engineering application in the future.


### 5.4. Discussion

To evaluate the classification capabilities of different types of neural network models (WNN short for wavelet neural network, RS-WNN short for rough sets coupling with wavelet neural network, BP-NN short for back-propagation neural network, and RS-BPNN short for rough sets coupling with back-propagation neural network), their best architecture and effective training parameters should be found. In order to obtain the best model, both inputs and outputs should be normalized. The number of nodes in the hidden layer of WNN and RS-WNN was equal to that of wavelet base. If the number was too small, WNN/RS-WNN may not reflect the complex function relationship between input data and output value. On the contrary, a large number may create such a complex network that might lead to a very large output error caused by overfitting of the training sample set.Therefore, a search mechanism was needed to find the optimal number of nodes in the hidden layer for WNN and RS-WNN models. In this study, various numbers of nodes in the hidden layer had been checked to find the best one. WNN and RS-WNN yielded the best results when the number of hidden nodes was 8.In this subsection, WNN, RS-WNN, BP-NN, and RS-BPNN were provided to solve the problem of above simulation example. The configurations of simulation environment for four algorithms were uniform and in common with above simulation example. Initially, for each network, the connection weights were assigned somewhat random values. In order to avoid the random error, the training set of input was presented to the networks 100 times and the average values were calculated. The training accuracy, testing accuracy, classification error, and classification time of four algorithms were shown in Table5.Table 5
Classification performance of the four models of neural networks.
The models
Training accuracy (%)
Testing accuracy (%)
Classification error (%)
Classification time (s)
WNN
90.00
82.50
3.56
23.22
RS-WNN
92.50
87.50
2.66
18.48
BP-NN
90.00
85.00
2.86
22.26
RS-BPNN
95.00
90.00
2.02
18.33From the table, it was observed that the proposed model had a better classification capability and better performance than other models of neural networks in predicting the nonlinear, dynamic, and chaotic behaviors in the dataset, and the proposed model was proved outperforming others. Furthermore, the comparison results were suggesting that the proposed model represents a new good method for classification and decision making, and the new method can be treated as a promising tool for extracting rules from the dataset in industrial fields.In order to illustrate the superiority of proposed method, Iris data set [23], as a benchmark data set from UCI database, was used to verify the classifiers based on above four types of neural networks and the compared results were shown in Table 6. The sample data had been reduced firstly based on attribution reduction algorithm, and then they were used to train neural networks so the networks coupling with rough sets (RS-WNN and RS-RBNN) could acquire better classification accuracy than signal networks (WNN and BPNN). The rules were extracted through value reduction algorithm to construct RS-BPNN structure, so the classification accuracy of classifier based on RS-BPNN was higher than that of RS-WNN classifier.Table 6
Classification results of the four methods.
The methods
Classification accuracy (%)
Class I
Class II
Class III
WNN
93.33
86.67
80.00
RS-WNN
100
93.33
86.67
BP-NN
93.33
80.00
86.67
RS-BPNN
100
93.33
100


## 5.1. The Construction of Decision Table

Due to the poor working conditions of coal mining, there are many parameters relating to the running status of shearer, mainly including cutting motor current, cutting motor temperature, traction motor current, traction motor temperature, traction speed, tilt angle of shearer body, tilt angle of rocker, and vibration frequency of rocker transmission gearbox, marked asC
1
,
C
2
,
C
3
,
C
4
,
C
5
,
C
6
,
C
7,  and C
8, respectively. According to the information database acquired from the 11070 coal face in the number 13 Mine of Pingdingshan Coal Industry Group Co., 200 groups datasets of shearer running status were rearranged as shown in Table 1. This “running status” referred to the cutting status of shearer rocker and could be expressed by the ratio of actual cutting load to rated load.Table 1
The running status of shearer and its corresponding parameters.
Samples
C
1 (A)
C
2 (°C)
C
3 (A)
C
4 (°C)
C
5 (m/min)
C
6 (°)
C
7 (°)
C
8 (Hz)
Running status
1
45.12
78.74
65.46
88.16
3.51
2.52
45.12
628.85
0.78
2
48.19
75.22
70.78
84.28
3.42
3.62
53.22
683.46
0.79
3
50.25
80.19
85.14
91.25
2.88
5.36
40.22
705.76
0.82
4
45.26
82.43
62.45
84.15
3.12
2.85
49.36
642.14
0.76
5
64.28
77.16
90.45
91.41
2.56
2.26
58.55
823.29
1.22
6
46.22
85.24
68.55
80.46
3.26
2.86
58.46
711.24
0.83
7
72.56
85.12
102.42
102.36
2.76
10.26
38.41
881.25
1.17
8
62.33
74.24
92.46
84.46
3.56
8.26
60.27
821.46
1.12
9
44.23
89.19
63.15
85.78
3.82
3.22
46.25
578.26
0.75
10
89.23
81.24
120.36
86.14
2.01
1.05
50.36
1035.48
1.63
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
198
49.22
75.24
71.22
80.25
3.46
4.26
45.26
542.16
0.72
199
68.65
87.16
118.64
90.46
4.66
4.36
49.35
845.29
1.36
200
50.22
78.15
90.46
95.44
3.22
7.22
44.21
682.64
1.11Therefore, in decision table DT, the condition attribute set and decision attribute set could be expressed asC
=
{
C
1
,
C
2
,
C
3
,
C
4
,
C
5
,
C
6
,
C
7
,
C
8
} and D
=
{
d
} (d denoted the shearer running status). The values of decision attribution were discretized based on the following assumptions: for the ratio of actual cutting load to rated load of shearer being greater than 1.6, d
=
4; for the range of this ratio being in interval of (
1.2,1.6
], d
=
3; for the range of this ratio being in interval of (
0.8
,
1.2
], d
=
2; for this ratio being less than 0.8, d
=
1. The discretized values of condition attributes could be determined through the algorithm described in Section 4.2.The condition attributes to be discretized wereC
1
~
C
8, so μ
=
8. Other parameters of PSO were initialized as follows: M
=
100, N
max
⁡
=
200, γ
min
⁡
=
0.9, v
max
⁡
=
0.6, c
1
=
c
2
=
1.6, r is a random number from [
0,1
], ω
max
⁡
=
0.9, and ω
min
⁡
=
0.4. As the breakpoints number h had greater influence on the dependency degree γ
C
(
D
) of discretized decision table, the comparison of two important parameters: dependency degree and simulation time, was analyzed when h was assigned various values. The comparison results were shown in Figure 4.Figure 4
The change curves of dependency degree and simulation time.From Figure4, it was observed that the dependency degree and simulation time both showed ascending tendency with the increase of breakpoints number h. The dependency degree was not significantly increased and the simulation time was obviously increased when h
≥
2. So, h was considered being equal to 2 and γ
C
(
D
)
=
0.98. The breakpoints of each attribute value were shown in Table 2. The breakpoints were applied to discretizing the parameter values in Table 1. If the value was in interval of (
0
,
Br
1
], the discretized attribution value was labeled as 1; if the value was in interval of (
Br
1
,
Br
2
), the discretized attribution value was labeled as 2; otherwise, it was labeled as 3. The discretized decision table was shown in Table 3.Table 2
The corresponding breakpoints of each attribute value ath
=
2.
Breakpoints
C
1 (A)
C
2 (°C)
C
3 (A)
C
4 (°C)
C
5 (m/min)
C
6 (°)
C
7 (°)
C
8 (Hz)
Br1
48.56
81.49
82.37
84.79
2.41
4.16
47.35
651.28
Br2
65.25
85.78
95.42
90.25
3.24
7.38
54.25
847.46Table 3
The discretized decision table.
U
C
D
C
1
C
2
C
3
C
4
C
5
C
6
C
7
C
8
d
1
1
1
1
2
3
1
1
1
1
2
1
1
1
1
3
1
2
2
1
3
2
1
2
3
2
2
1
2
2
4
1
2
1
1
2
1
2
1
1
5
3
1
2
3
2
1
3
2
3
6
1
2
1
1
3
1
3
2
2
7
3
2
3
3
2
3
1
3
2
8
2
1
2
1
3
3
3
2
2
9
1
3
1
2
3
1
1
1
2
10
3
1
3
2
1
1
2
3
4
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
198
2
1
1
1
3
2
1
1
1
199
3
3
3
3
3
2
2
2
2
200
2
1
2
3
2
2
1
2
2


## 5.2. Relative Reduct and Rules Extraction

Through the attribution reduction algorithm presented in Section4.3, the function “CORE
(
C
,
D
)” was invoked to obtain the relative core of decision table and CORE
D
(
C
)
=
{
C
1
,
C
8
}, shown in Figure 5. As the minimum relative reduct of decision table, RED
D
(
C
)
=
{
C
1
,
C
3
,
C
5
,
C
6
,
C
8
} was determined by invoking function “Reduct.”Figure 5
Attribution reduction.In the module of “Rough Set for Attribution Reduction,” a new decision table of200
×
6 was established by the attributions {
C
1
,
C
3
,
C
5
,
C
6
,
C
8
} and decision attribution {
d
}. The function “Refresh (DT)” was called to reject the repeated objects in this new decision table and a reduced decision table was provided finally, containing 79 objects, as shown in Figure 6. Subsequently, the decision rules were extracted through function “Extract rules” which was based on the value reduction algorithm and 25 rules were obtained, as shown in Figure 6. The extracted rules could reveal the potential rules (knowledge) in dataset; for example, the first rule “1
2
3
*
1
1” in Figure 6 illustrated that if cutting motor current C
1
∈
(
0
,
48.56
], traction motor current C
3
∈
(
82.37
,
95.42
), traction speed C
5
∈
[
3.24
,
+
∞
), tilt angle of shearer body C
6 was arbitrary value, and vibration frequency of rocker transmission gearbox C
8
∈
(
0
,
651.28
], then the running status class was 1, which was in accordance with engineering practice situation. Moreover, RS-BPNN classifier, in fact, was to diagnose the status of objects according to these potential rules (knowledge) and the structure of network could be constructed reasonably based on the number of rules so as to enhance the classification accuracy.Figure 6
Rules extraction.


## 5.3. The Structure and Testing of RS-BPNN Classifier

Because the dataset obtained 25 rules (knowledge), the RS-BPNN should be constructed with double hidden layers and the number of neurons was5
×
5, which must completely contain these rules (knowledge). The number of input layer notes s
=
5; the number of output layer notes m
=
1. Other parameters of network were determined as follows: ζ
max
⁡
=
0.9; ζ
min
⁡
=
0.4; t
max
⁡
=
500; the initial connection weights were assigned somewhat random values. The structure of RS-BPNN classifier was shown in Figure 7.Figure 7
The structure of RS-BPNN classifier.The reduced decision table, as the training set, was presented to the network several times. The testing set, composed of 40 samples extracted from the information database randomly, was not seen by the network during the training phase and it was only used for testing the generalization of neural network after it was trained, as shown in Table4.Table 4
The testing samples for the classifier.
Samples
C
1 (A)
C
2 (°C)
C
3 (A)
C
4 (°C)
C
5 (m/min)
C
6 (°)
C
7 (°)
C
8 (Hz)
d
1
75.24
71.38
128.45
85.46
2.00
1.02
52.45
1038.44
1.65
2
89.46
78.25
110.46
80.57
2.86
2.15
49.21
992.46
1.78
3
55.46
80.19
81.14
90.25
2.89
3.36
56.22
810.76
1.08
4
75.26
82.43
62.45
84.15
3.12
3.55
52.46
900.47
1.39
5
56.28
78.16
100.45
90.41
2.56
8.26
58.55
523.29
0.68
6
49.25
86.24
68.55
80.46
3.26
3.06
60.46
711.24
0.72
7
60.56
80.12
112.42
92.36
2.76
7.48
48.41
871.25
0.92
8
70.33
70.24
96.46
80.46
3.76
3.26
60.27
921.46
1.22
9
74.23
85.19
113.15
79.78
2.32
2.25
56.25
1000.46
1.66
10
89.23
76.24
120.36
85.14
3.31
4.25
55.46
1035.48
1.63
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
38
58.46
74.24
90.22
80.25
2.46
3.26
55.26
849.16
1.35
39
65.02
87.16
118.64
90.46
5.06
9.24
48.26
1025.29
1.75
40
50.22
85.15
81.25
89.44
3.34
3.46
44.25
672.64
0.72After the training phase, the RS-BPNN classifier was obtained. In order to test the performance of this classifier expediently, a testing interface was designed as shown in Figure8. The testing set was imported with the “Import samples” button and was processed with the functions of “Discretize” and “Reduce attribution.” The prediction results of RS-BPNN classifier were output through the function of “Classify” in Figure 8. The contrast of prediction class and actual class was shown brightly in Figure 9.Figure 8
The testing interface of RS-BPNN classifier.The contrast of prediction class and actual class.
(a)
(b)When the classification accuracy of RS-BPNN was computed in Figure8, the output of classifier was impossibly equal to desired output. Therefore, it allowed the output to differ from the desired value. If the difference between classifier output and required value of decision was less than some present value, it was regarded as a correct one. This tolerance margin was decided during simulation evaluation and finally it was 5% of the desired value. Seen from Figures 8 and 9, the classification accuracy was 90.00% and the average classification error was 2.02%. The present model showed higher accuracy and lower error for the classification of shearer running status. The testing results showed that the proposed classifier was proved to be satisfactory and could be used in engineering application in the future.


## 5.4. Discussion

To evaluate the classification capabilities of different types of neural network models (WNN short for wavelet neural network, RS-WNN short for rough sets coupling with wavelet neural network, BP-NN short for back-propagation neural network, and RS-BPNN short for rough sets coupling with back-propagation neural network), their best architecture and effective training parameters should be found. In order to obtain the best model, both inputs and outputs should be normalized. The number of nodes in the hidden layer of WNN and RS-WNN was equal to that of wavelet base. If the number was too small, WNN/RS-WNN may not reflect the complex function relationship between input data and output value. On the contrary, a large number may create such a complex network that might lead to a very large output error caused by overfitting of the training sample set.Therefore, a search mechanism was needed to find the optimal number of nodes in the hidden layer for WNN and RS-WNN models. In this study, various numbers of nodes in the hidden layer had been checked to find the best one. WNN and RS-WNN yielded the best results when the number of hidden nodes was 8.In this subsection, WNN, RS-WNN, BP-NN, and RS-BPNN were provided to solve the problem of above simulation example. The configurations of simulation environment for four algorithms were uniform and in common with above simulation example. Initially, for each network, the connection weights were assigned somewhat random values. In order to avoid the random error, the training set of input was presented to the networks 100 times and the average values were calculated. The training accuracy, testing accuracy, classification error, and classification time of four algorithms were shown in Table5.Table 5
Classification performance of the four models of neural networks.
The models
Training accuracy (%)
Testing accuracy (%)
Classification error (%)
Classification time (s)
WNN
90.00
82.50
3.56
23.22
RS-WNN
92.50
87.50
2.66
18.48
BP-NN
90.00
85.00
2.86
22.26
RS-BPNN
95.00
90.00
2.02
18.33From the table, it was observed that the proposed model had a better classification capability and better performance than other models of neural networks in predicting the nonlinear, dynamic, and chaotic behaviors in the dataset, and the proposed model was proved outperforming others. Furthermore, the comparison results were suggesting that the proposed model represents a new good method for classification and decision making, and the new method can be treated as a promising tool for extracting rules from the dataset in industrial fields.In order to illustrate the superiority of proposed method, Iris data set [23], as a benchmark data set from UCI database, was used to verify the classifiers based on above four types of neural networks and the compared results were shown in Table 6. The sample data had been reduced firstly based on attribution reduction algorithm, and then they were used to train neural networks so the networks coupling with rough sets (RS-WNN and RS-RBNN) could acquire better classification accuracy than signal networks (WNN and BPNN). The rules were extracted through value reduction algorithm to construct RS-BPNN structure, so the classification accuracy of classifier based on RS-BPNN was higher than that of RS-WNN classifier.Table 6
Classification results of the four methods.
The methods
Classification accuracy (%)
Class I
Class II
Class III
WNN
93.33
86.67
80.00
RS-WNN
100
93.33
86.67
BP-NN
93.33
80.00
86.67
RS-BPNN
100
93.33
100


## 6. Conclusions

This paper proposed a novel classifier model based on BP neural network and rough sets theory to be applied in nonlinear systems. The decision table was constructed and discretized reasonably through the PSO algorithm. The decision rules were extracted by the use of value reduction algorithm which provided the basis for the network structure. In order to verify the feasibility and superiority, the proposed approach was applied to a classification problem of an industrial example. The results of comparison simulations showed that the proposed approach could generate more accurate classification and cost less classification time than other neural network approaches and the rough sets based approach. The classification performance of proposed model demonstrated that this method could be extended to process other types of classification problems such as gear fault identification, lithology recognition, and coal-rock interface recognition.



---

*Source: 797432-2014-04-24.xml*