Frequent subtree mining -- an overview
From MaRDI portal
Recommendations
- Mining condensed frequent subtree base
- TreeMiner: An efficient algorithm for mining embedded ordered frequent trees
- An experimental comparison of different inclusion relations in frequent tree mining
- Efficiently mining frequent embedded unordered trees
- Constraint-Based Mining and Inductive Databases
Cited in
(36)- Probabilistic frequent subtrees for efficient graph classification and retrieval
- Mining rooted ordered trees under subtree homeomorphism
- Ordered subtree mining via transactional mapping using a structure-preserving tree database schema
- Learning grammars for architecture-specific facade parsing
- Mining frequent closed rooted trees
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
- Genetic programming for anticancer therapeutic response prediction using the NCI-60 dataset
- Probabilistic and exact frequent subtree mining in graphs beyond forests
- Nearly exact mining of frequent trees in large networks
- Inclusion problems in trace monoids
- Mining sub-trajectory cliques to find frequent routes
- Mining induced/embedded subtrees using the level of embedding constraint
- Frequent submap discovery
- Mop: an efficient algorithm for mining frequent pattern with subtree traversing
- Efficient frequent subtree mining beyond forests
- TreeMiner: An efficient algorithm for mining embedded ordered frequent trees
- Mining condensed frequent subtree base
- Tree inclusion problems
- An experimental comparison of different inclusion relations in frequent tree mining
- Mining Frequent Closed Unordered Trees Through Natural Representations
- Using trees to mine multirelational databases
- Efficient mining for structurally diverse subgraph patterns in large molecular databases
- scientific article; zbMATH DE number 1966525 (Why is no real title available?)
- scientific article; zbMATH DE number 2099992 (Why is no real title available?)
- Efficient algorithms for discovering frequent and maximal substructures from large semistructured data
- Discovering frequent subtrees from XML data using neural networks
- Inductive Logic Programming
- Fuzzy Tree Mining: Go Soft on Your Nodes
- Efficiently mining frequent embedded unordered trees
- Detecting irrelevant subtrees to improve probabilistic learning from tree-structured data
- Constraint-Based Mining and Inductive Databases
- Trie: An alternative data structure for data mining algorithms
- Mining of data with complex structures.
- Detection of common subtrees with identical label distribution
- Tree inclusions in windows and slices
- Efficient frequent connected subgraph mining in graphs of bounded tree-width
This page was built for publication: Frequent subtree mining -- an overview
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5472871)
