245 search results - page 11 / 49 » Tree pattern mining with tree automata constraints |
KDD
1997
ACM
13 years 11 months ago
1997
ACM
An approach to defining actionability as a measure of interestingness of patterns is proposed. This approach is based on the concept of an action hierarchy which is defined as a t...
ADC
2003
Springer
14 years 22 days 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...
AMW
2011
12 years 11 months ago
2011
Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into aut...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
SIGMOD
2008
ACM
13 years 7 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...