Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approach
Autor(a) principal: | |
---|---|
Data de Publicação: | 2011 |
Outros Autores: | , , |
Tipo de documento: | Artigo de conferência |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1109/PDCAT.2011.29 http://hdl.handle.net/11449/72858 |
Resumo: | 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 multirelational advantage in performance over several tables, which avoids the costly join operations from multiple tables. © 2011 IEEE. |
id |
UNSP_f21c09a91d2549b3932da745985753fb |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/72858 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approachAssociation rulesMining frequent itemsetsMR-radixMulti-relational data miningRelational databasesComparative studiesEmpirical approachExecution timeJoin operationMemory usageMining associationsMultirelational data miningRelational DatabaseStructured dataData miningDatabase systemsAlgorithmsThe 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 multirelational advantage in performance over several tables, which avoids the costly join operations from multiple tables. © 2011 IEEE.Depto. de Ciências de Computação e Estatística Universidade Estadual Paulista - Unesp, São José do Rio PretoDepto. de Ciências de Computação e Estatística Universidade Estadual Paulista - Unesp, São José do Rio PretoUniversidade Estadual Paulista (Unesp)Valêncio, Carlos Roberto [UNESP]Oyama, Fernando Takeshi [UNESP]Neto, Paulo Scarpelini [UNESP]De Souza, Rogéria Cristiane Gratão [UNESP]2014-05-27T11:26:14Z2014-05-27T11:26:14Z2011-12-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject275-280http://dx.doi.org/10.1109/PDCAT.2011.29Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 275-280.http://hdl.handle.net/11449/7285810.1109/PDCAT.2011.292-s2.0-84856658965464481225387583259146517545178640000-0002-9325-31590000-0002-7449-9022Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengParallel and Distributed Computing, Applications and Technologies, PDCAT Proceedingsinfo:eu-repo/semantics/openAccess2021-10-23T10:10:55Zoai:repositorio.unesp.br:11449/72858Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T20:16:11.572960Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approach |
title |
Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approach |
spellingShingle |
Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approach Valêncio, Carlos Roberto [UNESP] Association rules Mining frequent itemsets MR-radix Multi-relational data mining Relational databases Comparative studies Empirical approach Execution time Join operation Memory usage Mining associations Multirelational data mining Relational Database Structured data Data mining Database systems Algorithms |
title_short |
Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approach |
title_full |
Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approach |
title_fullStr |
Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approach |
title_full_unstemmed |
Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approach |
title_sort |
Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approach |
author |
Valêncio, Carlos Roberto [UNESP] |
author_facet |
Valêncio, Carlos Roberto [UNESP] Oyama, Fernando Takeshi [UNESP] Neto, Paulo Scarpelini [UNESP] De Souza, Rogéria Cristiane Gratão [UNESP] |
author_role |
author |
author2 |
Oyama, Fernando Takeshi [UNESP] Neto, Paulo Scarpelini [UNESP] De Souza, Rogéria Cristiane Gratão [UNESP] |
author2_role |
author author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (Unesp) |
dc.contributor.author.fl_str_mv |
Valêncio, Carlos Roberto [UNESP] Oyama, Fernando Takeshi [UNESP] Neto, Paulo Scarpelini [UNESP] De Souza, Rogéria Cristiane Gratão [UNESP] |
dc.subject.por.fl_str_mv |
Association rules Mining frequent itemsets MR-radix Multi-relational data mining Relational databases Comparative studies Empirical approach Execution time Join operation Memory usage Mining associations Multirelational data mining Relational Database Structured data Data mining Database systems Algorithms |
topic |
Association rules Mining frequent itemsets MR-radix Multi-relational data mining Relational databases Comparative studies Empirical approach Execution time Join operation Memory usage Mining associations Multirelational data mining Relational Database Structured data Data mining Database systems Algorithms |
description |
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 multirelational advantage in performance over several tables, which avoids the costly join operations from multiple tables. © 2011 IEEE. |
publishDate |
2011 |
dc.date.none.fl_str_mv |
2011-12-01 2014-05-27T11:26:14Z 2014-05-27T11:26:14Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/conferenceObject |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://dx.doi.org/10.1109/PDCAT.2011.29 Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 275-280. http://hdl.handle.net/11449/72858 10.1109/PDCAT.2011.29 2-s2.0-84856658965 4644812253875832 5914651754517864 0000-0002-9325-3159 0000-0002-7449-9022 |
url |
http://dx.doi.org/10.1109/PDCAT.2011.29 http://hdl.handle.net/11449/72858 |
identifier_str_mv |
Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 275-280. 10.1109/PDCAT.2011.29 2-s2.0-84856658965 4644812253875832 5914651754517864 0000-0002-9325-3159 0000-0002-7449-9022 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
275-280 |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1808129181596254208 |