# cgSpan: Pattern Mining in Conceptual Graphs

arXiv: https://arxiv.org/abs/2110.15058 · HTML: https://mlsanity.com/paper/2110.15058/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 0 of its 10 references that are in the map.
- First posted on arXiv 26 Oct 2021.

## Built on by (most cited first, 1 of 1)

- [Mining Frequent Structures in Conceptual Models](https://mlsanity.com/paper/2406.07129/) (2024)

## Abstract (arXiv)

Conceptual Graphs (CGs) are a graph-based knowledge representation formalism. In this paper we propose cgSpan a CG frequent pattern mining algorithm. It extends the DMGM-GSM algorithm that takes taxonomy-based labeled graphs as input; it includes three more kinds of knowledge of the CG formalism: (a) the fixed arity of relation nodes, handling graphs of neighborhoods centered on relations rather than graphs of nodes, (b) the signatures, avoiding patterns with concept types more general than the maximal types specified in signatures and (c) the inference rules, applying them during the pattern mining process. The experimental study highlights that cgSpan is a functional CG Frequent Pattern Mining algorithm and that including CGs specificities results in a faster algorithm with more expressive results and less redundancy with vocabulary.