OWGraMi: Efficient method for mining weighted subgraphs in a single graph

作者：

Highlights：

• Develop a theorem for early pruning candidates to improve the performance.

• Reuse the weight of a parent subgraph when computing the weight for its children.

• Propose OWGraMi for fast mining frequent weighted subgraphs.

摘要

•Develop a theorem for early pruning candidates to improve the performance.•Reuse the weight of a parent subgraph when computing the weight for its children.•Propose OWGraMi for fast mining frequent weighted subgraphs.

论文关键词：Weighted subgraph,Early pruning methods,Weight of subgraph,Subgraph mining

论文评审过程：Received 7 September 2020, Revised 17 December 2021, Accepted 17 May 2022, Available online 23 May 2022, Version of Record 28 May 2022.

论文官网地址：https://doi.org/10.1016/j.eswa.2022.117625