An uncertain graph classification algorithm based on discriminative subgraphs

MaRDI QIDQ5260745zbMATH OpenFDO

Authors Yi Liu, Yong Wang, Xuequn Shang

Publication date 29 June 2015

zbMATH Keywords

frequent subgraphdiscriminative subgraphuncertain graph classification algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Fractional graph theory, fuzzy graph theory (05C72)

Recommendations

• A fast algorithm for mining frequent subgraphs
• Probabilistic and exact frequent subtree mining in graphs beyond forests
• Mining discriminative subgraph patterns from structural data
• Probabilistic frequent subtrees for efficient graph classification and retrieval
• A general framework for mining frequent subgraphs from labeled graphs

Cited in

(2)

• Finding the best not the most: regularized loss minimization subgraph selection for graph classification
• Mining discriminative subgraph patterns from structural data

This page was built for publication: An uncertain graph classification algorithm based on discriminative subgraphs

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