Discriminative frequent subgraph mining with optimality guarantees

DOI10.1002/SAM.10084MaRDI QIDQ4969732zbMATH OpenOpenAlexWikidataFDO

Authors Marisa Thoma, Hong Cheng, Arthur Gretton, Jiawei Han, Le Song, Philip S. Yu, Xifeng Yan, Karsten M. Borgwardt, Hans-Peter Kriegel, Alex J. Smola

Publication date 14 October 2020

Published in Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/sam.10084

zbMATH Keywords

feature selectionfrequent subgraphsgraph miningnested selectionsubmodularity

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites work

• An analysis of approximations for maximizing submodular set functions—I
• Finding essential attributes from binary data
• gBoost: a mathematical programming approach to graph classification and regression
• Machine Learning: ECML 2004
• Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies

Cited in

(3)

• Distance metric learning for graph structured data
• Full Perfect Extension Pruning for Frequent Subgraph Mining
• Effective graph classification based on topological and label attributes

Describes a project that uses

Uses Software

• LIBSVM
• AFGen
• gSpan
• MoSS
• gBoost

This page was built for publication: Discriminative frequent subgraph mining with optimality guarantees

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