
AbstractIn data mining, frequent itemsets plays an important role which is used to identify the correlations among the fields of database.In this paper, we propose a new association rule mining algorithm called Double Hashing Based Frequent Itemsets, (DHBFI) in which hashing technology is used to store the database in vertical data format. This double hashing technique is mainly preferred for avoiding the major issues of hash collision and secondary clustering problem in frequent itemset generation. Hence this proposed hashing technique makes the computation easier, faster and more efficient.Also this algorithm eliminates unnecessary redundant scans in the database and candidate itemset generation which leads to less space and time complexity.
Association Rule, Frequent Itemset, Secondary Clustering, Hash Collision, Double Hashing, Engineering(all)
Association Rule, Frequent Itemset, Secondary Clustering, Hash Collision, Double Hashing, Engineering(all)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
