Efficient mining for structurally diverse subgraph patterns in large molecular databases

DOI10.1007/S10994-010-5187-6MaRDI QIDQ413872zbMATHOpenAlexFDO

Authors Andreas Maunz, Christoph Helma, Stefan Kramer

Publication date 8 May 2012

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-010-5187-6

zbMATH Keywords

backbonecorrelated graph miningdynamic upper bound pruningstructural diversity

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Database theory (68P15)

Recommendations

• Probabilistic frequent subtrees for efficient graph classification and retrieval
• Probabilistic and exact frequent subtree mining in graphs beyond forests
• Effective feature construction by maximum common subgraph sampling
• Learning block-preserving graph patterns and its application to data mining
• Mining discriminative subgraph patterns from structural data

Cites work

• Frequent subtree mining -- an overview
• On subtrees of trees

Cited in

(7)

• Finding characteristic substructures for metabolite classes
• Probabilistic frequent subtrees for efficient graph classification and retrieval
• Learning molecular classes from small numbers of positive examples using graph grammars
• Mining discriminative subgraph patterns from structural data
• A randomized exhaustive propositionalization approach for molecule classification
• gBoost: a mathematical programming approach to graph classification and regression
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Describes a project that uses

Uses Software

• gSpan
• CloseGraph

This page was built for publication: Efficient mining for structurally diverse subgraph patterns in large molecular databases

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