@inproceedings{03290405b8a741e0aeace1a9a29138aa,
title = "Subtree testing and closed tree mining through natural representations",
abstract = "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.",
author = "Balc{\'a}zar, \{Jos{\'e} L.\} and Albert Bifet and Antoni Lozano",
year = "2007",
month = jan,
day = "1",
doi = "10.1109/DEXA.2007.73",
language = "English",
isbn = "0769529321",
series = "Proceedings - International Workshop on Database and Expert Systems Applications, DEXA",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "499--503",
booktitle = "Proceedings DEXA 2007 18th International Workshop on Database and Expert Systems Applications",
note = "18th International Workshop on Database and Expert Systems Applications, DEXA 2007 ; Conference date: 03-09-2007 Through 07-09-2007",
}