Full Perfect Extension Pruning for Frequent Subgraph Mining

DOI10.1007/978-3-540-88067-7_11MaRDI QIDQ3627910zbMATH OpenOpenAlexFDO

Authors Christian Borgelt, Thorsten Meinl

Publication date 13 May 2009

Published in Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88067-7_11

zbMATH Keywords

frequent subgraphsmining graph databases

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Database theory (68P15)

Recommendations

• An efficient approach for mining frequent subgraphs
• Probabilistic and exact frequent subtree mining in graphs beyond forests
• Efficient frequent connected subgraph mining in graphs of bounded tree-width
• Discriminative frequent subgraph mining with optimality guarantees
• A fast algorithm for mining frequent subgraphs
• Mining frequent subgraphs in multigraphs
• Probabilistic frequent subtrees for efficient graph classification and retrieval

Cited in

(2)

• Mining for unconnected frequent graphs with direct subgraph isomorphism tests
• Efficiently mining \(\delta \)-tolerance closed frequent subgraphs

This page was built for publication: Full Perfect Extension Pruning for Frequent Subgraph Mining

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