AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD

Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

DATA WAREHOUSING AND DATAMININGLAB

SUBJECT CODE : (KCS-751A)

LAB RECORD

[Link]
(IV YEAR – VIITH SEM)
(2024-25)

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

(Artificial Intelligence & Machine Learning)

AJAY KUMAR GARG ENGINEERING COLLEGE

GHAZIABAD, U.P

1
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

DATA WAREHOUSING AND DATA MINING LAB

INDEX

S. No Name of the Experiment Pg No Date Signature

1 Installation of WEKA Tool

2 Creating new Arff File

3 Data Processing Techniques on Data Set

4 Data cube construction – OLAP operation

5 Implementation of A priori algorithm

6 Implementation of FP- Growth algorithm

7 Implementation of Decision Tree Induction

8 Calculating Information gains measures

9 Classification of data using Bayesian

approach

10 Implementation of K-means Algorithm

2
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Experiment 1: Installation of WEKA Tool

Aim: A. Investigation the Application interfaces of the Weka tool. Introduction:

Introduction
Weka (pronounced to rhyme with Mecca) is a workbench that contains a collection of
visualization tools and algorithms for data analysis and predictive modeling, together with
graphical user interfaces for easy access to these functions. The original non-Java version of
Weka was a Tcl/Tk front-end to (mostly third-party) modeling algorithms implemented in other
programming languages, plus data preprocessing utilities in C, and Make file-based system for
running machine learning experiments. This original version was primarily designed as a tool for
analyzing data from agricultural domains, but the more recent fully Java-based version (Weka 3),
for which development started in 1997, is now used in many different application areas, in
particular for educational purposes and research. Advantages of Weka include:

 Free availability under the GNU General Public License.

 Portability, since it is fully implemented in the Java programming language and thus
runs on almost any modern computing platform
 A comprehensive collection of data preprocessing and modeling techniques
 Ease of use due to its graphical user interfaces

Description:
Open the program. Once the program has been loaded on the user’s machine it is opened by
navigating to the programs start option and that will depend on the users operating system.
Figure
1.1 is an example of the initial opening screen on a computer.
There are four options available on this initial screen:

3
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Fig: 1.1 Weka GUI

1. Explorer - the graphical interface used to conduct experimentation on raw data After
clicking the Explorer button the weka explorer interface appears.

Fig: 1.2 Pre-processor

4
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

5
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Inside the weka explorer window there are six tabs:

1. Preprocess- used to choose the data file to be used by theapplication.
Open File- allows for the user to select files residing on the local machine or recorded medium
Open URL- provides a mechanism to locate a file or data source from a different location
specified by the user
Open Database- allows the user to retrieve files or data from a database source provided by user
2. Classify- used to test and train different learning schemes on the preprocessed data file under
experimentation

Fig: 1.3 choosing Zero set from classify

Again there are several options to be selected inside of the classify tab. Test option gives the user
the choice of using four different test mode scenarios on the data set.
1. Use training set
2. Supplied training set
3. Cross validation
4. Split percentage

3. Cluster- used to apply different tools that identify clusters within the data file.
The Cluster tab opens the process that is used to identify commonalties or clusters of occurrences
within the data set and produce information for the user to analyze.
6
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

4. Association- used to apply different rules to the data file that identify association within
the data. The associate tab opens a window to select the options for associations within the
dataset.

7
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

5. Select attributes-used to apply different rules to reveal changes based on selected

attributes inclusion or exclusion from the experiment

6. Visualize- used to see what the various manipulation produced on the data set in a 2D
format, in scatter plot and bar graph output.

2. Experimenter - this option allows users to conduct different experimental variations on data
sets and perform statistical manipulation. The Weka Experiment Environment enables the user to
create, run, modify, and analyze experiments in a more convenient manner than is possible when
processing the schemes individually. For example, the user can create an experiment that runs
several schemes against a series of datasets and then analyze the results to determine if one of the
schemes is (statistically) better than the other schemes.

Fig: 1.6 Weka experiment

Results destination: ARFF file, CSV file, JDBC database.

Experiment type: Cross-validation (default), Train/Test Percentage Split (data randomized).
Iteration control: Number of repetitions, Data sets first/Algorithms first.
Algorithms: filters
8
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

3. Knowledge Flow -basically the same functionality as Explorer with drag and drop
functionality. The advantage of this option is that it supports incremental learning from previous
results
4. Simple CLI - provides users without a graphic interface option the ability to execute
commands from a terminal window.
b. Explore the default datasets in weka tool.

Click the “Open file…” button to open a data set and double click on the “data” directory.
Weka provides a number of small common machine learning datasets that you can use to
practice on. Select the “[Link]” file to load the Iris dataset.

Fig: 1.7 Different Data Sets in weka

References:
[1] Witten, I.H. and Frank, E. (2005) Data Mining: Practical machine learning
tools andtechniques. 2nd edition Morgan Kaufmann, San Francisco.
[2] Ross Quinlan (1993). C4.5: Programs for Machine Learning, Morgan Kaufmann
Publishers, San Mateo, CA.
[3] CVS–[Link]
[4] Weka Doc–[Link]

9
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Experiment 2: Creating new ARFF file

Aim: Creating a new ARFF file

An ARFF (Attribute-Relation File Format) file is an ASCII text file that describes a list of
instances sharing a set of attributes. ARFF files were developed by the Machine Learning Project
at the Department of Computer Science of The University of Waikato for use with the Weka
machine learning software in WEKA, each data entry is an instance of the java class [Link].
Instance, and each instance consists of a For loading datasets in WEKA, WEKA can load ARFF
files. Attribute Relation File Format has two sections:

1. The Header section defines relation (dataset) name, attribute name, and type.
2. The Data section lists the data instances.

10
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

The figure above is from the textbook that shows an ARFF file for the weather data. Lines
beginning with a % sign are comments. And there are three basic keyword

11
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

The external representation of an Instances class Consists of:

 A header: Describes the attribute types
 Data section: Comma separated list of data

12
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Experiment 3: Data Processing Techniques on Data Set

Aim: 3a) Pre-process a given dataset based on Attribute selection

To search through all possible combinations of attributes in the data and find which subset of
attributes works best for prediction, make sure that you set up attribute evaluator to „Cfs Subset
Val‟ and a search method to „Best First‟. The evaluator will determine what method to use
toassign a worth to each subset of attributes. The search method will determine what style of
search to perform. The options that you can set for selection in the „Attribute Selection Mode‟ fig
no: 3.2

1. Use full training set. The worth of the attribute subset is determined using the full set
of training data.

2. Cross-validation. The worth of the attribute subset is determined by a process of cross-

validation. The „Fold‟ and „Seed‟ fields set the number of folds to use and the random seed used
when shuffling the data.

Specify which attribute to treat as the class in the drop-down box below the test options. Once
all the test options are set, you can start the attribute selection process by clicking on „Start‟
button.

13
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

When it is finished, the results of selection are shown on the right part of the window and entry
is added to the „Result list‟.

2. Visualizing Results

Fig: 3.2 Data Visualization

WEKA‟s visualization allows you to visualize a 2-D plot of the current working relation.
Visualization is very useful in practice; it helps to determine difficulty of the learning problem.
WEKA can visualize single attributes (1-d) and pairs of attributes (2-d), rotate 3-d visualizations
(Xgobi-style). WEKA has “Jitter” option to deal with nominal attributes and to detect “hidden”
data points.

14
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Fig 3.3: Preprocessing with jitter

Fig: 3.3 Data visualization

Exercise
1. Explain data preprocessing steps for heart disease dataset.
15
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Aim: B. Pre-process a given dataset based on Handling Missing Values

Process: Replacing Missing Attribute Values by the Attribute Mean. This method is used for
data sets with numerical attributes. An example of such a data set is presented in fig no: 3.4

Fig: 3.4 Missing values

16
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

In this method, every missing attribute value for a numerical attribute is replaced by the
arithmetic mean of known attribute values. In Fig, the mean of known attribute values for
Temperature is 99.2, hence all missing attribute values for Temperature should be replaced by
The table with missing attribute values replaced by the mean is presented in fig. For symbolic
attributes Headache and Nausea, missing attribute values were replaced using the most common
value of the Replace Missing Values.

17
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Fig: 3.6 Replaced values

18
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Experiment 4: Data cube construction – OLAP operations

An OLAP cube is a term that typically refers to multi-dimensional array of data. OLAP is an
acronym for online analytical processing,[1]which is a computer-based technique of analyzing
data to look for insights. The term cube here refers to a multi-dimensional dataset, which is also
sometimes called a hypercube if the number of dimensions is greater than 3.

Operations:

1. Slice is the act of picking a rectangular subset of a cube by choosing a single value for one
of its dimensions, creating a new cube with one fewer dimension.[4] The picture shows a
slicing operation: The sales figures of all sales regions and all product categories of the
company in the year 2005 and 2006 are "sliced" out of the data cube.

2. Dice:The dice operation produces a subcube by allowing the analyst to pick specific values
of multiple dimensions.[5]The picture shows a dicing operation: The new cube shows the sales
figures of a limited number of product categories, the time and region dimensions cover the
same range as before.

3. DrillDown/Up allows the user to navigate among levels of data ranging from the most
summarized (up) to the most detailed (down).[4] The picture shows a drill-down operation:
The analyst moves from the summary category "Outdoor-Schutzausrüstung" to see the sales
figures for the individual products.

4. Roll-up:A roll-up involves summarizing the data along a dimension. The summarization
rule might be computing totals along a hierarchy or applying a set of formulas such as "profit =
sales
- expenses".

5. Pivot allows an analyst to rotate the cube in space to see its various faces. For example,
cities could be arranged vertically and products horizontally while viewing data for a
particular quarter. Pivoting could replace products with time periods to see data across time
for a single product.

19
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

20
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

21
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

22
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

23
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Experiment 5: Implementation of Apriori Algorithm

Description:
The Apriori algorithm is an influential algorithm for mining frequent item sets for Boolean
association rules. It uses a “bottom-up” approach, where frequent subsets are extended one at a
time (a step known as candidate generation, and groups of candidates are tested against the data).

 Problem:

TID ITEMS
100 1,3,4
200 2,3,5
300 1,2,3,5
400 2,5

To find frequent item sets for above transaction with a minimum support of 2 having
confidence measure of 70% (i.e, 0.7).

Procedure:
Step 1:
Count the number of transactions in which each item occurs

TID ITEMS
1 2
2 3
3 3
4 1
5 3

24
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Step 2:
Eliminate all those occurrences that have transaction numbers less than the minimum support (
2 in this case).

ITEM NO. OF
TRANSACTIONS

1 2

2 3

3 3

5 3

This is the single items that are bought frequently. Now let’s say we want to find a pair of
items that are bought frequently. We continue from the above table (Table in step 2).

Step 3:
We start making pairs from the first item like 1,2;1,3;1,5 and then from second item like 2,3;2,5.
We do not perform 2,1 because we already did 1,2 when we were making pairs with 1 and
buying 1 and 2 together is same as buying 2 and 1 together. After making all the pairs we get,

ITEM PAIRS

1,2
1,3
1,5
2,3
2,5
3,5

Step 4:
Now, we count how many times each pair is bought together.

25
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

[Link]
ITEM PAIRS TRANSACTIONS

1,2 1
1,3 2
1,5 1
2,3 2
2,5 3
3,5 2
Step 5:
Again remove all item pairs having number of transactions less than 2.

ITEM PAIRS NO. OF

TRANSACTIONS

1,3 2
2,3 2
2,5 3
3,5 2

These pair of items is bought frequently together. Now, let’s say we want to find a set of three
items that are bought together. We use above table (of step 5) and make a set of three items.

Step 6:
To make the set of three items we need one more rule (It is termed as self-join), it simply
means, from item pairs in above table, we find two pairs with the same first numeric, so, we
get (2,3) and (2,5), which gives (2,3,5). Then we find how many times (2, 3, 5) are bought
together in the original table and we get the following

ITEM NO. OF
SET TRANSACTIONS

(2,3,5) 2

Thus, the set of three items that are bought together from this data are (2, 3, 5).

26
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Confidence:
We can take our frequent item set knowledge even further, by finding association rules using
the frequent item set. In simple words, we know (2, 3, 5) are bought together frequently, but
what is the association between them. To do this, we create a list of all subsets of frequently
bought items (2, 3, 5) in our case we get following subsets:

 {2}
 {3}
 {5}
 {2,3}
 {3,5}
 {2,5}

Now, we find association among all the subsets.

{2} =>{3,5}:( If„2‟ is bought, what‟sthe probability that „3‟ and „5‟ would be bought insame
transaction)
Confidence = P (3◻5◻2)/ P(2) =2/3 =67%
{3}=>{2,5}= P (3◻5◻2)/P(3)=2/3=67%
{5}=>{2,3}= P (3◻5◻2)/P(5)=2/3=67%
{2,3}=>{5}= P (3◻5◻2)/P(2◻3)=2/2=100%
{3,5}=>{2}= P (3◻5◻2)/P(3◻5)=2/2=100%
{2,5}=>{3}= P (3◻5◻2)/ P(2◻5)=2/3=67%
Also, considering the remaining 2-items sets, we would get the following associations-
{1}=>{3}=P(1◻3)/P(1)=2/2=100%
{3}=>{1}=P(1◻3)/P(3)=2/3=67%
{2}=>{3}=P(3◻2)/P(2)=2/3=67%
{3}=>{2}=P(3◻2)/P(3)=2/3=67%
{2}=>{5}=P(2◻5)/P(2)=3/3=100%
{5}=>{2}=P(2◻5)/P(5)=3/3=100%
{3}=>{5}=P(3◻5)/P(3)=2/3=67%
{5}=>{3}=P(3◻5)/P(5)=2?3=67%
Eliminate all those having confidence less than 70%. Hence, the rules would be –
{2,3}=>{5}, {3,5}=>{2}, {1}=>{3},{2}=>{5}, {5}=>{2}.
 Now these manual results should be checked with the rules generated in WEKA.

27
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

So first create a csv file for the above problem, the csv file for the above problem will look
like the rows and columns in the above figure. This file is written in excel sheet.

Procedure for running the rules in weka:

Step 1:
Open weka explorer and open the file and then select all the item sets. The figure gives a better
understanding of how to do that.

28
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Step 2:
Now select the association tab and then choose apriori algorithm by setting the minimumsupport
and confidence as shown in the figure

29
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Step 3:
Now run the apriori algorithm with the set values of minimum support and the confidence. After
running the weka generates the association rules and the respective confidence with minimum
support as shown in the figure.

The above csv file has generated 5 rules as shown in the figure:

30
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

31
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Conclusion:
As we have seen the total rules generated by us manually and by the weka are matching, hence
the rules generated are 5.

32
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Experiment 6: Implementation of FP- Growth Algorithm

(5a) Aim: To generate association rules using FP Growth Algorithm

PROBLEM:
To find all frequent item sets in following dataset using FP-growth algorithm. Minimum
support=2 and confidence =70%
TID ITEMS
100 1,3,4
200 2,3,5
300 1,2,3,5
400 2,5

Solution:
Similar to Apriori Algorithm, find the frequency of occurrences of all each item in dataset and
then prioritize the items according to its descending order of its frequency of occurrence.
Eliminating those occurrences with the value less than minimum support and assigning
the priorities, we obtain the following table.

ITEM NO. OF PRIORITY

TRANSACTIONS
1 2 4
2 3 1
3 3 2
5 3 3
Re-arranging the original table, we obtain

TID ITEMS
100 1,3
200 2,3,5
300 2,3,5,1
400 2,5

33
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Construction of tree:
Note that all FP trees have „null‟ node as the root node. So, draw the root node first and attach
the items of the row 1 one by one respectively and write their occurrences in front of it. The tree
is further expanded by adding nodes according to the prefixes (count) formed and by further
incrementing the occurrences every time they occur and hence the tree is built.

Prefixes:

 1->3:1 2,3,5:1
 5->2,3:2 2:1
 3->2:2

Frequent item sets:

 1-> 3:2 /*2 and 5 are eliminated because they‟re less than minimum support, and
the occurrence of 3 is obtained by adding the occurrences in both the instances*/
 Similarly, 5->2,3:2 ; 2:3;3:2
 3->2 :2

Therefore, the frequent item sets are {3,1}, {2,3,5}, {2,5}, {2,3},{3,5}
The tree is constructed as below:

1:1

Generating the association rules for the following tree and calculating the
confidence measures we get-
 {3}=>{1}=2/3=67%
 {1}=>{3}=2/2=100%
 {2}=>{3,5}=2/3=67%

34
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

 {2,5}=>{3}=2/3=67%
 {3,5}=>{2}=2/2=100%
 {2,3}=>{5}=2/2=100%
 {3}=>{2,5}=2/3=67%
 {5}=>{2,3}=2/3=67%
 {2}=>{5}=3/3=100%
 {5}=>{2}=3/3=100%
 {2}=>{3}=2/3=67%
 {3}=>{2}=2/3=67%

Thus eliminating all the sets having confidence less than 70%, we obtain the following
conclusions:
{1}=>{3} , {3,5}=>{2} , {2,3}=>{5} , {2}=>{5}, {5}=>{2}.

As we see there are 5 rules that are being generated manually and these are to be checked against
the results in WEKA. Inorder to check the results in the tool we need to follow the similar
procedure like
Apriori.

So first create a csv file forthe above problem, the csv file for the above problem will
look like the rows and columns in the above figure. This file is written in excel sheet.

Procedure for running the rules in weka:

Step 1:
Open weka explorer and open the file and then select all the item sets. The figure gives a better
understanding of how to do that.

35
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Step 2:
Now select the association tab and then choose FP growth algorithm by setting the
minimum support and confidence as shown in the figure.

36
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Step 3:
Now run the FP Growth algorithm with the set values of minimum support and the confidence.
After running the weka generates the association rules and the respective confidence
withminimum support as shown in the figure.
The above csv file has generated 5 rules as shown in the figure:

37
Signature of The Faculty
 AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD
Department of CSE (AIML)

Roll No.- 2200271539006 Name- Merdul Sharma

Subject- Data Warehousing & Data Mining Lab Year – 4th
Semester-7 Batch-D

Conclusion:
As we have seen the total rules generated by us manually and by the weka are matching, hence
the rules generated are 5.

38
Signature of The Faculty