Optimized substructure discovery for semi-structured data
From MaRDI portal
Recommendations
- Efficient algorithms for discovering frequent and maximal substructures from large semistructured data
- Discovery of frequent tree structured patterns in semistructured web documents
- Discovery of frequent tag tree patterns in semistructured web documents
- Schema discovery of the semi-structured and hierarchical data
- SEuS: Structure extraction using summaries
Cited in
(16)- Mining rooted ordered trees under subtree homeomorphism
- Ordered subtree mining via transactional mapping using a structure-preserving tree database schema
- Fast support vector machines for convolution tree kernels
- Learning block-preserving graph patterns and its application to data mining
- Mining frequent closed rooted trees
- XRules: an effective algorithm for structural classification of XML data
- Computational aspects of mining maximal frequent patterns
- Pattern Mining for Historical Data Analysis by Using MOEA
- Improving constrained pattern mining with first-fail-based heuristics
- Using trees to mine multirelational databases
- Efficiently mining \(\delta \)-tolerance closed frequent subgraphs
- Schema discovery of the semi-structured and hierarchical data
- Efficient algorithms for discovering frequent and maximal substructures from large semistructured data
- An efficient algorithm for solving pseudo clique enumeration problem
- Bottom-up mining of XML query patterns to improve XML querying
- Mining frequent closed itemsets from a landmark window over online data streams
This page was built for publication: Optimized substructure discovery for semi-structured data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4405997)