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).
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00106090
Contributor : Christine Carvalho de Matos <>
Submitted on : Saturday, September 21, 2019 - 4:55:10 PM
Last modification on : Saturday, September 21, 2019 - 4:57:28 PM

File

RSF_-_A_New_Tree_Mining_Approa...
Publisher files allowed on an open archive

Identifiers

  • HAL Id : lirmm-00106090, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

157

Files downloads

6