Mining induced/embedded subtrees using the level of embedding constraint

MaRDI QIDQ2909629zbMATH OpenFDO

Authors Henry Tan, Fedja Hadzic, Tharam S. Dillon

Publication date 6 September 2012

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL http://iospress.metapress.com/content/k104121563t4t478/fulltext.html

zbMATH Keywords

algorithmsexperimentationFREQTperformanceTMGtree miningtree model guidedtreeminer

Mathematics Subject Classification ID

Data structures (68P05) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Mining rooted ordered trees under subtree homeomorphism
• Efficiently mining frequent embedded unordered trees
• Frequent subtree mining -- an overview
• Ordered subtree mining via transactional mapping using a structure-preserving tree database schema
• TreeMiner: An efficient algorithm for mining embedded ordered frequent trees

Cited in

(5)

• Mining rooted ordered trees under subtree homeomorphism
• Ordered subtree mining via transactional mapping using a structure-preserving tree database schema
• A distributed approach for transactional embedded tree pattern mining
• Efficiently mining frequent embedded unordered trees
• Mining of data with complex structures.

This page was built for publication: Mining induced/embedded subtrees using the level of embedding constraint

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