Please use this identifier to cite or link to this item:
http://repositorio.ufla.br/jspui/handle/1/15026| metadata.ojs.dc.title: | Hash based mining algorithm for maximal frequent item sets using linear probing |
| metadata.ojs.dc.creator: | Rahman, A. M. J. Md. Zubair Balasubramanie, P. Krihsna, P. Venkata |
| metadata.ojs.dc.subject: | Mining Frequent item sets Hashing Linear probing MAFIA Maximal Frequent Itemset Algorithm (MAFIA) |
| metadata.ojs.dc.publisher: | Universidade Federal de Lavras (UFLA) |
| metadata.ojs.dc.date: | 1-Mar-2009 |
| metadata.ojs.dc.identifier.citation: | RAHMAN, A. M. M. Z.; BALASUBRAMANIE, P.; KRIHSNA, P. V. A Hash based mining algorithm for maximal frequent item sets using linear probing. INFOCOMP Journal of Computer Science, Lavras, v. 8, n. 1, p. 14-19, Mar. 2009. |
| metadata.ojs.dc.description.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. |
| metadata.ojs.dc.language: | eng |
| Appears in Collections: | Infocomp |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ARTIGO_Hash based mining algorithm for maximal frequent item sets using linear probing.pdf | 70,07 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License
