Call for Paper - June Edition
IJCA solicits original research papers for the June Edition of IJCA. Last date of manuscript submission is May 21, 2012. Read More

Mining Frequent Patterns with Counting Inference at Multiple Levels

Print
PDF
International Journal of Computer Applications
© 2010 by IJCA Journal
Number 10 - Article 1
Year of Publication: 2010
Authors:
Mittar Vishav
Ruchika Yadav
Deepika Sirohi
10.5120/778-1100

Deepika Sirohi, Ruchika Yadav and Mittar Vishav. Article: Mining Frequent Patterns with Counting Inference at Multiple Levels. International Journal of Computer Applications 3(10):1–6, July 2010. Published By Foundation of Computer Science. BibTeX

@article{key:article,
	author = {Deepika Sirohi and Ruchika Yadav and Mittar Vishav},
	title = {Article: Mining Frequent Patterns with Counting Inference at Multiple Levels},
	journal = {International Journal of Computer Applications},
	year = {2010},
	volume = {3},
	number = {10},
	pages = {1--6},
	month = {July},
	note = {Published By Foundation of Computer Science}
}

Abstract

Mining association rules at multiple levels helps in finding more specific and relevant knowledge. While computing the number of frequency of an item we need to scan the given database many times. So we used counting inference approach for finding frequent itemsets at each concept levels which reduce the number of scan. In this paper, we purpose a new algorithm LWFT which follow the top-down progressive deepening method and it is based on existing algorithms for finding multiple level association rules. This algorithm is efficient for finding frequent itemsets from large databases.

Reference

  • Jiawei Han, Micheline Kamber “Data Mining Concepts and Techniques” Harcourt India Private Limited ISBN:81-7867-023-2, 2001.
  • R. Agrawal, T. Imielinski, and A. Swami, “Mining association rules between sets of items in large databases”. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 207-216, Washington, DC, May 26-28 1993.
  • Jiawei Han and Yongjian Fu., “Discovery of Multiple-Level Association Rules from Large Databases”. Proceeding in IEEE Trans. on Knowledge and Data Eng. Vol. 11 No. 5, pp 798-804, 1999.
  • R. Agrawal and R, Shrikanth, “Fast Algorithm for Mining Association Rules”. Proceedings Of VLDB conference, pp 487 – 449, Santigo, Chile, 1994.
  • M.H.Margahny and A.A.Mitwaly, “Fast Algorithm for Mining Association Rules”. Proceedings of AIML 05 Conference, CICC, Cairo, Egypt, 19-21 December 2005.
  • Jiawei Han and Yongjian Fu, “Discovery of Multiple-Level Association Rules from Large Databases”. Proceedings of the 21st VLDB Conference Zurich, Swizerland, 1995.
  • R. S. Thakur, R. C. Jain and K. R. Pardasani, “Fast Algorithm for mining multi-level association rules in large databases”. Asian Journal of International Management 1(1):19-26, 2007.
  • Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme and Lotfi Lakhal, “Mining Frequent Patterns with Counting Inference”. In proceeding of ACM SIGKDD, December 2000, pp68-75.
  • N.Rajkumar, M.R.Karthik, and S.N.Sivanandam, “Fast algorithm for Mining Multilevel Association Rules”, 0-7803-7651-X/03/$17.00 © 2003 IEEE
Learn about the IJCA article correction policy and process
Dealing with any form of copyright/ intellectual infringement.
Excerpts from the book ‘Peer Review – A Critical Inquiry’ by David Shatz
Take advantage of the special issue on Network Security
Directly place requests for print/ hard copies of IJCA via Google Docs