Recherche de sous-structures arborescentes ordonnées fréquentes au sein de bases de données semi-structurées
Explore this paper's citation graph
Summary
La recherche de structures arborescentes frequentes, egalement appelee fouille d'arbres, au sein de bases de donnees composees de documents semi-structures (e.g. XML) est une problematique actuellement tres active.
- Type
- preprint
- Published
- 2007-07-16
- Cited by
- 1
- References
- 84
- Access
- Open access
- OpenAlex
- https://openalex.org/W56060485
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:41170169
Keywords
Humanities, Philosophy
References
- Efficient discovery of frequent unordered trees
- Mining Functional and Embedded Dependencies using Free Sets
- Mining Frequent Agreement Subtrees in Phylogenetic Databases
- Efficient discovery of functional and approximate dependencies using partitions
- New Algorithms for Fast Discovery of Association Rules
- Efficiently Mining Frequent Embedded Unordered Trees
- Mining Frequent Patterns in Data Streams at Multiple Time Granularities
- Efficient Substructure Discovery from Large Semi-Structured Data
- A fuzzy ontology for medical document retrieval
- Fast Discovery of Association Rules
- Algorithms on Trees and Graphs
- Fuzzy sets, uncertainty and information
- Dryade: a new approach for discovering closed frequent trees in heterogeneous tree databases
- Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
- Defining Homomorphisms and Other Generalized Morphisms of Fuzzy Relations in Monoidal Fuzzy Logics by Means of BK-Products
- Computer Systems That Learn: Classification and Prediction Methods from Statistics, Neural Nets, Machine Learning and Expert Systems
- A quickstart in frequent structure mining can make a difference
- ECO:a methodology for the enumeration of combinatorial objects
- TRIPS and TIDES: new algorithms for tree mining
- More Efficient Algorithm for Ordered Tree Inclusion