RSF - A New Tree Mining Approach with an Efficient Data Structure - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2005

RSF - A New Tree Mining Approach with an Efficient Data Structure

Abstract

Mining frequent subtrees from tree databases is currently a very active research topic. This research has many interests, including for instance mediator schema building from XML schemas. In this framework, many works have been proposed. However, the way the data are represented is often very memory-consuming. In this paper, we propose a new method to represent such data. We show that this representation has many properties , which can be used in order to enhance sub-tree mining algorithms. Experiments are led to assess our proposition (data representation and its associated algorithms).
Fichier principal
Vignette du fichier
RSF_-_A_New_Tree_Mining_Approach_with_an_Efficient.pdf (307.82 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

lirmm-00106090 , version 1 (21-09-2019)

Identifiers

  • HAL Id : lirmm-00106090 , version 1

Cite

Federico del Razo Lopez, Anne Laurent, Pascal Poncelet, Maguelonne Teisseire. RSF - A New Tree Mining Approach with an Efficient Data Structure. EUSFLAT-LFA, European Society for Fuzzy Logic and Technology, Sep 2005, Barcelona, Spain. pp.1088-1093. ⟨lirmm-00106090⟩
101 View
25 Download

Share

Gmail Facebook X LinkedIn More