A general framework for mining frequent subgraphs from labeled graphs

MaRDI QIDQ5472872zbMATH OpenFDO

Authors Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda

Publication date 19 June 2006

zbMATH Keywords

isomorphism

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• An efficient approach for mining frequent subgraphs
• A fast algorithm for mining frequent subgraphs
• The Complexity of Mining Maximal Frequent Subgraphs
• Complete mining of frequent patterns from graphs: Mining graph data
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs

Cited in

(7)

• Performance evaluation of frequent subgraph discovery techniques
• A distributed approach for graph mining in massive networks
• Mining frequent subgraphs in multigraphs
• Speeding-up structured probabilistic inference using pattern mining
• An efficient approach for mining frequent subgraphs
• A fast algorithm for mining frequent subgraphs
• An uncertain graph classification algorithm based on discriminative subgraphs

Describes a project that uses

Uses Software

• gSpan

This page was built for publication: A general framework for mining frequent subgraphs from labeled graphs

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