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 Tree based Approach for Generating Association Rules

by N. K. Sharma, R. C. Jain
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 68 - Number 7
Year of Publication: 2013
Authors: N. K. Sharma, R. C. Jain
10.5120/11593-6945

N. K. Sharma, R. C. Jain . A Tree based Approach for Generating Association Rules. International Journal of Computer Applications. 68, 7 ( April 2013), 26-30. DOI=10.5120/11593-6945

@article{ 10.5120/11593-6945,
author = { N. K. Sharma, R. C. Jain },
title = { A Tree based Approach for Generating Association Rules },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 68 },
number = { 7 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 26-30 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume68/number7/11593-6945/ },
doi = { 10.5120/11593-6945 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:27:12.476393+05:30
%A N. K. Sharma
%A R. C. Jain
%T A Tree based Approach for Generating Association Rules
%J International Journal of Computer Applications
%@ 0975-8887
%V 68
%N 7
%P 26-30
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The FP-tree algorithm is one of the fastest techniques for generating frequent item set for association rule mining. Extracting frequent item set and generating association rules are two major challenges in a large student admission database. The same is tried to present in this paper with the help of sample data set.

References
  1. Usama Fayyad, Gregory Piatetsky-Shapiro, and Padhraic Smyth, "From Data Mining to Knowledge Discovery in Databases", AAAI, 1996.
  2. Andreas Mueller, "Fast Sequential and Parallel Algorithms for Association Rule Mining: A Comparison", 1995.
  3. Agrawal, R. , and Psaila, G. 1995. Active Data Mining. In Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD-95). Menlo Park, Calif. : American Association for Artificial Intelligence.
  4. M-S Chen, J Han and P. S. Yu, Data Mining : An Overview from a Database Perspective, IEEE Tran. On Knowledge and Data Engg. , December,1996.
  5. R. Agrawal, T. Imienski and A. Swamy, Database Mining : A Performance Perspective, IEEE Tran. On Knowledge and Data Engg. , December,1991.
  6. Rakesh Agrawal, and Ramakrishnan Srikant, "Fast Algorithms for Mining Association Rules", Proceedings of the 20th VLDB Conference Santiago,Chile,1994.
  7. M. Houtsma and A. Swami. Set-oriented Mining of Association Rules. Research Report RJ 9567, IBM Almaden Research Center,SanJose,California,October1993.
  8. Qiankun Zhao and SouravS. Bhowmick, "Association Rule Mining: A Survey", Singapore.
  9. U. Fayyad, G. P. Shapiro and P. Smyth, The KDD Process for extracting Useful Knowledge from Volumes of Data, Communication of the ACM, Nov. , 1996.
  10. T. Imielinski and H. Mannila, A Database Perspective on Knowledge Discovery, Communication of the ACM, Nov. , 1996.
  11. A. Sawasere, E. Omiecinski and S. Nawathe, An Efficient Algorithm For Mining Association Rules In Large Databases, Proceedings Of The 21st VLDB Conference, Zurich, 1995.
Index Terms

Computer Science
Information Sciences

Keywords

Frequent Item Set A-priori P- tree FP-Tree Data set

Powered by PhDFocusTM