CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

An Experimental Study of Pattern Mining Technique to improve the Business Strategy

by S.Megal, Dr.M.Hemalatha, Dr.T.Christopher, P.Soundar Rajan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 34 - Number 3
Year of Publication: 2011
Authors: S.Megal, Dr.M.Hemalatha, Dr.T.Christopher, P.Soundar Rajan
10.5120/4076-5397

S.Megal, Dr.M.Hemalatha, Dr.T.Christopher, P.Soundar Rajan . An Experimental Study of Pattern Mining Technique to improve the Business Strategy. International Journal of Computer Applications. 34, 3 ( November 2011), 1-5. DOI=10.5120/4076-5397

@article{ 10.5120/4076-5397,
author = { S.Megal, Dr.M.Hemalatha, Dr.T.Christopher, P.Soundar Rajan },
title = { An Experimental Study of Pattern Mining Technique to improve the Business Strategy },
journal = { International Journal of Computer Applications },
issue_date = { November 2011 },
volume = { 34 },
number = { 3 },
month = { November },
year = { 2011 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume34/number3/4076-5397/ },
doi = { 10.5120/4076-5397 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:20:01.566041+05:30
%A S.Megal
%A Dr.M.Hemalatha
%A Dr.T.Christopher
%A P.Soundar Rajan
%T An Experimental Study of Pattern Mining Technique to improve the Business Strategy
%J International Journal of Computer Applications
%@ 0975-8887
%V 34
%N 3
%P 1-5
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Pragmatism of pattern mining system is to study the data and determines a model that is closets to characteristics of the data being examine. This necessitates identifying interesting association patterns idea can be described as a recursive eradication method in a preprocessing step, that remove all items from the transactions that are not regular individually, i.e., do not appear in a user-specified least number of transactions. Then choose all transactions that have the least regular item (least frequent along with those that are frequent) and delete this item from them. Recursive to procedure the obtained reduced (also known as projected) database, evoke that the entry sets construct in the recursion split the deleted item as a prefix. On revisit, eliminate the processed item also from the folder of all transactions and start over, process the second frequent item etc. In these dispensation steps the prefix tree, which is improved by associations between the branches, is demoralized to quickly discover the transactions containing a specific entry and also to eliminate this entry starting the business after it has been processed.

References
  1. Jiawei Han and Micheline Kamber. Data Mining: Concepts and Techniques.Morgan Kaufmann Publishers, 2001.
  2. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 487–499. Morgan Kaufmann Publishers Inc., 1994.
  3. Herb Edelsten. Mining large databases - a case study. Technical report.
  4. C.C.Aggrawal and P.S.Yu. “Mining large itemsets for association rules”. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 21(1): 23-31, March 1998.
  5. Cai, C.H., Fu, A.W-C., Cheng, C. H., Kwong, W.W. “Mining Association Rules with Weighted Items”. In: Proceedings of 1998 Intl. Database Engineering and Applications Symposium (IDEAS'98), pages 68--77, Cardiff, Wales, UK, July 1998.
  6. Wang, C., Tjortjis, C., “PRICES: An Efficient Algorithm for Mining Association Rules,” Lecture Notes in Computer Science, Volume 3177, Jan 2004, Pages 352 – 358.
  7. C. Borgelt. “An implementation of the FP-growth algorithm”. In Proceeding of OSDM 2005, pp.1-5, 2005.
  8. D.Sujatha, B.L.Deekshatulu,”Agorithm for mining time varying frequent itemsets” Journal of Theoretical and Applied Information Technology,2009Vol 6 (2) pp165-170.
  9. GK Palshikar, MS Kale, MM Apte, “Association rules mining using heavy itemsets”, Data and Knowledge Engineering, Vol. 61, No. 1, pp. 93-113, 2007.
  10. Agarwal, C. Agarwal, and V.V.V.Prasad, “ATree Projection Algorithm for Generation of Itemsets,”Journal on Puraflel Distributed Computing, 2000, Vol.61, pp, 350.
  11. Leung, C. K.-S., and Khan, Q. I. 2006. DSTree: A tree structure for the mining of frequent sets from data streams. InProc. of the 6th Int. Conf. on Data Mining (ICDM). 928-932.
  12. Tanbeer, S. K., Ahmed, C. F., Jeong, B.-S., and Lee, Y.-K2008. CP-tree: a tree structure for single-pass frequent pattern mining. In Proc. of PAKDD, Lect Notes Artif Int, 1022-1027.
  13. Lilin FAN, “Research on Classification Mining Method of Frequent Itemset”, JCIT: Journal of Convergence Information Technology, vol. 5, no. 8, pp. 71-77, 2010.
  14. Jyothi Pillai, O.P.Vyas, "Overview of Itemset Utility Mining and its Applications",International Journal of Computer Applications, Vol: 5, No.11, August 2010.
  15. Bac Le, Huy Nguyen, Tung Anh Cao, Bay Vo, "A Novel Algorithm for Mining High Utility Itemsets", First Asian Conference on Intelligent Information and Database Systems, Dong Hoi, pp: 13 - 17, 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Data mining Association Rule FP-growth Frequent Pattern Prefix Tree

Powered by PhDFocusTM