cgSpan: Closed Graph-Based Substructure Pattern Mining

12/17/2021
by   Zevin Shaul, et al.
0

gSpan is a popular algorithm for mining frequent subgraphs. cgSpan (closed graph-based substructure pattern mining) is a gSpan extension that only mines closed subgraphs. A subgraph g is closed in the graphs database if there is no proper frequent supergraph of g that has equivalent occurrence with g. cgSpan adds the Early Termination pruning method to the gSpan pruning methods, while leaving the original gSpan steps unchanged. cgSpan also detects and handles cases in which Early Termination should not be applied. To the best of our knowledge, cgSpan is the first publicly available implementation for closed graphs mining

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/26/2021

cgSpan: Pattern Mining in Conceptual Graphs

Conceptual Graphs (CGs) are a graph-based knowledge representation forma...
research
08/13/2017

Visual Graph Mining

In this study, we formulate the concept of "mining maximal-size frequent...
research
04/06/2020

Peregrine: A Pattern-Aware Graph Mining System

Graph mining workloads aim to extract structural properties of a graph b...
research
12/26/2020

Discovering Closed and Maximal Embedded Patterns from Large Tree Data

We address the problem of summarizing embedded tree patterns extracted f...
research
01/23/2019

Boosting Frequent Itemset Mining via Early Stopping Intersections

Mining frequent itemsets from a transaction database has emerged as a fu...
research
06/23/2023

Efficient Model Selection for Predictive Pattern Mining Model by Safe Pattern Pruning

Predictive pattern mining is an approach used to construct prediction mo...
research
03/21/2021

BigCarl: Mining frequent subnets from a single large Petri net

While there have been lots of work studying frequent subgraph mining, ve...

Please sign up or login with your details

Forgot password? Click here to reset