Adama Science and Technology University-Dm-Lab

Adama Science and Technology University
School of Electrical Engineering and Computing

Computer Science and Engineering Program
COMPUTER SCIENCE AND ENGINEERING

LAB MANUAL
OF
DATA MINING (CSE5317)
IV B. Tech I semester (Elective)

Prepared by
Dr.T.GOPI KRISHNA
Assistant Professor
Adama Science and Technology University Exp No__ Date____
SNo Experiment Name Date

Listing of categorical attributes and the real-valued attributes separately.
Rules for identifying attributes.
Training a decision tree.
Test on classification of decision tree.
Testing on the training set .
Using cross –validation for training.
Significance of attributes in decision tree.

Trying generation of decision tree with various number of decision tree.
Find out differences in results using decision tree and cross-validation on a

data set.
Decision trees.
Reduced error pruning for training Decision Trees using cross-validation
Convert a Decision Trees into "if-then-else rules".
Roll No.___________________ Page 1

WEKA INTRODUCTION
Weka is a collection machine learning algorithms for data mining tasks. The
algorithms can either be applied directly to a dataset or called from your own Java
code. Weka contains tools for data pre-processing, classification, regression,
clustering, association rules, and visualization. It is also well-suited for developing
new machine learning schemes.
Weka is open source software issued under the GNU general Public License.
Weka stands for the Waikato Environment for Knowledge Analysis, which was
developed at the University of Waikato in New Zealand. WEKA is extensible and has
become a collection of machine learning algorithms for solving real-world data
mining problems. It is written in Java and runs on almost every platform.
WEKA is easy to use and to be applied at several different levels. You can
access the WEKA class library from your own Java Program, and implemented new
machine learning algorithms.
There are three major implemented schemes, WEKA.
1. Implemented schemes for classification,
2. Implemented schemes for numeric prediction,
3. Implemented “mete-schemes”.
Besides actual learning schemes, WEKA also contains a large variety tools that
can be used for pre-processing datasets, so that you can focus on your algorithm
without considering too much details as reading the data from files, implementing
filtering algorithm and providing code to evaluate the results.
The weka GUI chooser provides a starting point launching
Weka’s main GUI applications and supporting tools. If one prefers a MDI
(“Multiple Document Interface”) appearance, then this is provided by an alternative
launcher called “Main” (class weka.gui.Main).
Roll No.___________________ Page 2

The GUI Chooser consists of four buttons-one for each of four major Weka
applications and four for menus.
The buttons can be used to start the following applications:

 Explorer An environment for exploring data with WEKA.
conducting
Experimenter An environment for supporting experiments and
statistical tests between learning schemes.
 Knowledge Flow this environment supports essentially the same

functions as the Explorer but with a drag and drop interface. One advantage
is that is supports incremental learning.
 Simple CLI Provides a simple command-line interface that allows

direct execution of WEKA commands for operating systems that do not
provide their own command line interface.
Weka GUI Chooser
Roll No.___________________ Page 3

Credit Risk Assessment
Description: The business of banks is making loans. Assessing the credit worthiness of an
applicant is of crucial importance. You have to develop a system to help a loan officer decide
whether the credit of a customer is good, or bad. A bank’s business rules regarding loans must
consider two opposing factors. On the one hand, a bank wants to make as many loans as possible.
Interest on these loans is the ban’s profit source. On the other hand, a bank cannot afford to make
too many bad loans. Too many bad loans could lead to the collapse of the bank. The bank’s loan
policy must involve a compromise not too strict, and not too lenient. To do the assignment, you first
and foremost need some knowledge about the world of credit. You can acquire such knowledge in a
number of ways.
1. Knowledge Engineering. Find a loan officer who is willing to talk. Interview her and try
to represent her knowledge in the form of production rules.
2. Books. Find some training manuals for loan officers or perhaps a suitable textbook on
finance. Translate this knowledge from text form to production rule form.
3. Common sense. Imagine yourself as a loan officer and make up reasonable rules which
can be used to judge the credit worthiness of a loan applicant.
4. Case histories. Find records of actual cases where competent loan officers correctly
judged when not to, approve a loan application.
The German Credit Data:
Actual historical credit data is not always easy to come by because of confidentiality rules. Here
is one such dataset (original) Excel spreadsheet version of the German credit data (download
from web).
In spite of the fact that the data is German, you should probably make use of it for
this assignment, (Unless you really can consult a real loan officer!)
A few notes on the German dataset:
 DM stands for Deutsche Mark, the unit of currency, worth about 90 cents Canadian
(but looks and acts like a quarter).
 Owns telephone: German phone rates are much higher than in Canada so fewer people
own telephones.
 Foreign worker: There are millions of these in Germany (many from Turkey). It is very
hard to get German citizenship if you were not born of German parents.
 There are 20 attributes used in judging a loan applicant. The goal is the classify the
applicant into one of two categories, good or bad.
Roll No.___________________ Page 4
Adama Science and Technology Exp No__ Date____
University EXPERIMENT-1
List all the categorical (or nominal) attributes and the real-valued
attributes separately.
Aim: To list all the categorical (or nominal) attributes and the real valued attributes using Weka
mining tool.
Tools/ Apparatus: Weka Mining tool.
Procedure:
1) Open the Weka GUI Chooser.
2) Select EXPLORER present in Applications.
3) Select Preprocess Tab.
4) Go to OPEN file and browse the file that is already stored in the system “German credit
data.arff”
5) Clicking on any attribute in the left panel will show the basic statistics on that selected attribute.
Sample Output:
Roll No.___________________ Page 5

6) Select choose button then select weka->filters->unsupervised->attribute and here select the
option as remove type
7) Click anywhere on Remove type white box which is beside the choose button to open
weka.gui.GenericObjectEditor window.
8) From this select the attribute type as delete nominal attributes and select the option
for invertSelection as true.
9) Click on ok button and then click on Apply button, then it will show the nominal
attributes as follows
Roll No.___________________ Page 6

10) Click on undo button and then repeat the above steps for displaying all numerical attributes
by selecting the attribute type as Delete numeric Attributes.
Output:
Categorical/ Nominal Attributes:
1. Checking_status 2.Credit_history 3.Purpose 4.Savings_status
5. Employment 6. Personal_status 7.Other_parties 8.Property_magnitude 9.

Other_payment_plans 10. Housing 11.Job 12.own_telephone
13. foreign_worker 14. Class
Numeric Attributes:
1. Duration 2. Credit_amount 3. Installment_commitment 4. Residece_since 5. Age

6. Existing_credits 7. Num_dependents.
Result: Hence all categorical and Numerical attributes are displayed.
Roll No.___________________ Page 7

What attributes do you think might be crucial in making the credit
assessment? Come up with some simple rules in plain English using your
selected attributes.
Aim: To identify the rules with some of the important attributes by
a) Manually and
b) Using Weka
Tools/ Apparatus: Weka mining tool.
According to me the following attributes may be crucial in making the credit risk assessment.
1. Credit_history
2. Employment
3. Property_magnitude
4. job
5. duration
6. crdit_amount
7. installment
8. existing credit
Based on the above attributes, we can make a decision whether to give credit or not.
Theory:
Association rule mining is defined as: Let be a set of n binary attributes called items. Let be
a set of transactions called the database. Each transaction in D has a unique transaction ID and
contains a subset of the items in I. A rule is defined as an implication of the form X=>Y where X,
Y C I and X Π Y=Φ. The sets of items (for short item sets) X and Y are called antecedent (left hand
side or LHS) and consequent (righthandside or RHS) of the rule respectively.
The set of items is I = {milk, bread, butter, beer} and a small database containing the items
(1 codes presence and 0 absence of an item in a transaction) is shown in the table to the right. An
example rule for the supermarket could be meaning that if milk and bread is bought, customers
also buy butter.
Roll No.___________________ Page 8

To select interesting rules from the set of all possible rules, constraints on various measures
of significance and interest can be used. The best known constraints are minimum thresholds on
support and confidence. The support supp(X) of an item set X is defined as the proportion of
transactions in the data set which contain the item set. In the example database, the item set {milk,
bread} has a support of 2 / 5 = 0.4 since it occurs in 40% of all transactions (2 out of 5 transactions).
The confidence of a rule is defined. For example, the rule has a confidence of 0.2 / 0.4
= 0.5 in the database, which means that for 50% of the transactions containing milk and bread the
rule is correct. Confidence can be interpreted as an estimate of the probability P(Y | X), the
probability of finding the RHS of the rule in transactions under the condition that these transactions
also contain the LHS.
ALGORITHM:
Association rule mining is to find out association rules that satisfy the predefined minimum
support and confidence from a given database. The problem is usually decomposed into two sub
problems. One is to find those item sets whose occurrences exceed a predefined threshold in the
database; Those item sets are called frequent or large item sets. The second problem is to generate
association rules from those large item sets with the constraints of minimal confidence.
Suppose one of the large item sets is Lk, Lk = {I1, I2, … , Ik}, association rules with this item sets
are generated in the following way: the first rule is {I1, I2, … , Ik1} and {Ik}, by checking the
confidence this rule can be determined as interesting or not. Then other rule are generated by
deleting the last items in the antecedent and inserting it to the consequent, further the confidences of
the new rules are checked to determine the interestingness of them. Those processes iterated until
the antecedent becomes empty. Since the second sub problem is quite straight forward, most of the
researches focus on the first sub problem. The Apriori algorithm finds the frequent sets L In
Database D.
· Find frequent set Lk − 1.
· Join Step.
.Ck is generated by joining Lk − 1with itself
· Prune Step.
Roll No.___________________ Page 9

.Any (k − 1) item set that is not frequent cannot be a subset of a frequent k item set, hence should be
removed, Where
. (Ck: Candidate item set of size k)
· (Lk: frequent item set of size k)
Apriori Pseudo code
Apriori (T,£)
L< {Large 1itemsets that appear in more than transactions }
K<2
While L(k1)≠ Φ
C(k)<Generate( Lk − 1)
for transactions t € T
C(t)Subset(Ck,t)
for candidates c € C(t)
count[c]<count[ c]+1
L(k)<{ c € C(k)| count[c] ≥ £
K<K+ 1
return Ụ L(k) k
Procedure:
1) Given the Bank database for mining.
2) Select EXPLORER in WEKA GUI Chooser.
3) Load “Bank.csv” in Weka by Open file in Preprocess tab.
4) Select only Nominal values.
5) Go to Associate Tab.
6) Select Apriori algorithm from Choose button present in
Associator weka.associations.Apriori -N 10 -T 0 -C 0.9 -D 0.05 -U 1.0 -M 0.1 -S -1.0 -c -1
7) Select Start button
Roll No.___________________ Page 10

8) Now we can see the sample rules.
Sample Output:
Roll No.___________________ Page 11

One type of model that you can create is a Decision Tree - train a
Decision Tree using the complete dataset as the training data. Report the
model obtained after training.
Aim: To create a Decision tree by training data set using Weka mining tool.
Theory:
Classification is a data mining function that assigns items in a collection to target categories
or classes. The goal of classification is to accurately predict the target class for each case in the
data. For example, a classification model could be used to identify loan applicants as low, medium,
or high credit risks. A classification task begins with a data set in which the class assignments are
known. For example, a classification model that predicts credit risk could be developed based on
observed data for many loan applicants over a period of time.
In addition to the historical credit rating, the data might track employment history, home
ownership or rental, years of residence, number and type of investments, and so on. Credit rating
would be the target, the other attributes would be the predictors, and the data for each customer
would constitute a case. Classifications are discrete and do not imply order. Continuous, floating
point values would indicate a numerical, rather than a categorical, target. A predictive model with a
numerical target uses a regression algorithm, not a classification algorithm.
The simplest type of classification problem is binary classification. In binary classification,

the target attribute has only two possible values: for example, high credit rating or low credit rating.
Multiclass targets have more than two values: for example, low, medium, high, or unknown credit
rating. In the model build (training) process, a classification algorithm finds relationships between
the values of the predictors and the values of the target. Different classification algorithms use
different techniques for finding relationships. These relationships are summarized in a model,
which can then be applied to a different data set in which the class assignments are unknown.
Classification models are tested by comparing the predicted values to known target values in
a set of test data. The historical data for a classification project is typically divided into two data
Roll No.___________________ Page 12

sets: one for building the model; The other for testing the model. Scoring a classification model
results in class assignments and probabilities for each case. For example, a model that classifies
customers as low, medium, or high value would also predict the probability of each classification
for each customer. Classification has many applications in customer segmentation, business
modeling, marketing, credit analysis, and biomedical and drug response modeling.
Different Classification Algorithms
Oracle Data Mining provides the following algorithms for classification:
Decision Tree
Decision trees automatically generate rules, which are conditional statements that reveal
the logic used to build the tree.
Naive Bayes
Naive Bayes uses Bayes' Theorem, a formula that calculates a probability by counting the
frequency of values and combinations of values in the historical data.
Procedure:
1) Open Weka GUI Chooser.
4) Go to OPEN file and browse the file that is already stored in the system “bank.csv”.
5) Go to Classify tab.
6) Here the c4.5 algorithm has been chosen which is entitled as j48 in Java and can be selected
by clicking the button choose
7) and select tree j48
8) Select Test options “Use training set”
9) if need select attribute.
10) Click Start .
11) Now we can see the output details in the Classifier output.
Roll No.___________________ Page 13

12) Right click on the result list and select” visualize tree “option .
Sample output:
Roll No.___________________ Page 14

Roll No.___________________ Page 15

Suppose you use your above model trained on the complete dataset, and
classify credit good/bad for each of the examples in the dataset. What % of
examples can you classify correctly? (This is also called testing on the
training set) Why do you think you cannot get 100 % training accuracy?
Aim: To find the percentage of examples that are classified correctly by using the above created
decision tree model? ie. Testing on the training set.
Theory:
Naive Bayes classifier assumes that the presence (or absence) of a particular feature of a
class is unrelated to the presence (or absence) of any other feature. For example, a fruit may be
considered to be an apple if it is red, round, and about 4" in diameter. Even though these
features depend on the existence of the other features, a naive Bayes classifier considers all of
these properties to independently contribute to the probability that this fruit is an apple.
An advantage of the naive Bayes classifier is that it requires a small amount of training
data to estimate the parameters (means and variances of the variables) necessary for classification.
Because independent variables are assumed, only the variances of the variables for each class need
to be determined and not the entire covariance matrix The naive Bayes probabilistic model :
DESCRIPTION:
 Classification
Predicts categorical class labels (discrete or nominal) Classifies data (constructs a model) based
on the training set and the values (class labels) in a classifying attribute and uses it in classifying
new data
 Prediction
Models continuous-valued functions, i.e., predicts unknown or missing values
Typical applications
Credit approval
Target marketing
Medical diagnosis
Fraud detection
Roll No.___________________ Page 16

Training Data
Data objects whose class labels are known.

Accuracy
The Accuracy of a classifier on a given test set is the percentage of test set tuples that
are correctly classified by the classifier.
Procedure:
2) Use the Weka GUI Chooser.
7) Choose Classifier “Tree”
8) Select “NBTree” i.e., Navie Baysiean tree.
9) Select Test options “Use training set”
11) now Start weka.
12) now we can see the output details in the Classifier output.
Roll No.___________________ Page 17

Sample Output:
=== Evaluation on training set ===
=== Summary ===
Correctly Classified Instances 554 92.3333 %
Incorrectly Classified Instances 46 7.6667 %
Kappa statistic 0.845
Mean absolute error 0.1389
Root mean squared error 0.2636
Relative absolute error 27.9979 %
Root relative squared error 52.9137 %
Total Number of Instances 600
=== Detailed Accuracy By Class ===
TP Rate FP Rate Precision Recall F-Measure ROC Area Class
0.894 0.052 0.935 0.894 0.914 0.936 YES
0.948 0.106 0.914 0.948 0.931 0.936 NO
Weighted Avg. 0.923 0.081 0.924 0.923 0.923 0.936
=== Confusion Matrix ===
a b <-- classified as
245 29 | a = YES 17
309 | b = NO
Roll No.___________________ Page 18

Suppose you use your above model trained on the complete dataset, and
classify credit good/bad for each of the examples in the dataset. What % of
examples can you classify correctly? (This is also called testing on the
training set) Why do you think you cannot get 100 % training accuracy?
Aim: To create a Decision tree by cross validation training data set using Weka mining tool.
Tools/ Apparatus: Weka mining tool..
Theory:
Decision tree learning, used in data mining and machine learning, uses a decision tree as a
predictive model which maps observations about an item to conclusions about the item's target
value In these tree structures, leaves represent classifications and branches represent conjunctions of
features that lead to those classifications. In decision analysis, a decision tree can be used to visually
and explicitly represent decisions and decision making. In data mining, a decision tree describes
data but not decisions; Rather the resulting classification tree can be an input for decision making.
This page deals with decision trees in data mining.
Decision tree learning is a common method used in data mining. The goal is to create a
model that predicts the value of a target variable based on several input variables. Each interior
node corresponds to one of the input variables; There are edges to children for each of the possible
values of that input variable. Each leaf represents a value of the target variable given the values of
the input variables represented by the path from the root to the leaf. A tree can be "learned" by
splitting the source set into subsets based on an attribute value test. This process is repeated on each
derived subset in a recursive manner called recursive partitioning. The recursion is completed when
the subset at a node all has the same value of the target variable, or when splitting no longer adds
value to the predictions.
In data mining, trees can be described also as the combination of mathematical and
computational techniques to aid the description, categorization and generalization of a given set of
data.
Data comes in records of the form:
(x, y) = (x1, x2, x3..., xk, y)

Roll No.___________________ Page 19
Procedure:
2) Use the Weka GUI Chooser.
7) Choose Classifier “Tree”
8) Select J48
9) Select Test options “Cross-validation”.
10) Set “Folds” Ex:10
12) now Start weka.
13) now we can see the output details in the Classifier output.
th
14) Compare the output results with that of the 4 experiment
15) check whether the accuracy increased or decreased?
Sample Output:
Roll No.___________________ Page 20

=== Stratified cross-validation ===
=== Summary ===
=== Detailed Accuracy By Class ===
TP Rate FP Rate Precision Recall F-Measure ROC Area Class
0.861 0.071 0.911 0.861 0.886 0.883 YES
0.929 0.139 0.889 0.929 0.909 0.883 NO
Weighted Avg. 0.898 0.108 0.899 0.898 0.898 0.883
=== Confusion Matrix ===
a b <-- classified as
236 38 | a = YES 23
303 | b = NO
Roll No.___________________ Page 21

Is testing on the training set as you did above a good idea? Why? Why not?
Bad idea, if take all the data into training set. Then how to test the above classification
is correctly or not?
According to the rules, for the maximum accuracy, we have to take 2/3 of the dataset as
training set and the remaining 1/3 as test set. But here in the above model we have taken complete
dataset as training set which results only 85.5% accuracy.
This is done for the analyzing and training of the unnecessary attributes which does not make
a crucial role in credit risk assessment. And by this complexity is increasing and finally it leads to the
minimum accuracy. If some part of the dataset is used as a training set and the remaining as test set
then it leads to the accurate results and the time for computation will be less.
This is why; we prefer not to take complete dataset as training set.
Use Training Set Result for the table GermanCreditData:
Roll No.___________________ Page 22

One approach for solving the problem encountered in the previous question
is using cross-validation? Describe what cross-validation is briefly. Train a
Decision Tree again using cross-validation and report your results. Does
your accuracy increase/decrease? Why?
Aim: To develop a decision tree and cross validate accuracy of data set is increasing or
decreasing.
Description:
Cross validation is a common technique for assessing classifier accuracy, based on

randomly sampled partitions of the given data. In k-fold cross validation the initial data are
randomly portioned into k mutually exclusive subsets or “folds”, s1,s2…..sk, each of
approximately equal size. Training and testing is performed k times. In iteration I, the subset Si is
reserved as the test set, and the remaining subset are collectively used to train the classifier. That
is the classifier of the first iteration is trained on subsets s2,…..sk and tested on S2 and so on .The
accuracy estimate is the overall number of correct classifications from the k iterations, divided by
the total number of samples in the initial data.
Procedure:
In weka tool using cross validation testing method, first once the dataset is been
given to the tool using explorer and select all attributes of the dataset using “ALL” button and
select Classify menu option, select classifier as “J48”, Use the test option as cross validation
where folds will be 10 by default selection by weka and click on start and we can see the results of
this method.
Here accuracy of this method using the same data set when compared to decision
tree does not vary. We can try out for various combinations of this option of cross validation with
different folding values like 2, 5, 8, 10(default), 15 20 50 and see the accuracy. Finally with this
method we can come to a conclusion that in cross validation the folds should not be varies neither
high nor very low.
Roll No.___________________ Page 23

Sample Output:
Number of Leaves : 103

Size of the tree : 140
Time taken to build model: 0.1 seconds
=== Stratified cross-validation ===
=== Summary ===
Coverage of cases (0.95 level) 92.8 %
Mean rel. region size (0.95 level)91.7 %
Roll No.___________________ Page 24

Check to see if the data shows a bias against “foreign workers” (attribute
20), OR “personal status” (attribute 9).
One way to do this (perhaps rather simple method) is to remove these
attributes from the dataset and see if the decision tree created in those
cases is significantly different from the full dataset case which you have
already done. To remove an attribute you can use the preprocess tab in
weka’s GUI Explorer. Did removing these attributes have any significant
effect? Discuss
AIM: To check accuracy of German credit data after removing foreign_workers and
personal_status.
PROCEDURE:
1. Open the Weka GUI Chooser.

2. Select Explorer present Applications.
3. Select Preprocess Tab.
4. Go to Open file… and browse the file that is already stored in the system “German
credit data.arff”.
5. Clicking on any attribute in the left panel will show the basic statistics on that selected
attribute then we can list the following.
Roll No.___________________ Page 25

Sample Output:
6) Check foreign_workers and personal_status and remove those attributes.
Roll No.___________________ Page 26

7. Select choose button then select weka->trees->J48, select Use training set option and click
start.
8. Accuracy before removing foreign_worker and personal_status.

9. After removing foreign_worker and personal_status.
Output:
Result:
By removing foreign_workers and personal_status from German credit data
accuracy is increased and time has been reduced to some extent.
Roll No.___________________ Page 27

Roll No.___________________ Page 28

EXPERIMENT 9
Another question might be, do you really need to input so
many attributes to get good results? Maybe only a few
would do. For example, you could try just having attributes
2, 3, 5, 7, 10, 17 (and 21, the class attribute (naturally)).
Try out some combinations. (You had removed two attributes
in previous problem Remember to reload the ARFF data file
to get all the attributes initially before you start selecting
the ones you want.)
AIM: To check accuracy of German credit data after removing

selected attributes like 2, 3, 5,7,10,17 and 21.
PROCEDURE:
1. Open the Weka GUI Chooser.
2. Select Explorer present Applications.
3. Select Preprocess Tab.
4. Go to Open file… and browse the file that is already stored
in the system “German credit data.arff”.

5. Clicking on any attribute in the left panel will show the
basic statistics on that selected attribute then we can list

the following.
36 | P a g e
6. Click on invert tab.
37 | P a g e
7. 2,3,5,7,10,17,21 except these attribute all attributes are
removed and check accuracy for these attributes.
8. Select choose button then select weka->trees->J48, select
Use training set option and click start.

38 | P a g e
Here Accuacy is decreased.
OUTPUT
Here Accuracy is decreased and check randomly selected

attributes also.
RESULT: Hence accuracy is decreased by removing
selected/random attributed.
39 | P a g e
EXPERIMENT 10
Sometimes, the cost of rejecting an applicant who actually
has a good credit
Case 1. Might be higher than accepting an applicant who
has bad credit
Case 2. Instead of counting the misclassifications equally in
both cases, give a higher cost to the first case (say cost 5)
and lower cost to the second case. You can do this by using
a cost matrix in WEKA.
Train your Decision Tree again and report the Decision Tree
and cross-validation results. Are they significantly different
from results obtained in problem 9 (using equal cost)?
AIM: To generate a report for decision tree and cross validation

results by using two cases for cost of rejecting.
Case 1: Might be higher than accepting an applicant who has bad
credit say cost 5.
Case 2: Instead of counting the misclassifications equally in both
cases, gives a higher cost to first case and lower cost to the second
case.
DESCRIPTION:
In the Problem 9, we used equal cost and we trained the
decision tree. But here, we consider two cases with different cost.
Let us take cost 5 in case 1 and cost 2 in case 2.
When we give such costs in both cases and after training the
decision tree, we can observe that almost equal to that of the
decision tree obtained in problem 9. Case1 (cost 5) Case2 (cost 5)
Total Cost 4852 1963

Average Cost 4.852 1.963
We don‘t find this cost factor in problem 9. As there we use equal

cost. This is the major difference between the results of problem 9
and problem 10.
The cost matrices we used here:

Case 1: 5 1
15
Case 2: 2 1
12
PROCEDURE:
40 | P a g e
Step1: Select classify tab.
Step2: Select More Option from Test Option.
Step3: Tick on cost sensitive Evaluation and go to set.
Step4: Set classes as 2.
Step5: Click on Resize and then we‘ll get cost matrix.
Step6: Then change the 2nd entry in 1st row and 2nd entry in 1st
column to 5.0
Step7: Then confusion matrix will be generated and you can find
out the difference between good and bad attribute.
Step8: Check accuracy whether it‘s changing or not.
OUTPUT
41 | P a g e
42 | P a g e
Case 1:
Total Cost 4852
Average Cost 4.852
43 | P a g e
Case 2:
Total Cost 1963
Average Cost 1.963
44 | P a g e
Result: Hence Two cases cost are tested and no change/ variation
in accuracy and dataset is not effected.
45 | P a g e
EXPERIMENT 11
Do you think it is a good idea to prefer simple decision trees
instead of having long complex decision trees? How does the
complexity of a Decision Tree relate to the bias of the
model?
AIM: To check making simple decision tree is good idea instead of
making complex decision.
Description:
When we consider long complex decision trees, we will have
many unnecessary attributes in the tree which results in increase
of the bias of the model. Because of this, the accuracy of the
model can also effect.
This problem can be reduced by considering simple
decision tree. The attributes will be less and it decreases the
bias of the model. Due to this the result will be more accurate.
So it is a good idea to prefer simple decision trees instead of long
complex trees.
Procedure:
Open any existing ARFF file e.g labor.arff.

1. Open any existing Arff file. E.g: labour.arff
2. In preprocess tab, select ALL to select all the attributes.
3. Go to classify tab and then use traning set with J48
algorithm.
46 | P a g e
4. To generate the decision tree, right click on the result list
and select visualize tree option, by which the decision tree
will be generated
5. Right click on J48 algorithm to get Generic Object

Editor window
6. In this,make the unpruned option as true .
7. Then press OK and then start. we find the tree will become
more complex if not pruned
47 | P a g e
8. The tree has become more complex
48 | P a g e
Result: Yes, It is a good idea to prefer simple decision
trees instead of having long complex decision trees.
49 | P a g e
EXPERIMENT 12
You can make your Decision Trees simpler by pruning the
nodes. One approach is to use Reduced Error Pruning -
Explain this idea briefly. Try reduced error pruning for
training your Decision Trees using cross-validation (you can
do this in WEKA) and report the Decision Tree you obtain?
Also, report your accuracy using the pruned model. Does
your accuracy increase?
AIM: To make a decision tree simpler by pruning the nodes.
Description:
Reduced-error pruning:-
The idea of using a separate pruning set for pruning—which
is applicable to decision trees as well as rule sets—is called
reduced-error pruning. The variant described previously prunes a
rule immediately after it has been grown and is called incremental
reduced-error pruning.
Another possibility is to build a full, unpruned rule set first,
pruning it afterwards by discarding individual tests.
However, this method is much slower. Of course, there are
many different ways to assess the worth of a rule based on the
pruning set. A simple measure is to consider how well the rule
would do at discriminating the predicted class from other classes if
it were the only rule in the theory, operating under the closed
world assumption.
If it gets p instances right out of the t instances that it covers,
and there are P instances of this class out of a total T of instances
altogether, then it gets positive instances right. The instances that
it does not cover include N - n negative ones, where n = t – p is the
number of negative instances that the rule covers and N = T - P is
the total number of negative instances.
Thus the rule has an overall success ratio of [p +(N - n)] T ,
and this quantity, evaluated on the test set, has been used to
evaluate the success of a rule when using reduced-error pruning.
Or
Tree pruning is a method which eliminates redundancy of the

nodes structure, outliers of a decision trees. Pruning makes use of
two methods like
50 | P a g e
 Pre Pruning
 Post Pruning
Prepruning is a method where we apply some criterions or test

conditions before the construction of decision tree induction where
we can expect the elimination of outliers and redundancy. Where
as in post pruning method we apply some criterions once the
decision tree construction is derived. The given task-11 comes
under prepruning method where we can apply various test
conditions in weka explorer like
 Use training set

 Supplied test set
 Cross validation using folds
 Percentage split
The above test conditions are used as part of prepruning and
can expect good classifier accuracy.
Procedure
1. Right click on J48 algorithm to get Generic Object Editor window

2. In this,make reduced error pruning option as true and also
the unpruned
option as true .
3. Then press OK and then start.
4. We find that the accuracy has been increased by selecting the
reduced error pruning option.
51 | P a g e
52 | P a g e
Result: The above test conditions are used as part of prepruning
and can expect good classifier accuracy.
53 | P a g e

Adama Science and Technology University-Dm-Lab

Uploaded by

Copyright:

Available Formats

You might also like

Adama Science and Technology University-Dm-Lab

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Adama Science and Technology University-Dm-Lab

Uploaded by

Copyright:

Available Formats

Adama Science and Technology University

School of Electrical Engineering and Computing

COMPUTER SCIENCE AND ENGINEERING

IV B. Tech I semester (Elective)

SNo Experiment Name Date

Training a decision tree.

Test on classification of decision tree.

Testing on the training set .

Using cross –validation for training.

Significance of attributes in decision tree.

Find out differences in results using decision tree and cross-validation on a

Convert a Decision Trees into "if-then-else rules".

Roll No.___________________ Page 1

There are three major implemented schemes, WEKA.

1. Implemented schemes for classification,

2. Implemented schemes for numeric prediction,

The weka GUI chooser provides a starting point launching

Roll No.___________________ Page 2

The buttons can be used to start the following applications:

 Knowledge Flow this environment supports essentially the same

 Simple CLI Provides a simple command-line interface that allows

Weka GUI Chooser

Roll No.___________________ Page 3

Credit Risk Assessment

The German Credit Data:

A few notes on the German dataset:

Tools/ Apparatus: Weka Mining tool.

1) Open the Weka GUI Chooser.

2) Select EXPLORER present in Applications.

3) Select Preprocess Tab.

Roll No.___________________ Page 5

Roll No.___________________ Page 6

5. Employment 6. Personal_status 7.Other_parties 8.Property_magnitude 9.

1. Duration 2. Credit_amount 3. Installment_commitment 4. Residece_since 5. Age

Result: Hence all categorical and Numerical attributes are displayed.

Roll No.___________________ Page 7

Aim: To identify the rules with some of the important attributes by

Tools/ Apparatus: Weka mining tool.

side or LHS) and consequent (righthandside or RHS) of the rule respectively.

Roll No.___________________ Page 8

· Find frequent set Lk − 1.

.Ck is generated by joining Lk − 1with itself

Roll No.___________________ Page 9

. (Ck: Candidate item set of size k)

· (Lk: frequent item set of size k)

Apriori Pseudo code

L< {Large 1itemsets that appear in more than transactions }

for candidates c € C(t)

L(k)<{ c € C(k)| count[c] ≥ £

1) Given the Bank database for mining.

2) Select EXPLORER in WEKA GUI Chooser.

3) Load “Bank.csv” in Weka by Open file in Preprocess tab.

4) Select only Nominal values.

6) Select Apriori algorithm from Choose button present in

Associator weka.associations.Apriori -N 10 -T 0 -C 0.9 -D 0.05 -U 1.0 -M 0.1 -S -1.0 -c -1

7) Select Start button

Roll No.___________________ Page 10