cgSpan: Pattern Mining in Conceptual Graphs release_ddgdc7phlfgytfhwa77egwxaam

by Adam Faci

Released as a paper-conference .

2021  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  551.5 kB
file_yixv364lyje7hfbhcwmnp2b7fa
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  paper-conference
Stage   submitted
Date   2021-10-26
Version   v1
Language   en ?
arXiv  2110.15058v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 062d247a-1eb6-45ab-8ae1-8d22fae7eea5
API URL: JSON