Summarizing and understanding large graphs

DOI10.1002/SAM.11267MaRDI QIDQ4970005zbMATH OpenOpenAlexWikidataFDO

Authors Danai Koutra, U. Kang, Jilles Vreeken, Christos Faloutsos

Publication date 14 October 2020

Published in Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

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

zbMATH Keywords

graph summarizationgraph visualizationminimum description length

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites work

• A universal prior for integers and estimation by minimum description length
• An algorithm for drawing general undirected graphs
• Clustering by Compression
• Comparing apples and oranges: measuring differences between exploratory data mining results
• Elements of Information Theory
• Enriching taxonomies of place types using Flickr
• Graph compression by BFS
• scientific article; zbMATH DE number 107774 (Why is no real title available?)
• scientific article; zbMATH DE number 2043944 (Why is no real title available?)
• Krimp: mining itemsets that compress
• Modeling by shortest data description
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Structure in the Enron email dataset

Cited in

(5)

• The minimum description length principle for pattern mining: a survey
• Large-scale network motif analysis using compression
• Online summarization of dynamic graphs using subjective interestingness for sequential data
• Minimum description length revisited
• Set-based approximate approach for lossless graph summarization

Describes a project that uses

Uses Software

• PEGASUS
• MDL4BMF
• Krimp
• WebGraph
• MapReduce
• gSpan
• OddBall

This page was built for publication: Summarizing and understanding large graphs

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