International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 57 - Issue 8 |
Published: November 2012 |
Authors: K. Rajeswari, V. Vaithiyanathan, Swati.Tonge, Rashmi Phalnikar |
![]() |
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 }, year = { 2012 }, volume = { 57 }, number = { 8 }, pages = { 7-11 }, doi = { 10.5120/9132-3320 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A K. Rajeswari %A V. Vaithiyanathan %A Swati.Tonge %A Rashmi Phalnikar %T Mining Association Rules using Hash Table%T %J International Journal of Computer Applications %V 57 %N 8 %P 7-11 %R 10.5120/9132-3320 %I Foundation of Computer Science (FCS), NY, USA
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.