39 search results - page 2 / 8 » Efficiently mining frequent trees in a forest |
ADC
2003
Springer
13 years 10 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
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...
AUSDM
2007
Springer
13 years 11 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...
GFKL
2007
Springer
13 years 9 months ago
2007
Springer
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
KDD
2008
ACM
14 years 5 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...