Raman, Mithuna and Hegde, Manu S and Jacob, Teslin and Kumar, Preetham and Pai, Radhika M (2012) An Optimized Hash Map Algorithm for Each Individual Object and an Efficient Addressing Scheme. In: Second International Conference on Computational Intelligence and Information Technology – CIIT 2012 , Dec 03-04 , President Hotel and Towers, Chennai, India .

PDF rmp_raman_ciit_2012.pdf - Published Version Restricted to Registered users only Download (30kB) | Request a copy

Abstract

We intend to propose in this paper a new data mining technique which uses the concept of hash maps and a static reference array, and will eliminate the need of frequently scanning the dataset. It creates the frequent item sets dynamically at run time. The subsets will be generated as the transactions are read and the counts will be updated. It eliminates the need to compare each transaction with the other transactions because each item will have its own hash map. This method can be used in real time systems as well.

Actions (login required)

View Item