Efficient algorithms for discovering frequent and maximal substructures from large semistructured data
From MaRDI portal
Publication:4932736
Recommendations
Cites work
- A decision-theoretic generalization of on-line learning and an application to boosting
- Algorithms and Computation
- An efficient algorithm for enumerating closed patterns in transaction databases
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
- Complete mining of frequent patterns from graphs: Mining graph data
- Inductive Logic Programming
- Optimized substructure discovery for semi-structured data
- Reverse search for enumeration
Cited in
(6)- Discovery of frequent tree structured patterns in semistructured web documents
- Fast mining frequent patterns in semi-structured data stream
- Optimized substructure discovery for semi-structured data
- Efficiently maintaining structural associations of semistructured data
- SEuS: Structure extraction using summaries
- Efficient text mining with optimized pattern discovery
This page was built for publication: Efficient algorithms for discovering frequent and maximal substructures from large semistructured data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4932736)