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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Novel Approach for finding Frequent Item Sets with Hybrid Strategies

by J.R.Jeba, S.P.Victor
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 17 - Number 5
Year of Publication: 2011
Authors: J.R.Jeba, S.P.Victor
10.5120/2214-2819

J.R.Jeba, S.P.Victor . A Novel Approach for finding Frequent Item Sets with Hybrid Strategies. International Journal of Computer Applications. 17, 5 ( March 2011), 30-33. DOI=10.5120/2214-2819

@article{ 10.5120/2214-2819,
author = { J.R.Jeba, S.P.Victor },
title = { A Novel Approach for finding Frequent Item Sets with Hybrid Strategies },
journal = { International Journal of Computer Applications },
issue_date = { March 2011 },
volume = { 17 },
number = { 5 },
month = { March },
year = { 2011 },
issn = { 0975-8887 },
pages = { 30-33 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume17/number5/2214-2819/ },
doi = { 10.5120/2214-2819 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:04:49.907617+05:30
%A J.R.Jeba
%A S.P.Victor
%T A Novel Approach for finding Frequent Item Sets with Hybrid Strategies
%J International Journal of Computer Applications
%@ 0975-8887
%V 17
%N 5
%P 30-33
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Frequent item sets mining plays an important role in association rules mining. Over the years, a variety of algorithms for finding frequent item sets in very large transaction databases have been developed. Therefore, a number of methods have been proposed recently to discover approximate frequent item sets. This paper proposes an efficient SMine (Sorted Mine) Algorithm for finding frequent item sets. This proposed method reduces the number of scans in the database. Our proposed SMine algorithm works well based on graph construction. At last we performed an experiment on a real dataset to test the run time of our proposed algorithm. The experiment showed that it was efficient for mining datasets.

References
  1. Savasere, E. Omiecinski and S. Navathe, “An efficient algorithm for mining association rules in large databases”, Proceedings of the 21st International Conference on Very large database, 1995, pp. 420-431.
  2. Jia Ling, Koh and Vi-Lang Tu, “ A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets”, IEEE International Conference on Research Challenges in Information Science, 2010, pp. 25-36.
  3. Jian Pei ,J. Han, J. Lu, H. Nishio.S.and Tang, “H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases”, ICDM International Conference on Data Mining, ICDM, 2001, pp. 441-448.
  4. Jiawei Han, Jian Pei, and Yiwen Yin, “Mining Frequent Patterns without Candidate Generation”, Proceedings of ACM SIGMOD Conference, Dallas, TX, 2000, pp.53-87.
  5. Jong Soo Park, M.S. Chen, and P.S. Yu, “An effective hash based algorithm for mining association rules”, Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, California, May 22-25, 1995, pp. 175-188.
  6. Ramesh Agrawal and Ramakrishnan Srikant, “Fast algorithms for mining association rules”, proceedings of the 20th VLDB Conference Santiago,Chille, 1994, pp. 487-499.
  7. Ramesh Agrawal, Tomasz Imielinski, and A. Swami, “Mining association rules between sets of items in large databases”, ACM-SIGMOD Int. Conf. Management of Data, Washington, D.C., May 1993, pp 207–216.
  8. Senthil Kumar A.V and R.S.D. Wahidabanu, “A Frequent Item Graph Approach for Discovering Frequent Itemsets“, Proceedings of 2008 IEEE International Conference on Advanced Computer Theory, 2008, pp.952-956.
  9. Yudho Giri Sucahyo and Gopalan.R, “Efficient Frequent Item Set Mining using a Compressed Prefix Tree with Pattern Growth”, Proceedings of 14th Australian Database Conference, Adelaide, Australia, 2003, pp.95-104
Index Terms

Computer Science
Information Sciences

Keywords

SMine item_count frequent_items

Powered by PhDFocusTM