CFP last date
20 December 2024
Reseach Article

Association Rule Generation using Modified Hashing Function

by M. Ramakrishnana, D. Tennyson Jyaraj
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 95 - Number 1
Year of Publication: 2014
Authors: M. Ramakrishnana, D. Tennyson Jyaraj
10.5120/16561-5849

M. Ramakrishnana, D. Tennyson Jyaraj . Association Rule Generation using Modified Hashing Function. International Journal of Computer Applications. 95, 1 ( June 2014), 33-36. DOI=10.5120/16561-5849

@article{ 10.5120/16561-5849,
author = { M. Ramakrishnana, D. Tennyson Jyaraj },
title = { Association Rule Generation using Modified Hashing Function },
journal = { International Journal of Computer Applications },
issue_date = { June 2014 },
volume = { 95 },
number = { 1 },
month = { June },
year = { 2014 },
issn = { 0975-8887 },
pages = { 33-36 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume95/number1/16561-5849/ },
doi = { 10.5120/16561-5849 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:18:20.047137+05:30
%A M. Ramakrishnana
%A D. Tennyson Jyaraj
%T Association Rule Generation using Modified Hashing Function
%J International Journal of Computer Applications
%@ 0975-8887
%V 95
%N 1
%P 33-36
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Association rule mining is one of the most interesting and challenging task in data mining process. There exists many association rule mining techniques, each having merits and demerits. The main problem that exists in many traditional association rule mining algorithms is that these algorithms need more than one database scan to generate association rules. As scanning the database is a costly operation, algorithms capable of generating association rules with only one scan is the need of the hour. In this paper, a novel algorithm for generating association rules is presented which uses hashing function. This algorithm scans the database only once by utilizing the latest version of priori algorithm, direct hashing algorithm and pruning process. The algorithm discovers set of association rules from frequent k-item sets by computing the frequency of each item set. Then pruning process is applied to minimize the number of item sets generated after scanning the size of the database. Experimental results show that our method is very effective in generating association rules without any collision, leading to very high data accuracy.

References
  1. Y. Yin et al. , "Association Rules Mining in Inventory Database", Data Mining. © Springer 2011
  2. Lei Chen "The Research of Data Mining Algorithm Based on Association Rules", The 2nd International Conference on Computer Application and System Modeling (2012)
  3. Han, J. , Kamber, M. & Pei, J. (2006). Data Mining: Concepts and Techniques, 2nd edition, Morgan Kaufmann.
  4. Hui Cao; Gangquan Si; Yanbin Zhang; Lixin Jia, "A density-based quantitative attribute partition algorithm for association rule mining on industrial database," American Control Conference, 2008 , vol. , no. , pp. 75,80, 11-13 June 2008
  5. Kanakubo, M. ; Hagiwara, M. , "Speed-up Technique for Association Rule Mining Based on an Artificial Life Algorithm," Granular Computing, 2007. GRC 2007. IEEE International Conference on , vol. , no. , pp. 318,318, 2-4 Nov. 2007
  6. R. Amornchewin and W. Kreesuradej "Incremental association rule mining using promising frequent itemset algorithm", In proceeding of Information, Communications & Signal Processing, 2007 6th International Conference on Data Mining
  7. Jong Soo Park , Ming-Syan Chen , Philip S. Yu, Efficient parallel data mining for association rules, Proceedings of the fourth international conference on Information and knowledge management, p. 31-36, November 29-December 02, 1995, Baltimore, Maryland, United States [doi : 10. 1145/221270. 221320]
  8. Ya-Han Hu, Yen-Liang Chen, Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism, Decision Support Systems, Volume 42, Issue 1, October 2006, Pages 1-24, ISSN 0167-9236,
  9. Farah Hanna AL-Zawaidah, Yosef Hasan Jbara, Marwan AL-Abed Abu-Zanona, " An Improved Algorithm for Mining Association Rules in Large Databases", World of Computer Science and Information Technology Journal, Vol. 1, No. 7, pp. 311-316, 2011.
  10. A. Zemirline, Lecornu, B. Solaiman, and A. Echcherif, "An Efficient Association Rule Mining Algorithm for Classification ", L. Rutkowski et al. (Eds. ): ICAISC 2008, LNAI 5097, pp. 717 728, 2008. Springer, Verlag Berlin Heidelberg 2008
  11. Rathinasabapathy, R. ; Bhaskaran, R. , "Performance Comparison of Hashing Algorithm with Apriori," Advances in Computing, Control, & Telecommunication Technologies, 2009. ACT '09. International Conference on , vol. , no. , pp. 729,733, 28-29 Dec. 2009
  12. Park, J. S. , Chen, M. & Yu, P. (1995). "An Effective Hash-Based Algorithm for Mining Association Rules," ACM SIGMOD Record archive, 24(2), 175 – 186.
  13. Seiden, S. S. & Hirschberg, D. S. (1994). "Finding Succinct Ordered Minimal Perfect Hash Function," Elsevier Information Processing Letters, 51(6), 283-288.
  14. Sun, X. , Li, M. , Wang, H. & Plank, A. (2008). "An Efficient Hash-Based Algorithm for Minimal K-Anonymity," Proceedings of the thirty-first Australasian conference on Computer science, 01 01 January, Wollongong, Australia, 101-107.
  15. Tseng, M. , Lin, W. & Jeng, R. (2008). "Incremental Maintenance of Generalized Association Rules under Taxonomy Evolution," Journal of Information Science, 34(2),174-195.
  16. Han, J. , Kamber, M. & Pei, J. (2006). Data Mining: Concepts and Techniques, 2nd edition, Morgan Kaufmann.
Index Terms

Computer Science
Information Sciences

Keywords

Association Rule Mining ARM Hashing Pruning Basket Market Analysis Apriori Algorithm