19 search results - page 1 / 4 » Mining frequent closed rooted trees |
KDD
2008
ACM
14 years 5 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 3 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 10 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 ...
AUSDM
2007
Springer
13 years 10 months ago
2007
Springer
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...
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...