Sciweavers

Share
9 search results - page 1 / 2
» Mining adaptively frequent closed unlabeled rooted trees in ...
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
10 years 9 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
ML
2010
ACM
210views Machine Learning» more  ML 2010»
9 years 7 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
10 years 2 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
10 years 9 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
TKDE
2008
153views more  TKDE 2008»
9 years 9 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
books