mlsanityData to 7 Oct 2026

cgSpan: Closed Graph-Based Substructure Pattern Mining

arXiv 2112.09573 ↗First posted 17 Dec 2021cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

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

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 0 of its 14 references that are in the map. First posted on arXiv 17 Dec 2021.

Builds on

0 of 14 references.

No references here yet.

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 2; 2024: 1; 2025: 1.

5 papers.