Effective feature construction by maximum common subgraph sampling

DOI10.1007/S10994-010-5193-8zbMATH Open1237.68162OpenAlexW1974551701WikidataQ57923338 ScholiaQ57923338MaRDI QIDQ413859FDOQ413859

Authors: Leander Schietgat, Fabrizio Costa, Jan Ramon, Luc De Raedt 

Publication date: 8 May 2012

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/270068

Recommendations

• Learning an efficient constructive sampler for graphs
• Feature selection based on graph structure
• A Graph-Based Approach to Feature Selection
• Inductive Logic Programming
• Probabilistic frequent subtrees for efficient graph classification and retrieval

zbMATH Keywords

chemoinformaticsfeature generationstructure-activity learningsubgraph mining

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Biochemistry, molecular biology (92C40) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Statistical comparisons of classifiers over multiple data sets
• Measuring classifier performance: a coherent alternative to the area under the ROC curve
• Title not available (Why is that?)
• Convergence and existence results for best proximity points
• Title not available (Why is that?)
• Algorithms for the Assignment and Transportation Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logical and Relational Learning
• A graph distance metric based on the maximal common subgraph
• Information Theoretical Analysis of Multivariate Correlation
• Kernels for Structured Data
• 10.1162/153244303321897681
• ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns

Cited In (6)

• Efficient mining for structurally diverse subgraph patterns in large molecular databases
• Mining closed patterns in relational, graph and network data
• Finding the best not the most: regularized loss minimization subgraph selection for graph classification
• Probabilistic frequent subtrees for efficient graph classification and retrieval
• On maximum common subgraph problems in series-parallel graphs
• A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics

Uses Software

• AFGen
• gSpan

This page was built for publication: Effective feature construction by maximum common subgraph sampling

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