Fetching the paper…
Reading the bibliography…
Can we use machine learning to compress graph data? The absence of ordering in graphs poses a significant challenge to conventional compression algorithms, limiting their attainable gains as well as their ability to discover relevant patterns.
A mathematical theory of communication
Claude E Shannon · 1948
Earlier work this paper cites.
A method for the construction of minimum-redundancy codes
David A Huffman · 1952
Earlier work this paper cites.
Grammar variational autoencoder
Matt J. Kusner, Brooks Paige, and José Miguel Hernández-Lobato · 1954
Earlier work this paper cites.
A note on the information content of graphs
Ernesto Trucco · 1956
Earlier work this paper cites.
On the information content of graphs: compound symbols; different states for each point
Ernesto Trucco · 1956
Earlier work this paper cites.
Asymmetric graphs
Paul Erdős and Alfréd Rényi · 1963
Earlier work this paper cites.
The reduction of a graph to canonical form and the algebra which appears therein
Boris Weisfeiler and Andrei Leman · 1968
Earlier work this paper cites.
Coding of an information source having ambiguous alphabet and the entropy of graphs
János Körner · 1973
Earlier work this paper cites.
A universal algorithm for sequential data compression
Jacob Ziv and Abraham Lempel · 1977
Earlier work this paper cites.
Compression of individual sequences via variable-rate coding
Jacob Ziv and Abraham Lempel · 1978
Earlier work this paper cites.
Modeling by shortest data description
Jorma Rissanen · 1978
Earlier work this paper cites.
Stochastic blockmodels: First steps
Paul W Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt · 1983
Earlier work this paper cites.
A technique for high-performance data compression
Terry A Welch · 1984
Earlier work this paper cites.
On the succinct representation of graphs
György Turán · 1984
Earlier work this paper cites.
Arithmetic coding for data compression
Ian H Witten, Radford M Neal, and John G Cleary · 1987
Earlier work this paper cites.
Modeling for text compression
Timothy Bell, Ian H Witten, and John G Cleary · 1989
Earlier work this paper cites.
Succinct representation of general unlabeled graphs
Moni Naor · 1990
Earlier work this paper cites.
Classification by minimum-message-length inference
Chris S Wallace · 1990
Earlier work this paper cites.
Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity
Asim Kumar Debnath, Rosa L Lopez de Compadre, Gargi Debnath, Alan J Shusterman, and Corwin Hansch · 1991
Earlier work this paper cites.
Simple statistical gradient-following algorithms for connectionist reinforcement learning
Ronald J Williams · 1992
Earlier work this paper cites.
Keeping the neural networks simple by minimizing the description length of the weights
Geoffrey E Hinton and Drew Van Camp · 1993
Earlier work this paper cites.
Global min-cuts in rnc, and other ramifications of a simple min-cut algorithm
David R Karger · 1993
Earlier work this paper cites.
A block-sorting lossless data compression algorithm
Michael Burrows and David Wheeler · 1994
Earlier work this paper cites.
Sequential neural text compression
Jürgen Schmidhuber and Stefan Heil · 1996
Earlier work this paper cites.
A fast and high quality multilevel scheme for partitioning irregular graphs
George Karypis and Vipin Kumar · 1998
Earlier work this paper cites.
Elements of information theory
Thomas M Cover · 1999
Earlier work this paper cites.
Fast text compression with neural networks
Matthew V Mahoney · 2000
Earlier work this paper cites.
The predictive toxicology challenge 2000–2001
Christoph Helma, Ross D. King, Stefan Kramer, and Ashwin Srinivasan · 2001
Earlier work this paper cites.
On spectral clustering: Analysis and an algorithm
Andrew Y. Ng, Michael I. Jordan, and Yair Weiss · 2001
Earlier work this paper cites.
Information theory, inference and learning algorithms
David JC MacKay and David JC Mac Kay · 2003
Earlier work this paper cites.
Distinguishing enzyme structures from non-enzymes without alignments
Paul D Dobson and Andrew J Doig · 2003
Earlier work this paper cites.
The webgraph framework i: compression techniques
Paolo Boldi Sebastiano Vigna and P Boldi · 2004
Earlier work this paper cites.
Fully automatic cross-associations
Deepayan Chakrabarti, Spiros Papadimitriou, Dharmendra S Modha, and Christos Faloutsos · 2004
Earlier work this paper cites.
Subdue: Compression-based frequent pattern discovery in graph data
Nikhil S Ketkar, Lawrence B Holder, and Diane J Cook · 2005
Earlier work this paper cites.
Protein function prediction via graph kernels
Karsten M Borgwardt, Cheng Soon Ong, Stefan Schönauer, SVN Vishwanathan, Alex J Smola, and Hans-Peter Kriegel · 2005
Earlier work this paper cites.
Structure induction by lossless graph compression
Leonid Peshkin · 2007
Earlier work this paper cites.
The minimum description length principle
Peter D Grünwald and Abhijit Grunwald · 2007
Earlier work this paper cites.
Near linear time algorithm to detect community structures in large-scale networks
Usha Nandini Raghavan, Réka Albert, and Soundar Kumara · 2007
Earlier work this paper cites.
Information-theoretic concepts for the analysis of complex networks
Matthias Dehmer · 2008
Earlier work this paper cites.
Maps of random walks on complex networks reveal community structure
Martin Rosvall and Carl T Bergstrom · 2008
Earlier work this paper cites.
Fast unfolding of communities in large networks
Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre · 2008
Earlier work this paper cites.
Graph compression by bfs
Alberto Apostolico and Guido Drovandi · 2009
Earlier work this paper cites.
On compressing social networks
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, and Prabhakar Raghavan · 2009
Earlier work this paper cites.
A large scale analysis of information-theoretic network complexity measures using chemical structures
Matthias Dehmer, Nicola Barbarini, Kurt Varmuza, and Armin Graber · 2009
Earlier work this paper cites.
Fast and compact web graph representations
Francisco Claude and Gonzalo Navarro · 2010
Earlier work this paper cites.
Grass: Graph structure summarization
Kristen LeFevre and Evimaria Terzi · 2010
Earlier work this paper cites.
Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks
Paolo Boldi, Marco Rosa, Massimo Santini, and Sebastiano Vigna · 2011
Earlier work this paper cites.
Stochastic blockmodels and community structure in networks
Brian Karrer and Mark EJ Newman · 2011
Cited alongside, same era.
Compression of graphical structures: Fundamental limits, algorithms, and experiments
Yongwook Choi and Wojciech Szpankowski · 2012
Cited alongside, same era.
Entropy and the complexity of graphs revisited
Abbe Mowshowitz and Matthias Dehmer · 2012
Cited alongside, same era.
Entropy of stochastic blockmodel ensembles
Tiago P Peixoto · 2012
Cited alongside, same era.
Learning of structured graph dictionaries
Xuan Zhang, Xiaowen Dong, and Pascal Frossard · 2012
Cited alongside, same era.
Zinc: a free tool to discover chemistry for biology
John J Irwin, Teague Sterling, Michael M Mysinger, Erin S Bolstad, and Ryan G Coleman · 2012
Cited alongside, same era.
Bayesian stochastic blockmodeling
Tiago P Peixoto · 2019
Later among the works it cites.
A review of stochastic block models and extensions for graph clustering
Clement Lee and Darren J Wilkinson · 2019
Later among the works it cites.
Practical lossless compression with latent variables using bits back coding
James Townsend, Thomas Bird, and David Barber · 2019
Later among the works it cites.
Bit-swap: Recursive bits-back coding for lossless compression with hierarchical latent variables
Friso H. Kingma, Pieter Abbeel, and Jonathan Ho · 2019
Later among the works it cites.
Compression with flows via local bits-back coding
Jonathan Ho, Evan Lohn, and Pieter Abbeel · 2019
Later among the works it cites.
Integer discrete flows and lossless compression
Emiel Hoogeboom, Jorn W. T. Peters, Rianne van den Berg, and Max Welling · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Subgraph matching kernels for attributed graphs
Nils M. Kriege and Petra Mutzel · 2012
Cited alongside, same era.
Jarek Duda · 2013
Cited alongside, same era.
Parsimonious module inference in large networks
Tiago P Peixoto · 2013
Cited alongside, same era.
Slashburn: Graph compression and mining beyond caveman communities
Yongsub Lim, U Kang, and Christos Faloutsos · 2014
Cited alongside, same era.
Graphical enumeration
Frank Harary and Edgar M Palmer · 2014
Cited alongside, same era.
Vog: Summarizing and understanding large graphs
Danai Koutra, U Kang, Jilles Vreeken, and Christos Faloutsos · 2014
Cited alongside, same era.
Discrete flows: Invertible generative models of discrete data
Dustin Tran, Keyon Vafa, Kumar Krishna Agrawal, Laurent Dinh, and Ben Poole · 2019
Later among the works it cites.
Efficient graph generation with graph recurrent attention networks
Renjie Liao, Yujia Li, Yang Song, Shenlong Wang, William L. Hamilton, David Duvenaud, Raquel Urtasun, and Richard S. Zemel · 2019
Later among the works it cites.
Conditional structure generation through graph variational generative adversarial nets
Carl Yang, Peiye Zhuang, Wenhan Shi, Alan Luu, and Pan Li · 2019
Later among the works it cites.
Graph reduction with spectral and cut guarantees
Andreas Loukas · 2019
Later among the works it cites.
Solving graph compression via optimal transport
Vikas K. Garg and Tommi S. Jaakkola · 2019
Later among the works it cites.
End to end learning and optimization on graphs
Bryan Wilder, Eric Ewing, Bistra Dilkina, and Milind Tambe · 2019
Later among the works it cites.
Gap: Generalizable approximate graph partitioning framework
Azade Nazi, Will Hang, Anna Goldie, Sujith Ravi, and Azalia Mirhoseini · 2019
Later among the works it cites.
The lottery ticket hypothesis: Finding sparse, trainable neural networks
Jonathan Frankle and Michael Carbin · 2019
Later among the works it cites.
Minimal random code learning: Getting bits back from compressed model parameters
Marton Havasi, Robert Peharz, and José Miguel Hernández-Lobato · 2019
Later among the works it cites.
How powerful are graph neural networks?
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka · 2019
Later among the works it cites.
Weisfeiler and leman go neural: Higher-order graph neural networks
Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe · 2019
Later among the works it cites.
Fast graph representation learning with PyTorch Geometric
Matthias Fey and Jan E. Lenssen · 2019
Later among the works it cites.
Hilloc: lossless image compression with hierarchical latent variable models
James Townsend, Thomas Bird, Julius Kunze, and David Barber · 2020
Later among the works it cites.
Scalable deep generative modeling for sparse graphs
Hanjun Dai, Azade Nazi, Yujia Li, Bo Dai, and Dale Schuurmans · 2020
Later among the works it cites.
Graphaf: a flow-based autoregressive model for molecular graph generation
Chence Shi, Minkai Xu, Zhaocheng Zhu, Weinan Zhang, Ming Zhang, and Jian Tang · 2020
Later among the works it cites.
Permutation invariant graph generation via score-based generative modeling
Chenhao Niu, Yang Song, Jiaming Song, Shengjia Zhao, Aditya Grover, and Stefano Ermon · 2020
Later among the works it cites.
Large-scale network motif analysis using compression
Peter Bloem and Steven de Rooij · 2020
Later among the works it cites.
Copt: Coordinated optimal transport on graphs
Yihe Dong and Will Sawin · 2020
Later among the works it cites.
Graph coarsening with preserved spectral properties
Yu Jin, Andreas Loukas, and Joseph JaJa · 2020
Later among the works it cites.
Spectral clustering with graph neural networks for graph pooling
Filippo Maria Bianchi, Daniele Grattarola, and Cesare Alippi · 2020
Later among the works it cites.
Erdos goes neural: an unsupervised learning framework for combinatorial optimization on graphs
Nikolaos Karalias and Andreas Loukas · 2020
Later among the works it cites.
Tudataset: A collection of benchmark datasets for learning with graphs
Christopher Morris, Nils M. Kriege, Franka Bause, Kristian Kersting, Petra Mutzel, and Marion Neumann · 2020
Later among the works it cites.
Can graph neural networks count substructures?
Zhengdao Chen, Lei Chen, Soledad Villar, and Joan Bruna · 2020
Later among the works it cites.
Building powerful and equivariant graph neural networks with structural message-passing
Clément Vignac, Andreas Loukas, and Pascal Frossard · 2020
Later among the works it cites.
Improving graph neural network expressivity via subgraph isomorphism counting
Giorgos Bouritsas, Fabrizio Frasca, Stefanos Zafeiriou, and Michael M Bronstein · 2020
Later among the works it cites.
Object-centric learning with slot attention
Francesco Locatello, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran, Georg Heigold, Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf · 2020
Later among the works it cites.
Benchmarking graph neural networks
Vijay Prakash Dwivedi, Chaitanya K Joshi, Thomas Laurent, Yoshua Bengio, and Xavier Bresson · 2020
Later among the works it cites.
What graph neural networks cannot learn: depth vs width
Andreas Loukas · 2020
Later among the works it cites.
Scikit-network: Graph analysis in python
Thomas Bonald, Nathan de Lara, Quentin Lutz, and Bertrand Charpentier · 2020
Later among the works it cites.
Experiment tracking with weights and biases, 2020
Lukas Biewald · 2020
Later among the works it cites.
Combinatorial algorithms: generation, enumeration, and search
Donald L Kreher and Douglas R Stinson · 2020
Later among the works it cites.
Improving lossless compression rates via monte carlo bits-back coding
Yangjun Ruan, Karen Ullrich, Daniel Severo, James Townsend, Ashish Khisti, Arnaud Doucet, Alireza Makhzani, and Chris J. Maddison · 2021
Closest in time.
Compressing multisets with large alphabets
Daniel Severo, James Townsend, Ashish Khisti, Alireza Makhzani, and Karen Ullrich · 2021
Closest in time.
IDF++: analyzing and improving integer discrete flows for lossless compression
Rianne van den Berg, Alexey A. Gritsenko, Mostafa Dehghani, Casper Kaae Sønderby, and Tim Salimans · 2021
Closest in time.
Diederik P Kingma, Tim Salimans, Ben Poole, and Jonathan Ho · 2021
Closest in time.
Autoregressive diffusion models
Emiel Hoogeboom, Alexey A Gritsenko, Jasmijn Bastings, Ben Poole, Rianne van den Berg, and Tim Salimans · 2021
Closest in time.
Graphdf: A discrete flow model for molecular graph generation
Youzhi Luo, Keqiang Yan, and Shuiwang Ji · 2021
Closest in time.
Graphebm: Molecular graph generation with energy-based models
Meng Liu, Keqiang Yan, Bora Oztekin, and Shuiwang Ji · 2021
Closest in time.
Reducing the computational cost of deep generative models with binary neural networks
Thomas Bird, Friso H. Kingma, and David Barber · 2021
Closest in time.
Online graph dictionary learning
Cédric Vincent-Cuaz, Titouan Vayer, Rémi Flamary, Marco Corneli, and Nicolas Courty · 2021
Closest in time.
Directional graph networks
Dominique Beaini, Saro Passaro, Vincent Létourneau, William L. Hamilton, Gabriele Corso, and Pietro Lió · 2021
Closest in time.