Multi-relational algorithm for mining association rules in large databases

Nenhuma Miniatura disponível

Data

2011-12-01

Autores

Orientador

Coorientador

Pós-graduação

Curso de graduação

Título da Revista

ISSN da Revista

Título de Volume

Editor

Tipo

Trabalho apresentado em evento

Direito de acesso

Acesso abertoAcesso Aberto

Resumo

Multi-relational data mining enables pattern mining from multiple tables. The existing multi-relational mining association rules algorithms are not able to process large volumes of data, because the amount of memory required exceeds the amount available. The proposed algorithm MRRadix presents a framework that promotes the optimization of memory usage. It also uses the concept of partitioning to handle large volumes of data. The original contribution of this proposal is enable a superior performance when compared to other related algorithms and moreover successfully concludes the task of mining association rules in large databases, bypass the problem of available memory. One of the tests showed that the MR-Radix presents fourteen times less memory usage than the GFP-growth. © 2011 IEEE.

Descrição

Palavras-chave

Association rules, Frequent itemsets mining, Multi-relational data mining, Relational database, Item sets, Large database, Memory usage, Mining associations, Multirelational data mining, Pattern mining, Relational Database, Algorithms, Data mining, Database systems

Idioma

Inglês

Como citar

Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 269-274.

URI

http://hdl.handle.net/11449/72859

Itens relacionados

Financiadores

Coleções

São José do Rio Preto - IBILCE - Instituto de Biociências, Letras e Ciências Exatas