Analysis of Co-Occurrence Patterns in Data through Modular and Clan Decompositions of Gaifman Graphs

10/11/2019
by   Marie Ely Piceno, et al.
0

Our team has recently demonstrated that clan decompositions of generalized Gaifman graphs provide advantageous hierarchical visualizations of co-occurrence patterns in data. We develop that early intuition by introducing a construction of implication sets, named "clan implications", and then, explaining these clan decompositions as a variant of closure spaces associated to these implications. Further, we discuss some algorithmic issues that support reasonably efficiently our exploratory data analysis software implementing this approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/14/2018

Decomposition of quantitative Gaifman graphs as a data analysis tool

We argue the usefulness of Gaifman graphs of first-order relational stru...
research
06/29/2022

Generalized Pseudoskeleton Decompositions

We characterize some variations of pseudoskeleton (also called CUR) deco...
research
04/28/2020

As Time Goes By: Reflections on Treewidth for Temporal Graphs

Treewidth is arguably the most important structural graph parameter lead...
research
06/08/2021

On the nonexistence of FO-continuous path and tree-decompositions

Bojanczyk and Pilipczuk showed in their celebrated article "Definability...
research
05/23/2022

Entanglements

Robertson and Seymour constructed for every graph G a tree-decomposition...
research
05/04/2020

Hierarchical Knowledge Graphs: A Novel Information Representation for Exploratory Search Tasks

In exploratory search tasks, alongside information retrieval, informatio...
research
03/16/2017

Shift Aggregate Extract Networks

We introduce an architecture based on deep hierarchical decompositions t...

Please sign up or login with your details

Forgot password? Click here to reset