Sciweavers

Share
DEXAW
2007
IEEE

Subtree Testing and Closed Tree Mining Through Natural Representations

10 years 3 months ago
Subtree Testing and Closed Tree Mining Through Natural Representations
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 representation of unranked trees as strings over a countable alphabet, and has shown how this representation is useful for canonizing unordered trees and for mining closed frequent trees, whether ordered or unordered. Here we propose a similar, simpler alternative and adapt some basic algorithmics to it; then we show empirical evidence of the usefulness of this representation for mining frequent closed unordered trees on real-life data.
José L. Balcázar, Albert Bifet, Anto
Added 02 Jun 2010
Updated 02 Jun 2010
Type Conference
Year 2007
Where DEXAW
Authors José L. Balcázar, Albert Bifet, Antoni Lozano
Comments (0)
books