e-ISSN 2393-9877•p-ISSN 2394-2444•Quarterly•Open Access•IF 5.99
Track PaperUpload ReceiptContact
IJAREST logoIJARESTInt. Journal of Advance Research in Engineering, Science & Technology

“Frequent Pattern – Projected Sequential Pattern Mining Improve its Efficiency and Scalability”

Ankita M Patel, Asst. Prof. Dhaval Patel

Post Graduate Student of Hasmukh Goswami college of Engineering, Ahmedabad, India

IJAR-2016-551AAAVol. 3, Issue 5May 2016Pages 448-455

Abstract

Data mining has become an important field and has been applied extensively across many areas. Mining frequent item sets in a transaction database is critical for mining association rules. This paper propose a novel frequent-pattern tree (FP-tree) structure, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and develop an efficient FP-tree based mining method. Efficiency of mining is achieved by the apply parallel projected database and partition projected database in frequent pattern tree to reduce the database scan, execution time and less memory. So the large database is compressed into a condensed, smaller data structure. The FP Tree algorithm is faster than the Apriori algorithm and also faster than new proposed projected database frequent-pattern tree.

Keywords

How to cite

APA
Ankita M Patel, Asst. Prof. Dhaval Patel (2016). “Frequent Pattern – Projected Sequential Pattern Mining Improve its Efficiency and Scalability”. IJAREST, 3(5), 448-455.
BibTeX
@article{ijarest2016551AAA,
  title={{“Frequent Pattern – Projected Sequential Pattern Mining Improve its Efficiency and Scalability”}},
  author={Ankita M Patel and Asst. Prof. Dhaval Patel},
  journal={IJAREST},
  volume={3},
  number={5},
  pages={448-455},
  year={2016}
}

Published under an open-access licence. See copyright & licensing.

✆