在动态图中寻找一个简洁、精确和穷举的近双团集
Finding a Concise, Precise, and Exhaustive Set of Near Bi-Cliques in Dynamic Graphs
摘要:
动态图上的各种任务,包括异常检测、社区发现、压缩和图理解,已经被公式化为识别组成(近)双团(即,完全二部图)。即使我们把注意力限制在极大图上,也可能有指数级的多个近双团,因此对于大型图来说,找到所有的近双团几乎是不可能的。那么,两个问题自然会出现:(Q1)什么是“好”的近双团集?也就是说,给定输入动态图中的一组近似双团,我们应该如何评估其质量?(Q2)给定一个大的动态图,我们如何快速识别其中的一组高质量的近双团?关于Q1,我们测量如何简洁,精确和详尽地描述输入动态图的一组给定的近双团。我们结合这三个角度系统的最小描述长度原则。关于Q2,我们提出了CutNPeel,一个快速搜索算法的高质量的一组近双团。通过自适应地对输入图进行重新划分,CutNPeel算法在减小搜索空间的同时提高了搜索质量。我们使用六个真实世界的动态图进行的实验表明,CutNPeel是(a)高质量的:提供比其最先进的竞争对手高出51.2%的近双团质量,(b)快速:比下一个最佳竞争对手快68.8倍,(c)可扩展:扩展到具有1.34亿条边的图形。我们还展示了CutNPeel在图压缩和模式发现方面的成功应用。
英文摘要:
A variety of tasks on dynamic graphs, including anomaly detection, community detection, compression, and graph understanding, have been formulated as problems of identifying constituent (near) bi-cliques (i.e., complete bipartite graphs). Even when we restrict our attention to maximal ones, there can be exponentially many near bi-cliques, and thus finding all of them is practically impossible for large graphs. Then, two questions naturally arise: (Q1) What is a "good" set of near bi-cliques? That is, given a set of near bi-cliques in the input dynamic graph, how should we evaluate its quality? (Q2) Given a large dynamic graph, how can we rapidly identify a high-quality set of near bi-cliques in it? Regarding Q1, we measure how concisely, precisely, and exhaustively a given set of near bi-cliques describes the input dynamic graph. We combine these three perspectives systematically on the Minimum Description Length principle. Regarding Q2, we propose CutNPeel, a fast search algorithm for a high-quality set of near bi-cliques. By adaptively re-partitioning the input graph, CutNPeel reduces the search space and at the same time improves the search quality. Our experiments using six real-world dynamic graphs demonstrate that CutNPeel is (a) High-quality: providing near bi-cliques of up to 51.2% better quality than its state-of-the-art competitors, (b) Fast: up to 68.8x faster than the next-best competitor, and (c) Scalable: scaling to graphs with 134 million edges. We also show successful applications of CutNPeel to graph compression and pattern discovery.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。