Year: 2021
Type: conference-paper
Abstract: 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.
Authors: Zevin Shaul, Sheikh Naaz
Institutions: Informatica (South Korea), University of Wisconsin–Madison
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Keywords: frequent subgraph mining, gSpan, graph mining
Open Access status: green
OpenAlex ID: W4206547615
