SCHOOL OF ENGINEERING AND TECHNOLOGY

Record of Applied and Action Learning

(Programming Practice)

Subject Name: Data Warehousing and Data Mining

Subject Code:

Semester: 7th Semester

Name:

Registration No.:

Program/Branch: B.Tech, CSE

Specialization: Software Technology

Academic Year: 2023-24

Campus: Bhubaneswar
CENTURION UNIVERSITY OF TECHNOLOGY AND MANAGEMENT
ODISHA

Certificate
This is to certify that Mr./Ms. ............................................................................ having
7th
Registration No. ............................................... of ........................................ Semester,

.................................................................... Program, ..........................................................

School, .................................................. Campus has completed ...................................

number of experiments in ............................................ Applied and Action

Learning Laboratory and fulfils the.........................................................course

requirements.

Signature of the HoD/Dean Signature of the Faculty

Of)ice Seal
 INDEX
Sl. Page Faculty
Date Name of the Experiment Remark
No. No. Signature
 School Of Engineering and Technology
School: ............................................................................................................. Bhubaneswar
Campus: .......................................................
2023-
Academic Year: ...................... Subject Name: ........................................................... Subject Code: ..........................
24
7th Program: ........................................ Branch: ......................... Specialization: ..........................
Semester: ...............

Date: .....................................

(Learning by Doing and Discovery)

Demonstration of preprocessing on dataset student.arff
* Coding Phase: Pseudo Code / Flow Chart / Algorithm
@relation student
@attribute age {<30,30-40,>40}
@attribute income {low, medium, high}
@attribute student {yes, no}
@attribute credit-rating {fair, excellent}
@attribute buyspc {yes, no}
@data

%
<30, high, no, fair, no
<30, high, no, excellent, no 30-40, high, no, fair, yes
>40, medium, no, fair, yes
>40, low, yes, fair, yes
>40, low, yes, excellent, no 30-40, low, yes, excellent, yes
<30, medium, no, fair, no
<30, low, yes, fair, no
>40, medium, yes, fair, yes
<30, medium, yes, excellent, yes
30-40, medium, no, excellent, yes
30-40, high, yes, fair, yes
>40, medium, no, excellent, no

* Testing Phase: Compilation of Code (error detection)

*As applicable according to the experiment.

One sheet per experiment (10-20) to be used.
 Applied and Action Learning

* Implementation Phase: Final Output (no error)

Procedure:
Steps:
1. Open Start Programs Accessories Notepad
2. Type the following training data set with the help of Notepad for student
3. After that the file is saved with .arff file format.
4. Minimize the arff file and then open Start>Programs>weka-3-4.
5. Click onweka-3-4, then Weka dialog box is displayed on the screen.
6. In that dialog box there are four applications, click on explorer.
7. While staying on preprocessing tab click on ‘open file’ and select the arff file
8. Weka will analyze and show the preprocessed student data .
Preprocessing:

Discretization:
Steps:
1. To discretize based on age attribute, Select the age attribute.
2. Click on choose button under filter section then unsupervised>attribute>discretize
3. To change the defaults for the filters, click on the box immediately to the right of
the choose button.
4. On the pop up dialog box set index as 1 and bins as 3 then click Ok then apply the
filter.
5. This will result in a new working relation with the selected attribute partition into
3 bins.

One sheet per experiment (10-20) to be used.

* Implementation Phase: Final Output (no error)
Discretize student data set:

Result:
We have successfully preprocessed and discretize student data set.

Rubrics
Concept 10
Planning and Execution/ 10
Practical Simulation/ Programming
Result and Interpretation 10
Record of Applied and Action Learning 10
Viva 10
Total 50

Signature of the Student:

Signature of the Faculty:

*As applicable according to the experiment.
One sheet per experiment (10-20) to be used.
 School Of Engineering and Technology
School: ............................................................................................................. Bhubaneswar
Campus: .......................................................
2023-
Academic Year: ...................... Subject Name: ........................................................... Subject Code: ..........................
24
7th Program: ........................................ Branch: ......................... Specialization: ..........................
Semester: ...............

Date: .....................................

(Learning by Doing and Discovery)

Demonstration of preprocessing on dataset labor.arff
* Coding Phase: Pseudo Code / Flow Chart / Algorithm

* Testing Phase: Compilation of Code (error detection)

*As applicable according to the experiment.

One sheet per experiment (10-20) to be used.
* Implementation Phase: Final Output (no error) Applied and Action Learning

Procedure:
Steps:
1. Click onweka-3-4, then Weka dialog box is displayed on the screen.
2. In that dialog box there are four applications, click on explorer.
3. While staying on preprocessing tab click on ‘open file’ and select the labor.arff file
from the datasets.
4. Weka will analyze and show the preprocessed student data .

Pre-processing:

Discretization:
Steps:
1. To discretize based on duration attribute, Select the duration attribute.
2. Click on choose button under filter section then unsupervised>attribute>discretize
3. To change the defaults for the filters, click on the box immediately to the right of
the choose button.
4. On the pop up dialog box set index as 1 and bins as 1 then click Ok then apply the
filter.
5. This will result in a new working relation with the selected attribute partition into
1 bin.

One sheet per experiment (10-20) to be used.

 Implementation Phase: Final Output (no error)
Discretize labor data set:

Result:
We have successfully preprocessed and discretize labor data set.

Rubrics
Concept 10
Planning and Execution/ 10
Practical Simulation/ Programming
Result and Interpretation 10
Record of Applied and Action Learning 10
Viva 10
Total 50

Signature of the Student:

Signature of the Faculty:

*As applicable according to the experiment.

One sheet per experiment (10-20) to be used.
 School Of Engineering and Technology
School: ............................................................................................................. Bhubaneswar
Campus: .......................................................
2023-
Academic Year: ...................... Subject Name: ........................................................... Subject Code: ..........................
24
7th Program: ........................................ Branch: ......................... Specialization: ..........................
Semester: ...............

Date: .....................................

(Learning by Doing and Discovery)

Demonstration of Association rule process on dataset contactlenses.arff
using apriori algorithm
* Coding Phase: Pseudo Code / Flow Chart / Algorithm

* Testing Phase: Compilation of Code (error detection)

*As applicable according to the experiment.

One sheet per experiment (10-20) to be used.
* Implementation Phase: Final Output (no error) Applied and Action Learning

Procedure:
Steps:
1. Open the data file in Weka Explorer. It is presumed that the required data fields have
been discretized. In this example it is age attribute.
2. Clicking on the associate tab will bring up the interface for association rule algorithm.
3. We will use apriori algorithm. This is the default algorithm.
4. Inorder to change the parameters for the run (example support, confidence etc) we
click on the text box immediately to the right of the choose button.

Association rules that were generated when apriori algorithm is applied on the
given dataset:

One sheet per experiment (10-20) to be used.

 * Implementation Phase: Final Output (no error)

Result:
This program has been successfully executed

Rubrics
Concept 10
Planning and Execution/ 10
Practical Simulation/ Programming
Result and Interpretation 10
Record of Applied and Action Learning 10
Viva 10
Total 50

Signature of the Student:

Signature of the Faculty:

*As applicable according to the experiment.

One sheet per experiment (10-20) to be used.
 School Of Engineering and Technology
School: ............................................................................................................. Bhubaneswar
Campus: .......................................................
2023-
Academic Year: ...................... Subject Name: ........................................................... Subject Code: ..........................
24
7th Program: ........................................ Branch: ......................... Specialization: ..........................
Semester: ...............

Date: .....................................

(Learning by Doing and Discovery)

Demonstration of Association rule process on dataset test.arff using
apriori algorithm
* Coding Phase: Pseudo Code / Flow Chart / Algorithm
@relation test
@ attribute admissionyear {2005,2006,2007,2008,2009,2010}
@attribute attribute course{cse,mech,it,ece}
@data
%
2005, cse
2005, it
2005, cse
2006, mech
2006, it
2006, ece
2007, it
2007, cse
2008, it
2008, cse
2009, it
2009, ece
%
* Testing Phase: Compilation of Code (error detection)

*As applicable according to the experiment.

One sheet per experiment (10-20) to be used.
 Applied and Action Learning

* Implementation Phase: Final Output (no error)

Procedure:
Steps:
5. Open the data file in Weka Explorer. It is presumed that the required data fields have
been discretized. In this example it is admissionyear attribute.
6. Clicking on the associate tab will bring up the interface for association rule
algorithm.
7. We will use apriori algorithm. This is the default algorithm.
8. In order to change the parameters for the run (example support, confidence etc) we
click on the text box immediately to the right of the choose button.
Association rules that were generated when apriori algorithm is applied on the
given dataset:

Result:
This program has been successfully executed

Rubrics
Concept 10
Planning and Execution/ 10
Practical Simulation/ Programming
Result and Interpretation 10
Record of Applied and Action Learning 10
Viva 10
Total 50

Signature of the Student:

Signature of the Faculty:

*As applicable according to the experiment.
One sheet per experiment (10-20) to be used.
 School Of Engineering and Technology
School: ............................................................................................................. Bhubaneswar
Campus: .......................................................
2023-
Academic Year: ...................... Subject Name: ........................................................... Subject Code: ..........................
24
7th Program: ........................................ Branch: ......................... Specialization: ..........................
Semester: ...............

Date: .....................................

(Learning by Doing and Discovery)

Demonstration of classification rule process on dataset student.arff using
j48 algorithm
* Coding Phase: Pseudo Code / Flow Chart / Algorithm
@relation student
@attribute age {<30,30-40,>40}
@attribute income {low, medium, high}
@attribute student {yes, no}
@attribute credit-rating {fair,excellent}
@attribute buyspc {yes, no}
@data
%
<30, high, no, fair, no
<30, high, no, excellent, no
30-40, high, no, fair, yes
>40, medium, no, fair, yes
>40, low, yes, fair, yes
>40, low, yes, excellent, no
30-40, low, yes, excellent, yes
<30, medium, no, fair, no
<30, low, yes, fair, no
>40, medium, yes, fair, yes
<30, medium, yes, excellent, yes
30-40, medium, no, excellent, yes
30-40, high, yes, fair, yes
>40, medium, no, excellent, no
%
* Testing Phase: Compilation of Code (error detection)

*As applicable according to the experiment.

One sheet per experiment (10-20) to be used.
* Implementation Phase: Final Output (no error) Applied and Action Learning

Procedure:
Steps:
1. Open the student data file in Weka Explorer assuming that preprocessing has been
done .
2. Next we select the “classify” tab and click “choose” button to select the
“j48”classifier.
3. Now we specify the various parameters.
4. Under the “text” options in the main panel. We select the 10-fold cross validation as
our evaluation approach.
5. We now click ”start” to generate the model .The Ascii version of the tree as well as
evaluation statistic will appear in the right panel when the model construction is
complete.
Classification using j48 algorithm:

One sheet per experiment (10-20) to be used.

 Implementation Phase: Final Output (no error)
6. Now weka also lets us a view a graphical version of the classification tree. This can
be done by right clicking the last result set and selecting “visualize tree” from the
pop-up menu.

Result:
We have successfully classified student dataset using j48 algorithm.

Rubrics
Concept 10
Planning and Execution/ 10
Practical Simulation/ Programming
Result and Interpretation 10
Record of Applied and Action Learning 10
Viva 10
Total 50

Signature of the Student:

Signature of the Faculty:

*As applicable according to the experiment.

One sheet per experiment (10-20) to be used.
 School Of Engineering and Technology
School: ............................................................................................................. Bhubaneswar
Campus: .......................................................
2023-
Academic Year: ...................... Subject Name: ........................................................... Subject Code: ..........................
24
7th Program: ........................................ Branch: ......................... Specialization: ..........................
Semester: ...............

Date: .....................................

(Learning by Doing and Discovery)

Demonstration of classification rule process on dataset employee.arff
using j48 algorithm
* Coding Phase: Pseudo Code / Flow Chart / Algorithm
@relation employee

@attribute age {25, 27, 28, 29, 30, 35, 48}

@attribute salary{10k,15k,17k,20k,25k,30k,35k,32k}
@attribute performance {good, avg, poor}
@data
%
25, 10k, poor
27, 15k, poor
27, 17k, poor
28, 17k, poor
29, 20k, avg
30, 25k, avg
29, 25k, avg
30, 20k, avg
35, 32k, good
48, 35k, good
48, 32k,good
%

* Testing Phase: Compilation of Code (error detection)

*As applicable according to the experiment.

One sheet per experiment (10-20) to be used.
 Applied and Action Learning

* Implementation Phase: Final Output (no error)

Procedure:
Steps:
1. Open the employee data file in Weka Explorer assuming that preprocessing has been
done .
2. Next we select the “classify” tab and click “choose” button to select the
“j48”classifier.
3. Now we specify the various parameters.
4. Under the “text” options in the main panel. We select the 10-fold cross validation as
our evaluation approach.
5. We now click ”start” to generate the model .The Ascii version of the tree as well as
evaluation statistic will appear in the right panel when the model construction is
complete.
Classification using j48 algorithm:

One sheet per experiment (10-20) to be used.

* Implementation Phase: Final Output (no error)
6. Now weka also lets us a view a graphical version of the classification tree. This can
be done by right clicking the last result set and selecting “visualize tree” from the pop-
up menu.

Result:
We have successfully classified employee dataset using j48 algorithm.

Rubrics
Concept 10
Planning and Execution/ 10
Practical Simulation/ Programming
Result and Interpretation 10
Record of Applied and Action Learning 10
Viva 10
Total 50

Signature of the Student:

Signature of the Faculty:

*As applicable according to the experiment.
One sheet per experiment (10-20) to be used.
 School Of Engineering and Technology
School: ............................................................................................................. Bhubaneswar
Campus: .......................................................
2023-
Academic Year: ...................... Subject Name: ........................................................... Subject Code: ..........................
24
7th Program: ........................................ Branch: ......................... Specialization: ..........................
Semester: ...............

Date: .....................................

(Learning by Doing and Discovery)

Demonstration of classification rule process on dataset employee.arff
using naïve bayes algorithm
* Coding Phase: Pseudo Code / Flow Chart / Algorithm
@relation employee
@attribute age {25, 27, 28, 29, 30, 35, 48}
@attribute salary{10k,15k,17k,20k,25k,30k,35k,32k}
@attribute performance {good, avg, poor}
@data
%
25, 10k, poor
27, 15k, poor
27, 17k, poor
28, 17k, poor
29, 20k, avg
30, 25k, avg
29, 25k, avg
30, 20k, avg
35, 32k, good
48, 35k, good
48, 32k, good
%

* Testing Phase: Compilation of Code (error detection)

*As applicable according to the experiment.

One sheet per experiment (10-20) to be used.
 Applied and Action Learning

* Implementation Phase: Final Output (no error)

Procedure:
Steps:
1. Open the employee data file in Weka Explorer assuming that preprocessing has been
done .
2. Next we select the “classify” tab and click “choose” button to select the “naïve
bayes ”classifier.
3. Now we specify the various parameters.
4. Under the “text” options in the main panel. We select the 10-fold cross validation as
our evaluation approach.
5. We now click ”start” to generate the model .The Ascii version of the tree as well as
evaluation statistic will appear in the right panel when the model construction is
complete.
Classification using naïve bayes algorithm:

One sheet per experiment (10-20) to be used.

* Implementation Phase: Final Output (no error)

Result:
We have successfully classified employee dataset using naïve bayes algorithm.

Rubrics
Concept 10
Planning and Execution/ 10
Practical Simulation/ Programming
Result and Interpretation 10
Record of Applied and Action Learning 10
Viva 10
Total 50

Signature of the Student:

Signature of the Faculty:

*As applicable according to the experiment.
One sheet per experiment (10-20) to be used.
 School Of Engineering and Technology
School: ............................................................................................................. Bhubaneswar
Campus: .......................................................
2023-
Academic Year: ...................... Subject Name: ........................................................... Subject Code: ..........................
24
7th Program: ........................................ Branch: ......................... Specialization: ..........................
Semester: ...............

Date: .....................................

(Learning by Doing and Discovery)

Demonstration of clustering rule process on dataset iris.arff using simple
k-means
* Coding Phase: Pseudo Code / Flow Chart / Algorithm

* Testing Phase: Compilation of Code (error detection)

*As applicable according to the experiment.

One sheet per experiment (10-20) to be used.
 Applied and Action Learning

* Implementation Phase: Final Output (no error)

Procedure:
Steps:
1. Run the Weka explorer and load the data file iris.arff in preprocessing interface.
2. Select the ‘cluster’ tab in the explorer
3. Select ‘simple k-means’ algorithm from the drop-down menu .
4. Next click in text button to the right of the choose button to get popup window, enter
six on the number of clusters and we leave the value of the seed on as it is.
5. The use of training set option is selected and then we click ‘start’ button.
6. The result window shows the centroid of each cluster as well as statistics on the
number and the percent of instances assigned to different clusters.
Clustering using simple-k-means algorithm:

One sheet per experiment (10-20) to be used.

* Implementation Phase: Final Output (no error)
Visualization :
We can do this, try right clicking the result set on the result. List panel and selecting the
visualize cluster assignments.

Result:
We have successfully used clustering using simple-k-means algorithm on iris dataset.

Rubrics
Concept 10
Planning and Execution/ 10
Practical Simulation/ Programming
Result and Interpretation 10
Record of Applied and Action Learning 10
Viva 10
Total 50

Signature of the Student:

Signature of the Faculty:

*As applicable according to the experiment.
One sheet per experiment (10-20) to be used.
 School Of Engineering and Technology
School: ............................................................................................................. Bhubaneswar
Campus: .......................................................
2023-
Academic Year: ...................... Subject Name: ........................................................... Subject Code: ..........................
24
7th Program: ........................................ Branch: ......................... Specialization: ..........................
Semester: ...............

Date: .....................................

(Learning by Doing and Discovery)

Demonstration of clustering rule process on dataset student.arff using
simple k- means
* Coding Phase: Pseudo Code / Flow Chart / Algorithm
@relation student
@attribute age {<30,30-40,>40}
@attribute income {low,medium,high}
@attribute student {yes,no}
@attribute credit-rating {fair,excellent}
@attribute buyspc {yes,no}
@data
%
<30, high, no, fair, no
<30, high, no, excellent, no 30-40, high, no, fair, yes
>40, medium, no, fair, yes
>40, low, yes, fair, yes
>40, low, yes, excellent, no 30-40, low, yes, excellent, yes
<30, medium, no, fair, no
<30, low, yes, fair, no
>40, medium, yes, fair, yes
<30, medium, yes, excellent, yes
30-40, medium, no, excellent, yes
30-40, high, yes, fair, yes
>40, medium, no, excellent, no
%

* Testing Phase: Compilation of Code (error detection)

*As applicable according to the experiment.

One sheet per experiment (10-20) to be used.
 Applied and Action Learning

* Implementation Phase: Final Output (no error)

Procedure:
Steps:
1. Run the Weka explorer and load the data file student.arff in preprocessing interface.
2. Select the ‘cluster’ tab in the explorer
3. Select ‘simple k-means’ algorithm from the drop-down menu .
4. Next click in text button to the right of the choose button to get popup window, enter
six on the number of clusters and we leave the value of the seed on as it is.
5. The use of training set option is selected and then we click ‘start’ button.
6. The result window shows the centroid of each cluster as well as statistics on the
number and the percent of instances assigned to different clusters.
Clustering using simple-k-means algorithm:

One sheet per experiment (10-20) to be used.

* Implementation Phase: Final Output (no error)
Visualization :
We can do this, try right clicking the result set on the result. List panel and selecting the
visualize cluster assignments.

Result:
We have successfully used clustering using simple-k-means algorithm on student dataset.

Rubrics
Concept 10
Planning and Execution/ 10
Practical Simulation/ Programming
Result and Interpretation 10
Record of Applied and Action Learning 10
Viva 10
Total 50

Signature of the Student:

Signature of the Faculty:

*As applicable according to the experiment
One sheet per experiment (10-20) to be used.
 Applied and Action Learning
ASSESSMENT
Experiment Full Mark Marks Obtained Experiment Full Mark Marks Obtained

Experiment - 1 50 Experiment - 12 50
Experiment - 2 50 Experiment - 13 50
Experiment - 3 50 Experiment - 14 50
Experiment - 4 50 Experiment - 15 50
Experiment - 5 50 Experiment - 16 50
Experiment - 6 50 Experiment - 17 50
Experiment - 7 50 Experiment - 18 50
Experiment - 8 50 Experiment - 19 50
Experiment - 9 50 Experiment - 20 50
Experiment - 10 50 Average
50
Experiment - 11 50 Total

Date: Signature of the Faculty

* LEARNING OUTCOMES:
How the Applied and Action Learning encourages Critical Thinking, Problem
Solving, Idea Generation and Skill Development etc.?

How the Applied and Action Learning encourages Leadership, Team Work,
Reflection and Decision Making Capability etc.?

Date: Signature of the Student

* One sheet per learning record to be used

 Applied and Action Learning
COURSE OUTCOMES (COs) ATTAINMENT
 Expected Course Outcomes (COs):
(Refer to COs Statement in the Syllabus)

 Course Outcomes (COs) Attained:

How would you rate your learning of the subject based on the specified COs?

1 2 3 4 5 6 7 8 9 10
LOW HIGH

 Learning Gap (If any):

 Books/Manuals Referred:

Date: Signature of the Student

 Suggestions / Recommendations:
(by the Course Faculty)

Date: Signature of the Faculty

* One sheet per learning record to be used

 CENTURION UNIVERSITY OF TECHNOLOGY AND MANAGEMENT, ODISHA

CAMPUSES:
Paralakhemundi Campus Bhubaneswar Campus Balangir Campus Rayagada Campus Balasore Campus Chatrapur Campus
Village Alluri Nagar Ramchandrapur Behind BSNL Office IDCO Industrial Area Gopalpur, Ramchandrapur,
P.O. – R Sitapur, Via- Uppalada P.O. – Jatni, Bhubaneswar IDCO land, Rajib Nagar Pitamahal, Rayagada P.O.-Balasore Kaliabali Chhak,
Paralakhemundi, Dist.- Gajapati Dist.- Khurda, Odisha, Dist.- Balangir, Odisha Dist.-Rayagada, Odisha Dist.-Balasore, Odisha P.O-Chatrapur, Dist.-Ganjam
Odisha, India. PIN– 761211 India, PIN– 752050 India, PIN-767001 India, PIN-765001 India, PIN-756044 Odisha, India, PIN-761020