4 search results - page 1 / 1 » Mining Frequent Closed Unordered Trees Through Natural Repre... |
ICCS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
DEXAW
2007
IEEE
13 years 11 months ago
2007
IEEE
Several classical schemes exist to represent trees as strings over a fixed alphabet; these are useful in many algorithmic and conceptual studies. Our previous work has proposed 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 ...
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...