A Hash based Mining Algorithm for Maximal Frequent Item Sets using Linear Probing
Main Article Content
Abstract
Data mining is having a vital role in many of the applications like market-basket analysis, in biotechnology field etc. In 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 an algorithm, HBMFI-LP which hashing technology to store the database in vertical data format. To avoid hash collisions, linear probing technique is utilized. The proposed algorithm generates the exact set of maximal frequent itemsets directly by removing all nonmaximal itemsets. The proposed algorithm is compared with the recently developed MAFIA algorithm and is shown that the HBMFI-LP outperforms in the order of two to three
Article Details
How to Cite
Rahman, A. M. M. Z., Balasubramanie, P., & Krihsna, P. V. (2009). A Hash based Mining Algorithm for Maximal Frequent Item Sets using Linear Probing. INFOCOMP Journal of Computer Science, 8(1), 14–19. Retrieved from https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/246
Section
Articles
Upon receipt of accepted manuscripts, authors will be invited to complete a copyright license to publish the paper. At least the corresponding author must send the copyright form signed for publication. It is a condition of publication that authors grant an exclusive licence to the the INFOCOMP Journal of Computer Science. This ensures that requests from third parties to reproduce articles are handled efficiently and consistently and will also allow the article to be as widely disseminated as possible. In assigning the copyright license, authors may use their own material in other publications and ensure that the INFOCOMP Journal of Computer Science is acknowledged as the original publication place.