Buscar

 

RI UFLA (Universidade Federal de Lavras) >
Revistas UFLA >
Infocomp >

Please use this identifier to cite or link to this item: http://repositorio.ufla.br/jspui/handle/1/10253

Title: Basic framework of CATSIM tree for efficient frequent pattern mining
???metadata.dc.creator???: Patel, Sanjay
Garg, Sanjay
Keywords: Data mining
Frequent pattern mining
CATS Tree
FP-Tree
Incremental mining
Mineração de dados
Padrão de mineração frequente
Árvore CATS
Árvore FP
Mineração incremental
Publisher: Editora da UFLA
???metadata.dc.date???: 1-Sep-2009
Citation: PATEL, S.; GARG, S. Basic framework of CATSIM tree for efficient frequent pattern mining. INFOCOMP: Journal of Computer Science, Lavras, v. 8, n. 3, p. 57-61, Sept. 2009.
Abstract: 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.
Other Identifiers: http://www.dcc.ufla.br/infocomp/index.php/INFOCOMP/article/view/271
???metadata.dc.language???: eng
Appears in Collections:Infocomp

Files in This Item:

There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


View Statistics

 


DSpace Software Copyright © 2002-2010  Duraspace - Feedback