Actas de congresos
Multi-relational algorithm for mining association rules in large databases
Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 269-274.
Universidade Estadual Paulista (UNESP)
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.
Showing items related by title, author, creator and subject.
Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithm Valêncio, Carlos Roberto; Costa, Leandro Rincon; El Hetti Laurenti, Carlos Henrique; Cansian, Adriano Mauro
Use of a semantically grained database system for distribution and control within design environments Traina Jr., Caetano; Ferreira, João Eduardo; Biajiz, Mauro
Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support Valêncio, Carlos Roberto; Costa, Leandro Rincon; Neto, Paulo Scarpelini; Cansian, Adriano Mauro