Sciweavers

2 search results - page 1 / 1
» Subtree Testing and Closed Tree Mining Through Natural Repre...
Sort
View
DEXAW
2007
IEEE
92views Database» more  DEXAW 2007»
14 years 1 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...
José L. Balcázar, Albert Bifet, Anto...
ICCS
2007
Springer
14 years 1 months ago
Mining Frequent Closed Unordered Trees Through Natural Representations
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
José L. Balcázar, Albert Bifet, Anto...