TY - GEN
T1 - Subtree testing and closed tree mining through natural representations
AU - Balcázar, José L.
AU - Bifet, Albert
AU - Lozano, Antoni
PY - 2007/1/1
Y1 - 2007/1/1
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/47849126620
U2 - 10.1109/DEXA.2007.73
DO - 10.1109/DEXA.2007.73
M3 - Conference contribution
AN - SCOPUS:47849126620
SN - 0769529321
SN - 9780769529325
T3 - Proceedings - International Workshop on Database and Expert Systems Applications, DEXA
SP - 499
EP - 503
BT - Proceedings DEXA 2007 18th International Workshop on Database and Expert Systems Applications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 18th International Workshop on Database and Expert Systems Applications, DEXA 2007
Y2 - 3 September 2007 through 7 September 2007
ER -