Method on Determining Feature Weight in
Case-Based Reasoning System
Baohua Yang
College of Information and Computer
Anhui Agriculture University
Hefei Anhui, China
Abstract—At present, the determining method on feature
weight have the problems of complexity and one-sidedness
of determining in case-based reasoning system. In this
paper, an integrated method based on BP Neural Network
and sensitivity analysis is studied. An algorithm based on BP
Neural Network and sensitivity analysis (BPNN-SA) is put
forward, the network topology changes in accordance with
input nodes change. A red-seed watermelon case is given to
illustrate this determining method. After the calculation and
analysis, results show the new method is better than the
current methods and effective for determining feature
weight.
Keywords-Sensitivity analysis; Feature Weight; BP Neural
Network;Case-Based Reasoning
I. INTRODUCTION
Feature weight is one of the most important issues of
case-based reasoning (CBR). It plays a significant role in
the decision-making and improving case retrieval [1]. So,
whether the determining method on feature weight is
reasonable or not is the key factor in case retrieval, which
will decide the correctness and final reliability of the case
method in decision-making. Studies on feature weight
have been investigated by many researchers.
At present, AHP (Analytic Hierarchy Process, AHP) is
quite commonly used method in determining the weights
[2].But this approach require the expert higher score and
algorithm was complex. So, Professor Sun [3] uses rough
sets to determine the weights. But the case of continuous
quantitative attribute call for discrimination, most have a
discrete method of similarity measurement error case, and
cause data loss, resulting in case retrieval and case-based
reasoning results are inaccurate. As time and space
change, to determine the weights are not in line with the
actual situation [4]. In particular, a number of complex
nonlinear systems, the use of traditional algorithms to
establish the weights of the learning mechanism seem
978-1-4244-7161-4/10/$26.00 ©2010 IEEE
Authorized licensed use limited to: McGill University. Downloaded on February 16,2023 at 01:40:43 UTC from IEEE Xplore. Restrictions apply.
Xiu Jin
College of Information and Computer
Anhui Agriculture University
Hefei Anhui, China
inadequate. BP neural network is essentially a non-linear
input-output mapping, which can make up for the lack of
inaccurate data and non-dynamic, through the study of
known samples to obtain expert evaluation of the
experience of the importance of knowledge and on the
target.
So, for studying the dynamic relationships of these
features, in this paper,we at first construct model of BP
Neural Network, which dynamic changes in the structure
with input nodes change.Second,study on sensitivity
analysis on new Neural Network, a integrated algorithm
based on BP Neural Network and sensitivity analysis
(BPNN-SA)is put forward. Finally, example is proved the
effectiveness of the algorithm in red-seed watermelon
case.
II. NEURAL NETWORK MODEL
1) Network layer
BP network may contain different hidden layer, and
the theories have proved that the BP Neural networks
which contain 2 layers network (including one hidden
layer) can map any non-linear relation, when nodes
number of the hidden layer is arbitrary.
2) Input and output layer dimension
Input layer is used as buffer-storage, based on the
need to solve problems and identify data. Dimensions of
output layer depend on the two factors. One is the output
data type. The other is the size of the required data types.
We should minimize the system scale as possible in
design of input layer and output layer, so that the training
time of network will be reduced.
3) Hidden layer nodes
At present, there is not a good analytical, and the
number of nodes often determined by empirical or
conducting test themselves. Is generally believed that the
number of nodes of hidden layer to solve the problem
with the request, the number of input and output units
have a direct relationship. In addition, too many hidden
layer nodes will lead to the learning time is too long; and determine the size of sensitivity. First of all, get weights
too few hidden nodes, fault tolerant of poor identification vector {l1,l2,…ln} of features from trained neural network.
of samples without the ability to study low. Sensitive factor is Si:
The number of hidden layer is commonly Used 0 i
§ − | ·¸
hidden layer is one or two in the real application. Initial ¨ | p p
¨
¨
¦ L 0 ¸
¸
value of hidden layer nodes can also be is decided by the p ˄˅
s i = © ¹
n
following formula:
P0 is the predictive value of network output after
l= m+n +a ˄1˅ deleted characteristic i;P0 is predicted value without any
characteristics of the network deleted ;L is the training
l = 0.43mn + 0.12n2 + 2.54m + 0.77n + 0.35 + 0.51 ˄2˅
sample cases, n is the number of sample cases.
Where m is the number of output neurons, n is the Definition 3 In accordance with coefficient
number of input units, a is constant between 1 and 10. determined by weight-sensitive, then Wi is the feature
4) Selection of transfer function item weighting:
The way of neurons connect is decided by transfer
s
function, appropriate function can reduce distortion, w i = n
i

increase the supply of different fitting between neurons. ¦ j = 1

s j

The commonly used transfer functions are: ˄˅

Linear transfer function, the expression of function as The feature weighting value is 1 after standardization.
follows: According to the formula (6) and (7), calculations of the
§ 0 i characteristics of the weight.
¨ | p − p | ·¸
¨
¨
¦ L 0 ¸
¸ B. Theorem
p
si = © ¹
Theorem 1 Decision-making to the characteristics of
n ˄˅
the target data set composed of samples of the case library
S-shaped hyperbolic tangent transfer function, the
as a BP neural network learning samples for training, For
expression of function as follows:
Si and Sj , respectively, for the deletion of the first items i
si and j after the characteristics of the sensitive coefficient.
wi = n IF Si>Sj, the sensitivity of the feature i larger than the
¦
j =1
s j sensitivity of feature j, that is Wi>Wj.
 ˄˅ Theorem 2 Decision-making to the characteristics of
the target data set composed of samples of the case library
S-shaped logarithmic function, the expression of
as a BP neural network learning samples for training, Pi is
function as follows:
assumed as predictive value of network output after
0 i

lni =¦
p −p| | deleting feature i,P0 is assumed as predictive value of
L 0 network output without deleting any nodes, feature
p ˄˅ weight vector denoted as {l1,l2,…ln}.
0 i
III. SENSITIVITY ANALYSIS | p −p|
A. Definition
lni = ¦L 0

Definition 1 Sensitivity is the influence degree of

p ˄˅
possible beforehand change factors and
If lni>lnj,Then the feature i has more great influence on
superiority-inferiority of the decision-making. It can
test result than feature j, feature weight can be obtained in
indicate that the change in relevant factors influence
order each of the weight. According to relevance of
degree on decision-making goals, decision-making
network parameters to sensitivity, and metrics as a
scheme and other evaluation index.
parameter used to determine changes in network
Definition 2 Sensitivity [5] introduced into the
performance on the network size [6-7].
case-base, and defines the sensitivity coefficient to

Authorized licensed use limited to: McGill University. Downloaded on February 16,2023 at 01:40:43 UTC from IEEE Xplore. Restrictions apply.
 IV. DETERMINING METHOD ON FEATURE WEIGHT
A. Determining Method on Feature Weight Based
on BP Neural Network and Sensitivity Analysis
Data sets are usually given in the form of tables,and
we call a case system, formulated as T=<U,A,V,,f>,
where U is a set of finite and nonempty objects called the
universe,A is the feature set,V is the domain of the feature
value,and f is the information function:f =U×AĺV.If the
attribute set A is divided into condition feature set C and
decision feature set D.The structure of cases accord with
people's habits and is good for the storage and neural
network training.For studying the dynamic relationships
of these features, in this paper,we construct model of BP
Neural Network,where feature set C are regarded as input
nodes of BPNN and feature set D are regarded as output
nodes of BPNN.We analyse the degree of sensitivity of
the output neurons to the input neurons,when input
neurons are deleted one by one.As nodes reduce and
weights among neurons change,on the corresponding the
topology of the network may dynamic change.
Then determining algorithm on feature weight based
on BP neural network and sensitivity analysis is
constructed as follows:
Step1˖Firstly, Select representative data as a sample
case data in case-based system;
Step2˖ In order to reduce the effect resulting from the
different condition feature set, we normalize the
numerical attribute x into the interval [0, 1] with
xk −xmin
xk' =
xmax −xmin ˄˅
Step3˖Determine the network topology, input neurons
and output neurons are determined in different cases.
According to the formula (1) or (2) to determine the
number of hidden layer neurons;
Step4˖Select the learning parameters of BP Neural
Network; determine the network's transfer function and
training function, training steps and target errors.
Step5˖Training of the neural network to determine the
accuracy of the network to meet for the purpose of
training the network. If the network does not meet the
accuracy, then we go to Step 3 and repeat to perform steps
3 and step 4.Optimization of neural network parameters
and structure, adjust the training function,re-learning on
the network until meet the given accuracy. Otherwise, go
to Step 6.
Authorized licensed use limited to: McGill University. Downloaded on February 16,2023 at 01:40:43 UTC from IEEE Xplore. Restrictions apply.
Step6: Calculate network sensitivity coefficient after
deleting an input node, then in accordance with formula
(7), calculate the feature weight.
Step7: Repeat to perform steps 6, according to
different features of the case, we delete different input
nodes from the network, that is, delete the various
features of the case one by one, calculate their sensitivity
coefficients, and so all features weight are determined.
B. Cases Analysis
In this section, an example is used to illustrate the
analysis procedure proposed. In Anhui Agricultural
University red-seed watermelon horticulture 150 cases
are randomly selected as training data, 80 cases are
chosen as testing data[8].It can be regarded as a set of
attribute values of the feature of (feature value pairs)
constitute a collection. In the case, there are many
characteristics can be described about red-seed
watermelon. According to expert experience some
features were concerned, such as fruit weight, seed size,
seed number, grain weight and seed weight and other
characteristics, as a division of the feature on different
types of red-seed watermelon kernel.
In accordance with the above algorithm, by the
training neural network model forecasting result is as
shown in Fig.1, which meets the requirements on
prediction accuracy.
Figure 1. The training neural network model forecasting results
After the dynamic adjustment of neural network
structure on testing data, by the training network different
models of BP Neural Network prediction error curve are
shown in Fig2,where y1, y2, y3, y4, y5 representatives of
deletion fruit weight, seed size, seed number, grain weight
and seed weight. Between the real data and the
forecasting data, which show the BPNN-SA model is
valid in precision of forecast.

Figure 2. Prediction error curve
TABLE 1
Algorithm
fruit weight
BPNN-SA 0.07415
V. CONCLUSION
Therefore, we can conclude that the algorithm of
BPNN-SA not only reflect the dynamic relationship
between features, but also calculate simply and overcome
the one-sidedness. So it is accurate and effective. The
algorithms provide a basis for retrieval and re-use in
case-based reasoning system. Our future work includes the
extension of determining method on feature weight.
VI. ACKNOWLEDGEMENTS
The authors acknowledge support from the National
Science Foundation of China (Grant No.30800663 and
Grant No.30971691).
Authorized licensed use limited to: McGill University. Downloaded on February 16,2023 at 01:40:43 UTC from IEEE Xplore. Restrictions apply.
The calculation results of weight are as shown in table
1. We can conclude that the feature of the seed size is the
smallest weight in all features. So the contribution of
weight on seed size is the smallest. Other features weights
followed by descending: fruit weight, seed number, grain
weight, seed weight. The results are in line with experts
and practitioners. That is to say, the feature with high
weight play important role in decision classification and
prediction.
RESULTS OF ALGORITHMS
Feature Weights
seed size seed number grain weight seed weight
0.03214 0.07225 0.05640 0.05120
REFERENCES
[1] Jiang Yan,Chen Rongqiu.Parameter Sensitivity Analysis Based on
the Least Variance of Weights. Journal of Wuhan Automotive
Polytechnic University. vol.27,NO 1, Feb. 2005, pp.165-167.
[2] Zhu Yin,Meng Zhiyong,Kan Shuyu.Determination of Weight V
alue by AHP. Journal of Northern Jiaotong University. vol.23,NO
5, Oct. 1999,pp.119-122.
[3] Walczak B, Massart D L. Rough sets theory. Chemometrics and I
ntelligent Laboratory Systems, vol.47,NO 1, Apr,1999, pp.1-16.
[4] SUN Huijun,WANG Xinhua.Determin ation of the Weight of
Evaluation Indexes with Artif icial Neural Network Method.
Journal of Shandong University of Science and Technology.
vol.20,NO 3, Sep. 2001,pp.84-86.
[5] Wang Wenjian.Improve of BP Neural Networks Model. Computer
Engineering and Design. vol.26,NO 11, Nov. 2000, pp.8-10.
[6] Zeng, X., & Yeung, D. S.Sensitivity analysis of multilayer
perceptron to input and weight perturbations. IEEE Transactions
on Neural Networks, vol.12,NO.6, Dec. 2001, pp. 1358-1366.
[7] Zeng X,Yeung DS.Hidden neuron pruning of multilayer
perceptrons using a quantified sensitivity measure.Neuro
computing, Vol. 69, Mar.2006, pp. 825-837.
[8] Yang Baohua, Li Shaowen, Fan Jianfeng. Distinction method for
red-seed watermelon quantitative trait based on rough set
.Agriculture Network Information, vol.6,Jun.2006, pp.38-39,58.