PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Intersection Algorithms and a Closure Operator on Unordered Trees
José Balcázar, Albert Bifet and Antoni Lozano
In: Mining and Learning with Graphs (MLG 2006), 18 September 2006, Berliin, Germany.


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.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:2510
Deposited By:Albert Bifet
Deposited On:23 December 2006