Basic Framework of CATSIM Tree for Efficient Frequent Pattern Mining
Autor(a) principal: | |
---|---|
Data de Publicação: | 2009 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/271 |
Resumo: | Finding frequent patterns from databases have been the most time consuming process in association rule mining. Several effective data structures, such as two-dimensional arrays, graphs, trees and tries have been proposed to collect candidate itemsets and frequent itemsets. It seems that the tree structure is most extractive to storing itemsets. The outstanding tree has been proposed so far is called FP-tree which is a prefix tree structure. Some advancement with this tree structure is called CATS tree. CATS Tree extends an idea of FP-Tree to improve storage compression and allow frequent pattern mining without generation of candidate itemsets. It allows the mining with a single pass over the database. In this work, CATSIM Tree is presented for which an attempt has been made to modify present CATS Tree in order to make it efficient for incremental mining. |
id |
UFLA-5_d241d2fb134bc4bb65d1993d6b25cf47 |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/271 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
Basic Framework of CATSIM Tree for Efficient Frequent Pattern MiningData MingingFrequent Pattern MiningCATS TreeFP-TreeIncremen tal MiningFinding frequent patterns from databases have been the most time consuming process in association rule mining. Several effective data structures, such as two-dimensional arrays, graphs, trees and tries have been proposed to collect candidate itemsets and frequent itemsets. It seems that the tree structure is most extractive to storing itemsets. The outstanding tree has been proposed so far is called FP-tree which is a prefix tree structure. Some advancement with this tree structure is called CATS tree. CATS Tree extends an idea of FP-Tree to improve storage compression and allow frequent pattern mining without generation of candidate itemsets. It allows the mining with a single pass over the database. In this work, CATSIM Tree is presented for which an attempt has been made to modify present CATS Tree in order to make it efficient for incremental mining.Editora da UFLA2009-09-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/271INFOCOMP Journal of Computer Science; Vol. 8 No. 3 (2009): September, 2009; 57-611982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/271/256Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessPatel, SanjayGarg, Sanjay2015-07-22T18:07:58Zoai:infocomp.dcc.ufla.br:article/271Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:28.795075INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
Basic Framework of CATSIM Tree for Efficient Frequent Pattern Mining |
title |
Basic Framework of CATSIM Tree for Efficient Frequent Pattern Mining |
spellingShingle |
Basic Framework of CATSIM Tree for Efficient Frequent Pattern Mining Patel, Sanjay Data Minging Frequent Pattern Mining CATS Tree FP-Tree Incremen tal Mining |
title_short |
Basic Framework of CATSIM Tree for Efficient Frequent Pattern Mining |
title_full |
Basic Framework of CATSIM Tree for Efficient Frequent Pattern Mining |
title_fullStr |
Basic Framework of CATSIM Tree for Efficient Frequent Pattern Mining |
title_full_unstemmed |
Basic Framework of CATSIM Tree for Efficient Frequent Pattern Mining |
title_sort |
Basic Framework of CATSIM Tree for Efficient Frequent Pattern Mining |
author |
Patel, Sanjay |
author_facet |
Patel, Sanjay Garg, Sanjay |
author_role |
author |
author2 |
Garg, Sanjay |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Patel, Sanjay Garg, Sanjay |
dc.subject.por.fl_str_mv |
Data Minging Frequent Pattern Mining CATS Tree FP-Tree Incremen tal Mining |
topic |
Data Minging Frequent Pattern Mining CATS Tree FP-Tree Incremen tal Mining |
description |
Finding frequent patterns from databases have been the most time consuming process in association rule mining. Several effective data structures, such as two-dimensional arrays, graphs, trees and tries have been proposed to collect candidate itemsets and frequent itemsets. It seems that the tree structure is most extractive to storing itemsets. The outstanding tree has been proposed so far is called FP-tree which is a prefix tree structure. Some advancement with this tree structure is called CATS tree. CATS Tree extends an idea of FP-Tree to improve storage compression and allow frequent pattern mining without generation of candidate itemsets. It allows the mining with a single pass over the database. In this work, CATSIM Tree is presented for which an attempt has been made to modify present CATS Tree in order to make it efficient for incremental mining. |
publishDate |
2009 |
dc.date.none.fl_str_mv |
2009-09-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/271 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/271 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/271/256 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 8 No. 3 (2009): September, 2009; 57-61 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874740897185792 |