By Topic

Comparative Study of Algorithms for Mining Association Rules: Traditional Approach versus Multi-relational Approach

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 ; Paulo Scarpelini Neto ; Rogeria Cristiane Gratao de Souza

The multi-relational Data Mining approach has emerged as alternative to the analysis of structured data, such as relational databases. Unlike traditional algorithms, the multi-relational proposals allow mining directly multiple tables, avoiding the costly join operations. In this paper, is presented a comparative study involving the traditional Patricia Mine algorithm and its corresponding multi-relational proposed, MR-Radix in order to evaluate the performance of two approaches for mining association rules are used for relational databases. This study presents two original contributions: the proposition of an algorithm multi-relational MR-Radix, which is efficient for use in relational databases, both in terms of execution time and in relation to memory usage and the presentation of the empirical approach multi-relational advantage in performance over several tables, which avoids the costly join operations from multiple tables.

Published in:

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

Date of Conference:

20-22 Oct. 2011