Efficient mining for structurally diverse subgraph patterns in large molecular databases
From MaRDI portal
Publication:413872
DOI10.1007/S10994-010-5187-6zbMATH Open1237.68158OpenAlexW2019139558MaRDI QIDQ413872FDOQ413872
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
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
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Database theory (68P15)
Cites Work
Cited In (7)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Finding characteristic substructures for metabolite classes
- Probabilistic frequent subtrees for efficient graph classification and retrieval
- A randomized exhaustive propositionalization approach for molecule classification
- Learning molecular classes from small numbers of positive examples using graph grammars
- Mining discriminative subgraph patterns from structural data
- gBoost: a mathematical programming approach to graph classification and regression
Uses Software
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)
