论文信息 - Intersection Algorithms and a Closure Operator on Unordered Trees

Intersection Algorithms and a Closure Operator on Unordered Trees

Link-based data may be studied formally by means of unordered trees. On a dataset formed by such link-based data, a natural notion of support-based closure can be immediately defined. Abstracting information from subsets of such data requires, first, a formal notion of intersection; second, deeper understanding of the notion of closure; and, third, efficient algorithms for computing intersections on unordered trees. We provide answers to these three questions.

José L. Balcázar | Albert Bifet | Antoni Lozano

[1] Yun Chi,et al. Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees , 2005, IEEE Trans. Knowl. Data Eng..

[2] Hiroki Arimura,et al. An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees , 2005, ILP.

[3] Gabriel Valiente,et al. Algorithms on Trees and Graphs , 2002, Springer Berlin Heidelberg.

[4] John W. Rosenthal,et al. How to obtain an asymptotic expansion of a sequence from an analytic identity satisfied by its generating function , 1994 .

[5] Gemma C. Garriga,et al. Horn axiomatizations for sequential data , 2007, Theor. Comput. Sci..

[6] L. Beran,et al. [Formal concept analysis]. , 1996, Casopis lekaru ceskych.

[7] Alexandre Termier,et al. Dryade: a new approach for discovering closed frequent trees in heterogeneous tree databases , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).

[8] Yun Chi,et al. Frequent Subtree Mining - An Overview , 2004, Fundam. Informaticae.

[9] Gemma C. Garriga,et al. On Horn Axiomatizations for Sequential Data , 2005, ICDT.

[10] Mohammed J. Zaki. Efficiently mining frequent trees in a forest , 2002, KDD.

[11] Gemma C. Garriga,et al. Coproduct Transformations on Lattices of Closed Partial Orders , 2004, ICGT.

[12] José L. Balcázar,et al. Discrete Deterministic Data Mining as Knowledge Compilation , 2003 .