Algorithm for mining approximate frequent subgraphs in a single graph

DOI10.3969/J.ISSN.1000-5641.2019.06.008MaRDI QIDQ3306482zbMATH OpenOpenAlexFDO

Authors Jiankai Dou, Xin Lin, Wenxin Hu

Publication date 12 August 2020

Full work available at URL http://xblk.ecnu.edu.cn/EN/Y2019/V2019/I6/73

zbMATH Keywords

pruningfrequent-subgraph miningsingle graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Database theory (68P15)

Recommendations

• An efficient approach for mining frequent subgraphs
• A fast algorithm for mining frequent subgraphs
• Mining frequent subgraphs in multigraphs
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
• Frequent mining of subgraph structures

Cited in

(3)

• Algorithms for subgraph isomorphism in graph pattern mining
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• The Complexity of Mining Maximal Frequent Subgraphs

This page was built for publication: Algorithm for mining approximate frequent subgraphs in a single graph

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