9 search results - page 1 / 2 » Mining adaptively frequent closed unlabeled rooted trees in ... |
KDD
2008
ACM
14 years 4 months ago
2008
ACM
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...
ML
2010
ACM
13 years 2 months ago
2010
ACM
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 ...
PAKDD
2004
ACM
13 years 9 months ago
2004
ACM
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 ...
KDD
2006
ACM
14 years 4 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
TKDE
2008
13 years 4 months ago
2008
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...