Multi-relational algorithm for mining association rules in large databases
MetadataShow full item record
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.
How to cite this document
Showing items related by title, author, creator and subject.
Use of a semantically grained database system for distribution and control within design environments Traina Jr., Caetano; Ferreira, João Eduardo ; Biajiz, Mauro (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1997) [Trabalho apresentado em evento]This paper presents a technique to share the data stored in an object-oriented database aimed at designing environments. This technique shares data between two related databases, called the Original and Product databases, ...
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 (Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, 2011) [Trabalho apresentado em evento]In a peer-to-peer network, the nodes interact with each other by sharing resources, services and information. Many applications have been developed using such networks, being a class of such applications are peer-to-peer ...
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 (Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, 2011) [Trabalho apresentado em evento]A significant set of information stored in different databases around the world, can be shared through peer-topeer databases. With that, is obtained a large base of knowledge, without the need for large investments because ...