Nearly Exact Mining of Frequent Trees in Large Networks
The miner, for a fixed parameter k (maximal pattern size), can mine all rooted trees with delay linear in the size of the network and only mildly exponential in the fixed parameter k (2 k). This allows us to mine tractably, rooted trees, in large networks such as the WWW or social networks.