15 search results - page 2 / 3 » Mining Maximal Frequently Changing Subtree Patterns from XML... |
ICDM
2006
IEEE
13 years 11 months ago
2006
IEEE
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
WWW
2006
ACM
14 years 5 months ago
2006
ACM
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
DASFAA
2005
IEEE
13 years 10 months ago
2005
IEEE
Recently, several approaches that mine frequent XML query patterns and cache their results have been proposed to improve query response time. However, frequent XML query patterns m...
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...
IFSA
2007
Springer
13 years 11 months ago
2007
Springer
Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...