Hypergraph modeling and visualisation of complex co-occurence networks

DOI10.1016/J.ENDM.2018.11.011MaRDI QIDQ1739933zbMATH OpenOpenAlexWikidataFDO

Authors X. Ouvrard, Jean-Marie Le Goff, Stéphane Marchand-Maillet

Publication date 29 April 2019

Full work available at URL https://arxiv.org/abs/1809.00164

zbMATH Keywords

data miningdata visualisationhypergraph modeling

Mathematics Subject Classification ID

Hypergraphs (05C65)

Abstract: Finding inherent or processed links within a dataset allows to discover potential knowledge. The main contribution of this article is to define a global framework that enables optimal knowledge discovery by visually rendering co-occurences (i.e. groups of linked data instances attached to a metadata reference) - either inherently present or processed - from a dataset as facets. Hypergraphs are well suited for modeling co-occurences since they support multi-adicity whereas graphs only support pairwise relationships. This article introduces an efficient navigation between different facets of an information space based on hypergraph modelisation and visualisation.

Recommendations

• Hypergraph computation
• Frequent Hypergraph Mining
• scientific article; zbMATH DE number 2080096
• Modelling systems by hypergraphs
• scientific article; zbMATH DE number 2089451

Cites work

• Degrees of acyclicity for hypergraphs and relational database schemes
• Hypergraph theory. An introduction
• Relations on hypergraphs

Cited in

(5)

• Network Inference From Co-Occurrences
• Testing community structure for hypergraphs
• Graphical models for complex networks: an application to Italian museums
• Nonreconstruction of high-dimensional stochastic block model with bounded degree
• Graph annotations in modeling complex network topologies

This page was built for publication: Hypergraph modeling and visualisation of complex co-occurence networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1739933)