@inproceedings{cb701289f9b3442a956241555ebc00d6,
title = "Mining frequent closed unordered trees through natural representations",
abstract = "Many knowledge representation mechanisms consist of link-based structures; they may be studied formally by means of unordered trees. Here we consider the case where labels on the nodes are nonexistent or unreliable, and propose data mining processes focusing on just the link structure. We propose a representation of ordered trees, describe a combinatorial characterization and some properties, and use them to propose an efficient algorithm for mining frequent closed subtrees from a set of input trees. Then we focus on unordered trees, and show that intrinsic characterizations of our representation provide for a way of avoiding the repeated exploration of unordered trees, and then we give an efficient algorithm for mining frequent closed unordered trees.",
author = "Balc{\'a}zar, \{Jos{\'e} L.\} and Albert Bifet and Antoni Lozano",
year = "2007",
month = jan,
day = "1",
doi = "10.1007/978-3-540-73681-3\_26",
language = "English",
isbn = "9783540736806",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "347--359",
booktitle = "Conceptual Structures",
note = "15th International Conference on Conceptual Structures, ICCS 2007 ; Conference date: 22-07-2007 Through 27-07-2007",
}