Apr 25, 2022 · We propose a practical MFS mining algorithm that targets large MFSs, named SATMargin. SATMargin adopts random walk in the search space to perform efficient ...
Apr 25, 2022 · We propose a practical MFS mining algorithm that targets large MFSs, named SATMargin. SATMargin adopts random walk in the search space to perform efficient ...
Jan 16, 2024 · Specifically, the goal of frequent subgraph mining is identifying frequently appeared subgraphs from a collection of graphs (e.g., [18, 25] ).
Duration: 17:22
Posted: Sep 12, 2022
Posted: Sep 12, 2022
MARGIN is a maximal subgraph mining algorithm that moves among promising nodes of the search space along the “border” of the infrequent and frequent subgraphs.
Jul 23, 2024 · SATMargin: Practical Maximal Frequent Subgraph Mining via Margin Space Sampling. ... frequent subgraphs by metropolis Monte Carlo sampling ...
Muyi Liu, Pan Li, "SATMargin: Practical Maximal Frequent Subgraph Mining via Margin Space Sampling," WWW 2022. Kimon Fountoulakis, Pan Li, Shenghao Yang ...
People also ask
What is maximal frequent subgraph mining?
What is frequent subgraph mining?
ABSTRACT. The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent min-.
Missing: SATMargin: Practical Sampling.
Apr 2, 2024 · SATMargin: Practical Maximal Frequent Subgraph. Mining via Margin Space Sampling. In Proceedings of the ACM Web Conference. 2022. ACM ...
(Frequent Subgraph Mining) "SATMargin: Practical Maximal Frequent Subgraph Mining via Margin Space Sampling", with Muyi. This is a paper that comes from my ...