Name
Abstract | ||
|---|---|---|
We propose a way of extracting high-confidence association rules fromdatasetsconsistingofunlabeledtrees. Theantecedentsareobtainedthrough a computation akin to a hypergraph transversal, whereas the consequents follow from an application of the closure operators on unlabeled trees developed in pre- vious recent works of the authors. We discuss in more detail the case of rules that always hold, independently of the dataset, since these are more complex than in itemsets due to the fact that we are no longer working on a lattice. |
Year | Venue | Keywords |
|---|---|---|
2008 | EGC | closure operator,association rule |
Field | DocType | Citations |
Discrete mathematics,Lattice (order),Hypergraph,Transversal (geometry),Association rule learning,Operator (computer programming),Mathematics,Computation | Conference | 5 |
PageRank | References | Authors |
0.48 | 10 | 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 |