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

Mining Association Rules using Hash Table

by K. Rajeswari, V. Vaithiyanathan, Swati.tonge, Rashmi Phalnikar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 57 - Number 8
Year of Publication: 2012
Authors: K. Rajeswari, V. Vaithiyanathan, Swati.tonge, Rashmi Phalnikar
10.5120/9132-3320

K. Rajeswari, V. Vaithiyanathan, Swati.tonge, Rashmi Phalnikar . Mining Association Rules using Hash Table. International Journal of Computer Applications. 57, 8 ( November 2012), 7-11. DOI=10.5120/9132-3320

@article{ 10.5120/9132-3320,
author = { K. Rajeswari, V. Vaithiyanathan, Swati.tonge, Rashmi Phalnikar },
title = { Mining Association Rules using Hash Table },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 57 },
number = { 8 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 7-11 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume57/number8/9132-3320/ },
doi = { 10.5120/9132-3320 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:59:52.740861+05:30
%A K. Rajeswari
%A V. Vaithiyanathan
%A Swati.tonge
%A Rashmi Phalnikar
%T Mining Association Rules using Hash Table
%J International Journal of Computer Applications
%@ 0975-8887
%V 57
%N 8
%P 7-11
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Data mining is a field which searches for interesting knowledge or information from existing massive collection of data. In particular, algorithms like Apriori help a researcher to understand the potential knowledge, deep inside the data base. But due to the large time consumed by Apriori to find the frequent item sets and generate rules, several applications cannot use this algorithm. In this paper, we describe the modification of Apriori algorism, which will reduce the time taken for execution to a larger extent.

References
  1. Srikant, R and Agarwal, R. 1995. Mining Generalisation Association Rules. In Proceedings of 21st VLDB Conference. pp 407-419.
  2. Agrawal, Srikant, R. 1994. Fast Algorithms for Mining Association Rules. Proc. of the 20th Int'l Conference on Very Large Databases, Santiago, Chile
  3. Agarwal R, Skikant R. 1996. Mining Quantitative Rules in Large Relational Tables [C] / / Proc of the ACM SIGMOD Conf on Management of Data. 1996:1-12.
  4. Han J,Kamber M. Data Mining:Concepts and Techniques. Higher Education Press,200I.
  5. Jiawei Han, Micheline Kamber, Data Mining Concepts and Techniques, 2nd ed. China Machine Press, 2006, pp. 155–160.
  6. Xie, Jianhua Wu, Qingquan Qian. 2009. Feature Selection Algorithm Based on Association Rules Mining Method. IEEE.
  7. X. Luo and W. Wang, "Improved Algorithms Research for Association Rule Based on Matrix," 2010 International Conference on Intelligent Computing and Cognitive Informatics, pp. 415–419, Jun. 2010.
  8. Libing Wu , KuiGong , Fuliang Guo "Research on Improving Apriori Algorithm Based on Interested Table",IEEE,2010
  9. R. Chang and Z. Liu, "An Improved Apriori Algorithm," no. Iceoe, pp. 476–478, 2011.
  10. CHARM: An Efficient Algorithm for Closed Itemset Mining by Mohammed J. Zaki and Ching-Jui Hsiao
  11. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In 7th Intl. Conf. on Database Theory, January 1999.
  12. Pang-Ning Tan, Michael Steinbach, Vipin Kumar "Introduction to Data Mining", Addison Wesley.
Index Terms

Computer Science
Information Sciences

Keywords

Data mining Knowledge frequent item sets rules Apriori Algorithm

Powered by PhDFocusTM