By Topic

Multi-relational Algorithm for Mining Association Rules in Large Databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Carlos Roberto ValĂȘncio ; Depto. de Cienc. de Comput. e Estatistica, Univ. Estadual Paulista-Unesp, Sao Jose do Rio Preto, Brazil ; Fernando Takeshi Oyama ; Fernando Tochio Ichiba ; Rogeria Cristiane Gratao de Souza

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 MR-Radix 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.

Published in:

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies

Date of Conference:

20-22 Oct. 2011