PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Closed and maximal tree mining using natural representations
José Balcázar, Albert Bifet and Antoni Lozano
In: 5th International Workshop on Mining and Learning with Graphs (MLG'07), 1-3 August 2007, Firenze, Italy.

Abstract

Mining frequent trees is becoming an important task, with broad applications including chemical informatics, computer vision, text retrieval, bioinformatics, and Web analysis. Many link-based structures may be studied formally by means of unordered trees. Our focus is on induced rooted trees, thus our relevant information is the root and the link structure. The appropriate notion of subtree, so-called top-down subtree, preserves root and links. We present a new algorithm for mining frequent closed and maximal, ordered and unordered, labeled trees.

PDF - PASCAL Members only - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Poster)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:3225
Deposited By:Albert Bifet
Deposited On:21 January 2008