Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
A PROJECT REPORT
Submitted by
ANTONY JAYASEELAN.G
MUTHU KUMARAN.D
PRAVVEEN.G
RAKESH.R
of
BACHELOR OF ENGINEERING
IN
BONAFIDE CERTIFICATE
SIGNATURE SIGNATURE
Dr.P.Palaniswamy, M.Tech(IIT-M), Ph.D(IISc) Mr.Mohana Prakash.T.A, B.E
HEAD OF THE DEPARTMENT SUPERVISOR
LECTURER
Computer Science & Engineering Computer Science & Engineering
Saveetha Engineering College, Saveetha Engineering College,
Saveetha Nagar, Saveetha Nagar,
Thandalam, Thandalam,
Chennai – 602 105 Chennai – 602 105
INTERNAL EXAMINER EXTERNAL EXAMINER
ACKNOWLEDGMENT
We would also like to thank our Project Coordinator Mr.Sridharan.K for his
support during the entire course of this project work.
We also thank all the staff members of our college and technicians for their help
in making this project a successful one.
Finally, we take this opportunity to extend our deep appreciation to our family
and friends, for all that they meant to us during the crucial times of the completion of
our project.
ABSTRACT
Efficient algorithms for mining frequent itemsets are crucial for mining
association rules as well as for many other data mining tasks. Methods for mining
experimental results have demonstrated that these algorithms perform extremely well.
In this paper, we present a novel FP-array technique that greatly reduces the
need to traverse FP-trees, thus obtaining significantly improved performance for FP-
tree-based algorithms. Our technique works especially well for sparse data sets.
Furthermore, we present new algorithms for mining all, maximal, and closed frequent
itemsets. Our algorithms use the FP-tree data structure in combination with the FP-
though the algorithms consume much memory when the data sets are sparse, they are
still the fastest ones when the minimum support is low. Moreover, they are always
among the fastest algorithms and consume less memory than other methods when the
and Departmental Stores etc. We implementing this algorithm adopted especially for
banking application
TABLE OF CONTENTS
TABLE OF CONTENTS
1. INTRODUCTION 2
1.1 ABSTRACT 2
2. LITERATURE REVIEW 3
2.1 EXISTING SYSTEM 3
2.2 PROPOSED SYSTEM 3
3. DESIGN 4
3.1 ARCHITECTURAL DESIGN 4
3.1.1 Proposed System Architecture 4
3.2 SYSTEM DESIGN 5
3.2.1 Module Description 5
3.2.2 Data Flow Diagram 8
3.2.3 Class Diagram 9
3.2.4 SequenceDiagram 10
3.2.5 ER Diagram 11
3.3 SYSTEM REQUIREMENTS
3.3.1 Hardware Requirements 12
3.3.2 Software Requirements 12
REFERENCES
SAMPLE CODE