Efficiently mining frequent embedded unordered trees

MaRDI QIDQ5472866zbMATH OpenFDO

Authors Mohammed J. Zaki

Publication date 19 June 2006

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• TreeMiner: An efficient algorithm for mining embedded ordered frequent trees
• Frequent subtree mining -- an overview
• Mining rooted ordered trees under subtree homeomorphism
• Mining induced/embedded subtrees using the level of embedding constraint
• Mining Frequent Closed Unordered Trees Through Natural Representations

Cited in

(14)

• Mining rooted ordered trees under subtree homeomorphism
• Ordered subtree mining via transactional mapping using a structure-preserving tree database schema
• Mining frequent closed rooted trees
• Mining induced/embedded subtrees using the level of embedding constraint
• Efficient frequent subtree mining beyond forests
• TreeMiner: An efficient algorithm for mining embedded ordered frequent trees
• Mining condensed frequent subtree base
• 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
• A distributed approach for transactional embedded tree pattern mining
• Discovering frequent subtrees from XML data using neural networks
• Frequent subtree mining -- an overview
• Bottom-up mining of XML query patterns to improve XML querying

Describes a project that uses

Uses Software

• TreeMiner
• SLEUTH
• gSpan

This page was built for publication: Efficiently mining frequent embedded unordered trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5472866)