Graph Compression: Toward a Generalized Algorithm
Currently, most graph compression algorithms focus on in-memory compression (such as for web graphs) – few are feasible for external compression, and there is no generalized approach to either task. These compressed representations are versatile and can be applied to a great number of different applications, with the most common being social network and search systems. We present a new set of compression approaches, both lossless and lossy, for external memory graph compression. These new algorithms may also be applicable for runtime usage (i.e., running graph algorithms on the compressed representation).
Code (1)
Similar Papers 제목 키워드 기반
Multi-Graph Tensor Networks
The irregular and multi-modal nature of numerous modern data sources poses serious challenges for traditional deep learning algorithms. To this end, recent efforts have generalized existing algorithms to irregular domain…
Algorithmic TradingDeep LearningTensor NetworksRAGE for the Machine: Image Compression with Low-Cost Random Access for Embedded Applications
We introduce RAGE, an image compression framework that achieves four generally conflicting objectives: 1) good compression for a wide variety of color images, 2) computationally efficient, fast decompression, 3) fast ran…
Image CompressionGeneralized Biwords for Bitext Compression and Translation Spotting
Large bilingual parallel texts (also known as bitexts) are usually stored in a compressed form, and previous work has shown that they can be more efficiently compressed if the fact that the two texts are mutual translati…
TranslationGeneralized Gaussian Model for Learned Image Compression
In learned image compression, probabilistic models play an essential role in characterizing the distribution of latent variables. The Gaussian model with mean and scale parameters has been widely used for its simplicity …
Image CompressionmodelLossless Compression of Structured Convolutional Models via Lifting
Lifting is an efficient technique to scale up graphical models generalized to relational domains by exploiting the underlying symmetries. Concurrently, neural models are continuously expanding from grid-like tensor data …
Knowledge Base Completion