9 search results - page 2 / 2 » Mining adaptively frequent closed unlabeled rooted trees in ... |
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...
CIKM
2006
Springer
13 years 8 months ago
2006
Springer
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
CN
2006
13 years 5 months ago
2006
The expanding and dynamic nature of the Web poses enormous challenges to most data mining techniques that try to extract patterns from Web data, such as Web usage and Web content....
CIKM
2009
Springer
13 years 9 months ago
2009
Springer
Mining generator patterns has raised great research interest in recent years. The main purpose of mining itemset generators is that they can form equivalence classes together with...