Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Graph Summarization

Abstract : The continuous and rapid growth of highly interconnected datasets, which are both voluminous and complex, calls for the development of adequate processing and analytical techniques. One method for condensing and simplifying such datasets is graph summarization. It denotes a series of application-specific algorithms designed to transform graphs into more compact representations while preserving structural patterns, query answers, or specific property distributions. As this problem is common to several areas studying graph topologies, different approaches, such as clustering, compression, sampling, or influence detection, have been proposed, primarily based on statistical and optimization methods. The focus of our chapter is to pinpoint the main graph summarization methods, but especially to focus on the most recent approaches and novel research trends on this topic, not yet covered by previous surveys.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.inria.fr/hal-03128573
Contributor : Tyrex Equipe Connect in order to contact the contributor
Submitted on : Tuesday, February 2, 2021 - 12:11:24 PM
Last modification on : Wednesday, November 3, 2021 - 6:45:49 AM

Links full text

Identifiers

  • HAL Id : hal-03128573, version 1
  • ARXIV : 2004.14794

Citation

Angela Bonifati, Stefania Dumbrava, Haridimos Kondylakis. Graph Summarization. 2020. ⟨hal-03128573⟩

Share

Metrics

Les métriques sont temporairement indisponibles