Instance Based Learning

(Unit-3, Part-2)
Instance-based learning
The Machine Learning systems which are categorized
as instance-based learning are the systems that learn the
training examples by heart and then generalizes to new
instances based on some similarity measure.
It is called instance-based because it builds the hypotheses
from the training instances.
It is also known as memory-based learning or lazy-
learning (because they delay processing until a new instance
must be classified).
The time complexity of this algorithm depends upon the size of
training data.
Each time whenever a new query is encountered, its previously
stores data is examined. And assign to a target function value
for the new instance.
Instance-based learning
Advantages:
[Link] of estimating for the entire instance set, local approximations
can be made to the target function.
[Link] algorithm can adapt to new data easily, one which is collected as
we go .

Disadvantages:
[Link] costs are high.
[Link] amount of memory required to store the data, and each query
involves starting the identification of a local model from scratch.

Some of the instance-based learning algorithms are :

1.K-Nearest Neighbor (KNN)
[Link]-Organizing Map (SOM)
[Link] Vector Quantization (LVQ)
[Link] Weighted Learning (LWL)
[Link]-Based Reasoning
1. K-Nearest Neighbor(KNN)
Algorithm
 K-Nearest Neighbor(KNN) Algorithm
•K-Nearest Neighbour is one of the simplest Machine Learning algorithms
based on Supervised Learning technique.
•K-NN algorithm assumes the similarity between the new case/data and
available cases and put the new case into the category that is most similar to
the available categories.
•K-NN algorithm stores all the available data and classifies a new data point
based on the similarity. This means when new data appears then it can be
easily classified into a well suite category by using K- NN algorithm.
•K-NN algorithm can be used for Regression as well as for Classification but
mostly it is used for the Classification problems.
•K-NN is a non-parametric algorithm, which means it does not make any
assumption on underlying data.
•It is also called a lazy learner algorithm because it does not learn from the
training set immediately instead it stores the dataset and at the time of
classification, it performs an action on the dataset.
•KNN algorithm at the training phase just stores the dataset and when it gets
new data, then it classifies that data into a category that is much similar to the
new data.
 K-Nearest Neighbor(KNN) Algorithm

Example:
Suppose, we have an image of a creature that looks similar to cat and dog,
but we want to know either it is a cat or dog. So for this identification, we
can use the KNN algorithm, as it works on a similarity measure.
Our KNN model will find the similar features of the new data set to the cats
and dogs images and based on the most similar features it will put it in
either cat or dog category.
 K-Nearest Neighbor(KNN) Algorithm
Why do we need a K-NN Algorithm?
Suppose there are two categories, i.e., Category A and Category B, and we
have a new data point x1, so this data point will lie in which of these
categories.
To solve this type of problem, we need a K-NN algorithm. With the help of
K-NN, we can easily identify the category or class of a particular dataset.
Consider the below diagram:
 K-Nearest Neighbor(KNN) Algorithm

How does K-NN work? (Algorithm)

The K-NN working can be explained on the basis of the below
algorithm:
•Step-1: Select the number K of the neighbors
•Step-2: Calculate the Euclidean distance of K number of
neighbors
•Step-3: Take the K nearest neighbors as per the calculated
Euclidean distance.
•Step-4: Among these k neighbors, count the number of the data
points in each category.
•Step-5: Assign the new data points to that category for which the
number of the neighbor is maximum.
•Step-6: Our model is ready.
 K-Nearest Neighbor(KNN) Algorithm
Suppose we have a new data point and we need to put it in the
required category (A or B).
Consider the below image:
 K-Nearest Neighbor(KNN) Algorithm
•Firstly, we will choose the number of neighbors, so we will choose the k=5.
•Next, we will calculate the Euclidean distance between the data points. The
Euclidean distance is the distance between two points, which we have already studied
in geometry. It can be calculated as:
Manhattan Distance
Manhattan Distance metric is generally used
when we are interested in the total distance
traveled by the object instead of the
displacement.
The Manhattan Distance between two
points (X1, Y1) and (X2, Y2) is given by:

Minkowski Distance
 K-Nearest Neighbor(KNN) Algorithm
By calculating the Euclidean distance we got the nearest neighbors,
as three nearest neighbors in category A and two nearest neighbors
in category B. Consider the below image:

•As we can see the 3 nearest

neighbors are from category A,
hence this new data point must belong
to category A.
 K-Nearest Neighbor(KNN) Algorithm
How to select the value of K in the K-NN Algorithm?
Below are some points to remember while selecting the value of K in the K-NN
algorithm:
•There is no particular way to determine the best value for "K", so we need to try
some values to find the best out of them. The most preferred value for K is 5.
•A very low value for K such as K=1 or K=2, can be noisy and lead to the effects of
outliers in the model.
•Large values for K are good, but it may find some difficulties.
Advantages of KNN Algorithm:
•It is simple to implement.
•It is robust to the noisy training data
•It can be more effective if the training data is large.
Disadvantages of KNN Algorithm:
•Always needs to determine the value of K which may be complex some time.
•The computation cost is high because of calculating the distance between the data
points for all the training samples.
K-Nearest Neighbour
Numericals
Example-1:
• Consider the data set
NAME AGE GENDER CLASS OF SPORTS
Here male is denoted
Ajay 32 0 Football
with numeric value 0
Mark 40 0 Neither and female with 1.
Sara 16 1 Cricket

Zaira 34 1 Cricket
Find in which class of
sports Angelina
Sachin 55 0 Neither
(Female, 1) will lie
Rahul 40 0 Cricket whose age is 5.
Pooja 20 1 Neither
Given K=3.
Smith 15 0 Cricket

Laxmi 55 1 Football

Michael 15 0 Football
Solution-1: Distance
between
Distance
Angelina
we have to find out the distance using: and

d=√((x2-x1)²+(y2-y1)²) , to find the Ajay 27.02

distance between any two points. Mark 35.01

So let’s find out the distance between Ajay Sara 11.00

(age1=32, gender1=0) and Angelina Zaira 29.00
(age2=5, gender2=1) using formula
Sachin 50.01
d=√((age2-age1)²+(gender2-gender1)²)
Rahul 35.01
d=√((5-32)²+(1-0)²)
d=√729+1 Pooja 15.00
d=27.02
Smith 10.05

Similarly, we find out all distance one by Laxmi 50.00

one.
Michael 10.05
So the value of k factor is 3 for Angelina. So Find 3 nearest
neighbours i.e. 3 values which have minimum distance.
And the closest to 3 neighbours is 10.05, 10.05, 11 that is closest
to Angelina are Smith , Michael and Sara.

Sara 11 cricket
Michael 10.5 football
smith 10.5 cricket

so according to KNN algorithm, Angelina will be in the class of

people who like cricket.
Example-2:
KNN Solved Example to predict Sugar of Diabetic Patient given
BMI and Age

Apply K nearest neighbor classifier to predict the diabetic patient with the
given features BMI, Age. If the training examples are given in table below.

BMI Age Sugar

33.6 50 1
Assume K=3, Predict a person with
BMI=43.6, and Age=40 have Sugar
26.6 30 O
or Not i.e Yes=1, No=0.
23.4 40 O
43.1 67 O
35.3 23 1
35.9 67 1
36.7 45 1
25.7 46 O
23.3 29 O
31 56 1
 Solution:Given the dataset and new test instance, we need to find the distance
from the new test instance to every training example. Here we use the euclidean
distance formula to find the distance.
In the next table, you can see the calculated distance from text example to training instances.
euclidean distance formula

BMI Age Sugar Formula Distance

33.6 50 1 √((43.6-33.6)^2+(40-50)^2 ) 14.14
26.6 30 O √((43.6-26.6)^2+(40-30)^2 ) 19.72
23.4 40 O √((43.6-23.4)^2+(40-40)^2 ) 20.20
43.1 67 O √((43.6-43.1)^2+(40-67)^2 ) 27.00
35.3 23 1 √((43.6-35.3)^2+(40-23)^2 ) 18.92
35.9 67 1 √((43.6-35.9)^2+(40-67)^2 ) 28.08
36.7 45 1 √((43.6-36.7)^2+(40-45)^2 ) 8.52
25.7 46 O √((43.6-25.7)^2+(40-46)^2 ) 18.88
23.3 29 O √((43.6-23.3)^2+(40-29)^2 ) 23.09
31 56 1 √((43.6-31)^2+(40-56)^2 ) 20.37
Once you calculate the distance, the next step is to find the nearest
neighbors based on the value of k.
In this case, the value of k is 3. Hence we need to find 3 nearest
neighbors.
Now, we need to apply the majority
voting technique to decide the
BMI Age Sugar Distance Rank resulting label from the new
example.
33.6 50 1 14.14 2
26.6 30 O 19.72 * Here the 1st and 2nd nearest
23.4 40 O 20.20 ** neighbors have target label 1 and
43.1 67 O 27.00 the 3rd nearest neighbor has target
label 0.
35.3 23 1 18.92 * Target label 1 has the majority.
35.9 67 1 28.08 Hence the new example is classified
36.7 45 1 8.52 1 as 1,
25.7 46 O 18.88 3
That is the diabetic patient
23.3 29 O 23.09 has Sugar.
31 56 1 20.37 **
So, Test Example BMI=43.6,
What Happen if K=5 and K=7???? Age=40, Sugar=1
Example-3:

Assume K=3.
Solution:
Example-4:
Use the following dataset, find the Class Label of the point P whose
Coordinate= (5, 7) using k-nearest neighbor. Assume K=3.
Point Coordinates Class Label
A1 (2,10) C2 Also, Analyze the
A2 (2, 6) C1 Result if K=5 and
A3 (11,11) C3 K=7??
A4 (6, 9) C2
A5 (6, 5) C1
A6 (1, 2) C1
A7 (5, 10) C2
A8 (4, 9) C2
A9 (10, 12) C3
A10 (7, 5) C1
A11 (9, 11) C3
A12 (4, 6) C1
A13 (3, 10) C2
A14 (3, 8) C2
A15 (6, 11) C2
Solution:
The following table shows the euclidean distance of P to each data point in
the dataset.
Point Coordinates Distance from P (5, 7)
A1 (2, 10) 4.24
A2 (2, 6) 3.16
A3 (11, 11) 7.21
A4 (6, 9) 2.23
A5 (6, 5) 2.23
A6 (1, 2) 6.40
A7 (5, 10) 3.0
A8 (4, 9) 2.23
A9 (10, 12) 7.07
A10 (7, 5) 2.82
A11 (9, 11) 5.65
A12 (4, 6) 1.41
A13 (3, 10) 3.60
A14 (3, 8) 2.23
A15 (6, 11) 4.12
After finding the distance of each point in the dataset to P, we will sort
the above points according to their distance from P (5, 7). After sorting,
we get the following table.
Point Coordinates Distance from P (5, 7)
A12 (4, 6) 1.41 C1
A4 (6, 9) 2.23 C2
A5 (6, 5) 2.23 C1
A8 (4, 9) 2.23 C2
A14 (3, 8) 2.23 C2
A10 (7, 5) 2.82 C1
A7 (5, 10) 3 C2
A2 (2, 6) 3.16
A13 (3, 10) 3.6
A15 (6, 11) 4.12
A1 (2, 10) 4.24
A11 (9, 11) 5.65
A6 (1, 2) 6.4
A9 (10, 12) 7.07
A3 (11, 11) 7.21
• As we have taken k=3, we will now consider the class labels
of three points in the dataset nearest to point P to classify
P In the above table, A12, A4, and A5 are the closest 3
neighbors of point P. Hence, we will use the class labels of
points A12, A4, and A5 to decide the class label for P.
• Now, point A12, A4, and A5 have the class labels C1, C2, and
C1 respectively. Among these points, the majority class label
is C1.
• Therefore, we will specify the class label of point P = (5, 7)
as C1.

Now, Analyze the Result if K=5 and K=7??

• If taken K=5, Now, point A12, A4, A5, A8 and A14 have the
class labels C1, C2, C1, C2 and C2 respectively.
Among these points, the majority class label is C2.
Therefore, Now we will specify the class label of
point P = (5, 7) as C2.

• If taken K=7, Now, point A12, A4, A5, A8,A14, A10 and A7
have the class labels C1, C2, C1, C2, C2, C1 and C2 respectively.
Among these points, the majority class label is C2.
Therefore, we will specify the class label of
point P = (5, 7) as C2.
 2. Locally weighted Linear Regression
• Locally weighted linear regression is the nonparametric regression methods that
combine k-nearest neighbor based machine learning. It is referred to as locally
weighted because for a query point the function is approximated on the basis of
data near that and weighted because the contribution is weighted by its distance
from the query point.

• Locally Weighted Regression (LWR) is a non-parametric, memory-based

algorithm, which means it explicitly retains training data and used it for every time
a prediction is made.

• To explain the locally weighted linear regression, we first need to understand the
linear regression. Consider equation as

• Linear Regression is a supervised learning algorithm used for computing linear

relationships between input (X) and output (Y). The steps involved in ordinary
linear regression are:

•
2. Locally weighted Linear Regression
• For this type of Data (Green Points)
Linear Regression is OK.

As evident from the image shown in

left side , this algorithm cannot be
used for making predictions when
there exists a non-linear relationship
between X and Y (Data set in Green
points).
In such cases, locally weighted linear
regression is used.
2. Locally weighted Linear Regression

Important
2. Locally weighted Linear Regression

For Example
2. Locally weighted Linear Regression
 2. Locally weighted Linear Regression
Summary
• For locally weighted linear regression:

Here, w(i) is the weight associated with each observation of training data. It can be
calculated by the given formula:
2. Locally weighted Linear Regression
Summary
• Or this can be represented in the form of a matrix calculation:

where x(i) is the

observation from the
training data and x is a
particular point from which
the distance is calculated
and T(tau) is the
bandwidth. Here, T(tau)
decides the amount of
fitness in the function, if
the function is closely
fitted, its value will be
Finally, we can calculate \theta with the following small. Therefore,
equation:
where, theta is the vector of linear vector, X and Y
is the Vector(matrix) of data set, and W is vector
of all weights
2. Locally weighted Linear Regression
Points to remember:
• Locally weighted linear regression is a supervised learning algorithm.

• It is a non-parametric algorithm.

• There exists No training phase. All the work is done during the testing
phase/while making predictions.

• The dataset must always be available for predictions.

• Locally weighted regression methods are a generalization of k-Nearest

Neighbour.

• In Locally weighted regression an explicit local approximation is

constructed from the target function for each query instance.

• The local approximation is based on the target function of the form like
constant, linear, or quadratic functions localized kernel functions.
3. Radial Basis Function Networks
• Radial Basis Function (RBF) Neural Networks are a specialized type
of Artificial Neural Network (ANN) used primarily for function
approximation tasks. Known for their distinct three-layer architecture
and universal approximation capabilities, RBF Networks offer faster
learning speeds and efficient performance in classification and
regression problems. This article delves into the workings, architecture,
and applications of RBF Neural Networks.
• What are Radial Basis Functions?
• Radial Basis Functions (RBFs) are a special category of feed-forward
neural networks comprising three layers:
[Link] Layer: Receives input data and passes it to the hidden layer.

[Link] Layer: The core computational layer where RBF neurons

process the data.

[Link] Layer: Produces the network’s predictions, suitable for

classification or regression tasks.
3. Radial Basis Function Networks
• How Do RBF Networks Work?
• RBF Networks are conceptually similar to K-Nearest Neighbor (k-NN)
models, though their implementation is distinct. The fundamental idea is
that an item's predicted target value is influenced by nearby items with
similar predictor variable values. Here’s how RBF Networks operate:

1. Input Vector: The network receives an n-dimensional input vector that

needs classification or regression.

2. RBF Neurons: Each neuron in the hidden layer represents a prototype

vector from the training set. The network computes the Euclidean distance
between the input vector and each neuron's center.

3. Activation Function: The Euclidean distance is transformed using a Radial

Basis Function (typically a Gaussian function) to compute the neuron’s
activation value. This value decreases exponentially as the distance
increases.

4. Output Nodes: Each output node calculates a score based on a weighted

sum of the activation values from all RBF neurons. For classification, the
category with the highest score is chosen.
3. Radial Basis Function Networks
Key Characteristics of RBFs
• Radial Basis Functions: These are real-valued functions dependent solely on the
distance from a central point. The Gaussian function is the most commonly used type.
• Dimensionality: The network's dimensions correspond to the number of predictor
variables.
• Center and Radius: Each RBF neuron has a center and a radius (spread). The radius
affects how broadly each neuron influences the input space.

Architecture of RBF Networks

The architecture of an RBF Network typically
consists of three layers:
Input Layer
•Function: After receiving the input features, the
input layer sends them straight to the hidden layer.

•Components: It is made up of the same number

of neurons as the characteristics in the input data.
One feature of the input vector corresponds to
each neuron in the input layer. Architecture
3. Radial Basis Function Networks
• Architecture of RBF Networks
Hidden Layer

• Function: This layer uses radial basis functions (RBFs) to conduct the non-linear
transformation of the input data.

• Components: Neurons in the buried layer apply the RBF to the incoming data. The
Gaussian function is the RBF that is most frequently utilized.

• RBF Neurons: Every neuron in the hidden layer has a spread parameter (σ) and a
center, which are also referred to as prototype vectors. The spread parameter
modulates the distance between the center of an RBF neuron and the input vector,
which in turn determines the neuron's output.

Output Layer

• Function: The output layer uses weighted sums to integrate the hidden layer
neurons' outputs to create the network's final output.

• Components: It is made up of neurons that combine the outputs of the hidden layer
in a linear fashion. To reduce the error between the network's predictions and the
actual target values, the weights of these combinations are changed during training.
3. Radial Basis Function Networks
Training Process of radial basis function neural network
• An RBF neural network must be trained in three stages: choosing the center's, figuring out the spread
parameters, and training the output weights.

Step 1: Selecting the Centers

• Techniques for Centre Selection: Centre's can be picked at random from the training set of data or by
applying techniques such as k-means clustering.
• K-Means Clustering: The center's of these clusters are employed as the center's for the RBF neurons in
this widely used center selection technique, which groups the input data into k groups.
Step 2: Determining the Spread Parameters
• The spread parameter (σ) governs each RBF neuron's area of effect and establishes the width of the
RBF.
• Calculation: The spread parameter can be manually adjusted for each neuron or set as a constant for all
neurons. Setting σ based on the separation between the center's is a popular method, frequently
accomplished with the help of a heuristic like dividing the greatest distance between canters by the square
root of twice the number of center's
Step 3: Training the Output Weights
• Linear Regression: The objective of linear regression techniques, which are commonly used to estimate
the output layer weights, is to minimize the error between the anticipated output and the actual target
values.
• Pseudo-Inverse Method: One popular technique for figuring out the weights is to utilize the pseudo-
inverse of the hidden layer outputs matrix.
3. Radial Basis Function Networks
Advantages of RBF Networks
1. Universal Approximation: RBF Networks can approximate any continuous function with
arbitrary accuracy given enough neurons.
2. Faster Learning: The training process is generally faster compared to other neural network
architectures.
3. Simple Architecture: The straightforward, three-layer architecture makes RBF Networks
easier to implement and understand.
Applications of RBF Networks
• Classification: RBF Networks are used in pattern recognition and classification tasks, such
as speech recognition and image classification.
• Regression: These networks can model complex relationships in data for prediction tasks.
• Function Approximation: RBF Networks are effective in approximating non-linear functions.
Example of RBF Network
• Consider a dataset with two-dimensional data points from two classes. An RBF Network
trained with 20 neurons will have each neuron representing a prototype in the input space.
The network computes category scores, which can be visualized using 3-D mesh or contour
plots. Positive weights are assigned to neurons belonging to the same category and negative
weights to those from different categories. The decision boundary can be plotted by
evaluating scores over a grid.
3. Radial Basis Function Networks
Radial Basis Function Kernel
What is Kernel Function?
• Kernel Function is used to transform n-dimensional input to m-dimensional input, where m is
much higher than n then find the dot product in higher dimensional efficiently. The main idea
to use kernel is: A linear classifier or regression curve in higher dimensions becomes a Non-
linear classifier or regression curve in lower dimensions.

• Radial Basis Function Kernel

• The Radial Basis Function (RBF) kernel, also known as the Gaussian kernel, is one of the
most widely used kernel functions. It operates by measuring the similarity between data
points based on their Euclidean distance in the input space. Mathematically, the RBF kernel
between two data points, x and x’, is defined as:

K(x,x’)=exp(−∣x–x’∣2/2σ2)
where, ∣x–x’∣2 represents the squared Euclidean distance between the two data points.

• σ is a parameter known as the bandwidth or width of the kernel, controlling the smoothness
of the decision boundary.

• If we expand the above exponential expression, It will go upto infinite power of x and x’, as
expansion of ex contains infinite terms upto infinite power of x hence it involves terms upto
infinite powers in infinite dimension.
3. Radial Basis Function Networks
• Why Radial Basis Kernel Is much powerful?
• The main motive of the kernel is to do calculations in any d-dimensional space where d
> 1, so that we can get a quadratic, cubic or any polynomial equation of large degree
for our classification/regression line. Since Radial basis kernel uses exponent and as
we know the expansion of ex gives a polynomial equation of infinite power, so using
this kernel, we make our regression/classification line infinitely powerful too.
• Some Complex Dataset Fitted Using RBF Kernel easily:

• The RBF kernel computes a similarity score between data points based on their
distance in the input space. It assigns high similarity values to points that are close to
each other and lower values to points that are farther apart. The
parameter σ determines the scale of the distances over which points are considered
similar.

Without Radial Fitting

3. Radial Basis Function Networks
Practical Applications of Radial Basis Function Kernel
• The versatility and effectiveness of the RBF kernel make it suitable for various
machine learning tasks, including:

• Support Vector Machines (SVMs): In SVMs, the RBF kernel is commonly used
to map data points into a higher-dimensional space where a linear decision
boundary can be constructed to separate classes.

• Kernelized Ridge Regression: In regression tasks, the RBF kernel can be used
to perform kernelized ridge regression, allowing the model to capture nonlinear
relationships between features and target variables.

• Clustering: The RBF kernel can also be employed in kernelized clustering

algorithms such as spectral clustering, where it helps in capturing the local
structure of the data for grouping similar data points together.

• Dimensionality Reduction: In manifold learning and nonlinear dimensionality

reduction techniques like t-Distributed Stochastic Neighbor Embedding (t-SNE),
the RBF kernel is used to define the similarity between data points in the high-
dimensional space.
4. Case Based Learning (Reasoning)
• Case-based learning (CBL) is a machine learning method in
which a system learns from solving previous cases similar to
the current task.
• In this method, the system uses a case base that contains a
number of previously solved cases that are similar to the
current task. The system uses this information to search for
similar cases and apply the previous solution to the current
task.
• Case-based learning is used in a variety of applications, such
as medical diagnostic problem solving, pattern recognition,
decision making, task planning, among others.
4. Case Based Learning (Reasoning)
Basis of CBR :

Here, we will discuss the basis key parameters of CBR.

[Link]-
The identical steps executed under the same circumstances will tend to
have the same or alike outcomes.

[Link]-
Experiences tend to repeat themselves.

[Link]-
Minor switch in the circumstances require merely small changes in the
explanation and in the effect.

[Link]-
When things replicate, the dissimilarities tend to be minute, and the small
differences are uncomplicated to repay for.
4. Case Based Learning (Reasoning)
Working Cycle of CBR :
Here, we will discuss the working cycle of CBR. The CBL process consists of four
phases:
• Case retrieval –
After the issue result has been judged, the best coordinating case is explored in
the case base and an estimated solution is retrieved.

• Case adaptation –
The recovered result is adjusted to fit finer the new issue.

• Solution evaluation –
The modified solution can be judged either before the solution is applied to the
complication or after the solution has been applied, the modified solution must be
adapted again or more cases should be modified.

• Case- based updating –

If the solution was verified as correct the new case may be added to the case.
4. Case Based Learning (Reasoning)
Knowledge in CBR :

Vocabulary includes the knowledge necessary for choosing the features

utilized to describe the cases.
• Case features have to be specified so that they can be helpful in
retrieving other cases, which contains useful solutions to similar
problems.

• Similarity estimation include the mastery about the similarity measure

itself and the grip used to choose the most efficient firm of the employed
case base and the most suitable case-retrieval method.

• Modification knowledge includes the knowledge necessary for executing

the adaptation and evaluation phases of the CBR working cycle.

• Cases contain knowledge about solved problem instances and, in many

CBR systems, this represents the knowledge that the system acquire
during use.
4. Case Based Learning (Reasoning)
• Benefits of CBR :
Here, we will discuss the benefits of CBR.
• CBR supports ease of knowledge elicitation.
• CBR works efficiently in the absence of problem solving bias.
• It is suitable for multiplex and not completely formalized result
position.
• It holds up ease of explanation.
• It carry ease of maintenance.
• Limitations :
Here, we will discuss the limitations of CBR.
• CBR finds it complex to handle large case bases.
• It is almost impossible for CBR to solve dynamic domain
problems
• CBR method is unable in handling noisy data