Danai Koutra, U Kang, Jilles Vreeken, Christos Faloutsos
TL;DR本文提出了在大规模图中构建子图词汇表,以及如何通过在词汇表中的子图减少总体描述长度的方式对图形进行描述,并提出了一个高效算法,以便应用于像 Flickr 和 Norte Dame 网站这样的多百万边实际应用中。
Abstract
How can we succinctly describe a million-node graph with a few simple
sentences? How can we measure the "importance" of a set of discovered subgraphs
in a large graph? These are exactly the problems we focus on. Our main ideas
are to construct a "vocabulary" of subgraph-types that ofte