Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-73681-3_26 | ICCS |
Keywords | Field | DocType |
data mining,frequent closed unordered tree,link structure,knowledge representation mechanism,input tree,frequent closed subtrees,unordered tree,combinatorial characterization,intrinsic characterization,efficient algorithm,natural representations,frequent closed unordered trees,knowledge representation | Data mining,Knowledge representation and reasoning,Mathematical optimization,Computer science,Theoretical computer science,Formal concept analysis | Conference |
Volume | ISSN | Citations |
4604 | 0302-9743 | 10 |
PageRank | References | Authors |
0.60 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| José L. Balcázar | 1 | 701 | 62.06 |
| Albert Bifet | 2 | 2659 | 140.83 |
| Antoni Lozano | 3 | 135 | 11.96 |