TreeMiner: An efficient algorithm for mining embedded ordered frequent trees
From MaRDI portal
Recommendations
Cited in
(17)- TreeMiner
- Mining rooted ordered trees under subtree homeomorphism
- Ordered subtree mining via transactional mapping using a structure-preserving tree database schema
- Upper bound on the size of FP-tree
- Mining induced/embedded subtrees using the level of embedding constraint
- Mining algorithm of frequent episodes in an event sequence based on generalized suffix trees
- An experimental comparison of different inclusion relations in frequent tree mining
- scientific article; zbMATH DE number 1950784 (Why is no real title available?)
- scientific article; zbMATH DE number 1977836 (Why is no real title available?)
- A distributed approach for transactional embedded tree pattern mining
- Discovering frequent subtrees from XML data using neural networks
- Algorithm for enumerating all maximal frequent tree patterns among words in tree-structured documents and its application
- Efficiently mining frequent embedded unordered trees
- Frequent subtree mining -- an overview
- Constraint-Based Mining and Inductive Databases
- Mining of data with complex structures.
- Detection of common subtrees with identical label distribution
This page was built for publication: TreeMiner: An efficient algorithm for mining embedded ordered frequent trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3369767)
