Sciweavers

5 search results - page 1 / 1
» PrefixTreeESpan: A Pattern Growth Algorithm for Mining Embed...
Sort
View
WISE
2006
Springer
13 years 11 months ago
PrefixTreeESpan: A Pattern Growth Algorithm for Mining Embedded Subtrees
Frequent embedded subtree pattern mining is an important data mining problem with broad applications. In this paper, we propose a novel embedded subtree mining algorithm, called Pr...
Lei Zou, Yansheng Lu, Huaming Zhang, Rong Hu
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
13 years 11 months ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li
CIKM
2006
Springer
13 years 9 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
14 years 6 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
PPOPP
2005
ACM
13 years 11 months ago
A sampling-based framework for parallel data mining
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
Shengnan Cong, Jiawei Han, Jay Hoeflinger, David A...