Hash based mining algorithm for maximal frequent item sets using linear probing

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorRahman, A. M. J. Md. Zubair-
Autor(es): dc.creatorBalasubramanie, P.-
Autor(es): dc.creatorKrihsna, P. Venkata-
Data de aceite: dc.date.accessioned2026-02-09T11:21:20Z-
Data de disponibilização: dc.date.available2026-02-09T11:21:20Z-
Data de envio: dc.date.issued2009-03-01-
Data de envio: dc.date.issued2017-08-01-
Data de envio: dc.date.issued2017-08-01-
Data de envio: dc.date.issued2017-08-01-
Fonte completa do material: dc.identifierhttps://repositorio.ufla.br/handle/1/15026-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1139118-
Descrição: dc.descriptionData 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.-
Formato: dc.formatapplication/pdf-
Formato: dc.formatapplication/pdf-
Publicador: dc.publisherUniversidade Federal de Lavras (UFLA)-
Relação: dc.relationhttp://www.dcc.ufla.br/infocomp/index.php/INFOCOMP/article/view/246/231-
Direitos: dc.rightsAttribution 4.0 International-
Direitos: dc.rightsAttribution 4.0 International-
Direitos: dc.rightshttp://creativecommons.org/licenses/by/4.0/-
Direitos: dc.rightshttp://creativecommons.org/licenses/by/4.0/-
???dc.source???: dc.sourceINFOCOMP; Vol 8 No 1 (2009): March, 2009; 14-19-
???dc.source???: dc.source1982-3363-
???dc.source???: dc.source1807-4545-
Palavras-chave: dc.subjectMining-
Palavras-chave: dc.subjectFrequent item sets-
Palavras-chave: dc.subjectHashing-
Palavras-chave: dc.subjectLinear probing-
Palavras-chave: dc.subjectMAFIA-
Palavras-chave: dc.subjectMaximal Frequent Itemset Algorithm (MAFIA)-
Título: dc.titleHash based mining algorithm for maximal frequent item sets using linear probing-
Tipo de arquivo: dc.typeinfo:eu-repo/semantics/article-
Tipo de arquivo: dc.typeinfo:eu-repo/semantics/publishedVersion-
Aparece nas coleções:Repositório Institucional da Universidade Federal de Lavras (RIUFLA)

Não existem arquivos associados a este item.