KG-MDL: Mining Graph Patterns in Knowledge Graphs with the MDL Principle
Francesco Bariatti, Peggy Cellier, S\'ebastien Ferr\'e

TL;DR
KG-MDL introduces a novel MDL-based method for mining human-interpretable, descriptive graph patterns in knowledge graphs, addressing pattern explosion and structural complexities unique to KGs.
Contribution
The paper presents KG-MDL, an MDL-based graph pattern mining approach tailored for knowledge graphs, producing small, descriptive, and interpretable pattern sets without parameter tuning.
Findings
Produces human-sized, interpretable pattern sets
Highlights schema and factual characteristics of KGs
Effective on medium-sized knowledge graphs
Abstract
Nowadays, increasingly more data are available as knowledge graphs (KGs). While this data model supports advanced reasoning and querying, they remain difficult to mine due to their size and complexity. Graph mining approaches can be used to extract patterns from KGs. However this presents two main issues. First, graph mining approaches tend to extract too many patterns for a human analyst to interpret (pattern explosion). Second, real-life KGs tend to differ from the graphs usually treated in graph mining: they are multigraphs, their vertex degrees tend to follow a power-law, and the way in which they model knowledge can produce spurious patterns. Recently, a graph mining approach named GraphMDL+ has been proposed to tackle the problem of pattern explosion, using the Minimum Description Length (MDL) principle. However, GraphMDL+, like other graph mining approaches, is not suited for KGs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications · Graph Theory and Algorithms · Semantic Web and Ontologies
MethodsMinimum Description Length
