arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.06008cs.DS
收藏

K-团图在稠密子图发现中的应用

K-clique-graphs for Dense Subgraph Discovery

G. Nikolentzos, P. Meladianos, Y. Stavrakas, M. Vazirgiannis

摘要:

在图中寻找稠密子图是一项基本的图挖掘任务,在许多领域都有应用。用于识别稠密子图的算法被用于生物学、金融、垃圾邮件检测等领域。这个问题的标准公式,例如找到图的最大团的问题,很难解决。然而,也提出了一些易于处理的公式,主要集中在优化一些密度函数,如度密度和三角形密度。然而,度密度的最大化通常会导致具有小密度的大子图。在本文中,我们介绍了k-团图稠密子图问题,k >= 3,一个新的公式发现稠密子图。给定一个输入图,它的k-团图是从输入图创建的一个新图,其中新图的每个顶点对应于输入图的一个k-团,并且如果两个顶点共享一个公共的(k-1)-团,则它们与一条边相连。我们定义了一个简单的密度函数,k-团图密度,它给出了紧凑的,同时密集的子图,我们将其产生的子图投影回输入图。在本文中,我们专注于三角形图denominator子图问题得到的k=3。为了优化建议的功能,我们提出了一个有效的贪婪近似算法,以及规模较大的图形。我们评估所提出的算法在真实的数据集上,并将其与其他算法的大小和密度的提取的子图。实验结果验证了该算法在寻找高质量子图的能力。最后,我们将所提出的方法应用到文本文档的关键字提取的重要问题。

英文摘要:

Finding dense subgraphs in a graph is a fundamental graph mining task, with applications in several fields. Algorithms for identifying dense subgraphs are used in biology, in finance, in spam detection, etc. Standard formulations of this problem such as the problem of finding the maximum clique of a graph are hard to solve. However, some tractable formulations of the problem have also been proposed, focusing mainly on optimizing some density function, such as the degree density and the triangle density. However, maximization of degree density usually leads to large subgraphs with small density. In this paper, we introduce the k-clique-graph densest subgraph problem, k >= 3, a novel formulation for the discovery of dense subgraphs. Given an input graph, its k-clique-graph is a new graph created from the input graph where each vertex of the new graph corresponds to a k-clique of the input graph and two vertices are connected with an edge if they share a common (k-1)-clique. We define a simple density function, the k-clique-graph density, which gives compact and at the same time dense subgraphs, and we project its resulting subgraphs back to the input graph. In this paper we focus on the triangle-graph densest subgraph problem obtained for k=3. To optimize the proposed function, we present an efficient greedy approximation algorithm that scales well to larger graphs. We evaluate the proposed algorithm on real datasets and compare it with other algorithms in terms of the size and the density of the extracted subgraphs. The results verify the ability of the proposed algorithm in finding high-quality subgraphs in terms of size and density. Finally, we apply the proposed method to the important problem of keyword extraction from textual documents.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑