EFFICIENTLY MINING FREQUENT ITEMSETS ON MASSIVE

DATA

A Thesis report submitted to

the faculty of Engineering and Technology of

Kakatiya Institute of Technology & Science, Warangal

in partial fulfillment of the requirements

to award

Master of Technology

in

Software Engineering

BY
K. SIDDHARTHA M18SE021

Under the Guidance of

P. SRINIVAS
Assistant Professor

Department Of Computer Science & Engineering

Kakatiya Institute of Technology & Science, Warangal (T.S)

(An Autonomous Institute under Kakatiya University, Warangal)
2019-2020
 CERTIFICATE

This is to certify that K. Siddhartha bearing Roll No M18SE021 of the

II/II M.Tech specialization in Software Engineering has satisfactorily completed
the dissertation work entitled “EFFICIENTLY MINING FREQUENT ITEMSETS ON
MASSIVE DATA” in the partial fulfillment of the requirements of M.Tech degree
during this academic year 2019-2020.

Supervisor Head of the Department

SRI. P. SRINIVAS ` DR. V. SHANKAR

Assistant Professor. Professor& Head

External
 ACKNOWLEDGEMENT

The successful completion of this project is made possible with the help and guidance
received from various quarters. I would like to avail this opportunity to express my sincere
thanks and gratitude to all of them. I would like to express my profound gratitude and sincere

thanks to my project guide Sri P. SRINIVAS, Assistant Professor, CSE department.

I express my reflective thanks to our M.Tech (SOFTWARE ENGINEERING) course

coordinator Dr. S. Nagaraju, Associate Professor, Department of Computer Science &

Engineering for his stimulating guidance and profuse assistance.

I express my sincere thanks to Dr. V. Shankar, Head of the Department, Computer

Science & Engineering for providing me an opportunity to do this project work.

I would like to express my profound thanks to Dr. K. ASHOKA REDDY, Principal for
providing necessary infrastructure and resources for the accomplishment of my project report at
Kakatiya Institute of Technology & Sciences, Warangal.

I am very much thankful to all the faculty members of the CSE for their value based
imparting of the theory and practical subjects, which I have put to use in project report. Finally, I
would like to take this opportunity to specially thank my parents for their kind help,
encouragement and moral support.

P.SWATHI

Roll No. M17SE029

 ABSTRACT

Frequent itemset mining is an important operation to return all itemsets in the transaction table,
which occur as a subset of at least a specified fraction of the transactions. The existing
algorithms cannot compute frequent itemsets on massive data efficiently, since they either
require multiple-pass scans on the table, or construct complex data structures which normally
exceed the available memory on massive data. This paper proposes a novel precomputation-
based PFIM algorithm to compute the frequent itemsets quickly on massive data. PFIM treats the
transaction table as two parts: the large old table storing historical data and the relatively small
new table storing newly generated data. PFIM first pre-constructs the quasifrequent itemsets on
the old table whose supports are above the lower-bound of the practical support level. Given the
specified support threshold, PFIM can quickly return the required frequent itemsets on the table
by utilizing the quasi-frequent itemsets. Three pruning rules are presented to reduce the size of
the involved candidates. An incremental update strategy is devised to efficiently re-construct the
quasi-frequent itemsets when the tables are merged. The extensive experimental results,
conducted on synthetic and real-life data sets, show that PFIM has a significant advantage over
the existing algorithms and runs two orders of magnitude faster than the latest algorithm

.
 LIST OF FIGURES

Fig 3.4.1 Use case diagram of user………………………………………………………….09

Fig 3.4.2 Use case diagram of admin…………………………………………………………10

Fig 3.4.3 Class diagram for login and registration module…………………………………11

Fig 3.4.4 Class diagram for payment module……………...………………………………...12

Fig 3.4.5 Class diagram for cancellation module………….…………………………………13

Fig 4.5.1 Sample program……………………………………………………..........................37

Fig 4.5.2 Database tables………………………………...…………………………….............53

TABLE OF CONTENTS

CHAPTER 1: INTRODUCTION
1.1 Introduction to project……………………………………………………………….01
1.2 Existing System………………………………………………………………………....01
1.3 Proposed System………………………………………………………………………..02

CHAPTER 2: REQUIREMENT ANALYSIS

2.1 Feasibility Report………………………………………………………...………….02
2.2 System Requirement…………………………………………………..……………06

CHAPTER 3: LITERATURE SURVEY

3.1 Research History…………………………………………………………………….07

CHAPTER 4: SYSTEM DESIGN

4.1 Modules……………………………………………………………………………....09
4.2 Diagrams………………………………………………………………………..........11
4.2.2 Data Dictionary………………………………………………………………….....19

CHAPTER 5: SYSTEM IMPLEMENTATION

5.1 Technology Used…………………………………………………………………….22
5.2 Sample Code………………………………………………………….....38
CHAPTER 6: TESTING
6.1 Manual Testing……………………………………………………...…41
6.2 System Testing………………………………………………………….42
CHAPTER 7: SCREENSHOTS…………………………………………….....45
CHAPTER 8: CONCLUSION………………………………………………...56
CHAPTER 9: BIBLIOGRAPHY……………………………………………...58