arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0909.2814cs.DMcs.DS
收藏

基于图的数据聚类:一个二次顶点问题的s-ClusterVertexDeletion

Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion

René van Bevern

摘要:

我们介绍了s-簇顶点删除问题。与聚类顶点删除问题一样,它是NP难的,并且是由基于图的数据聚类驱动的。簇顶点删除中的任务是从图中删除顶点,使其连接的组件成为团,而s-cluster簇顶点删除中的任务是从图中删除顶点,使其连接的组件成为s-plexes。一个s-plex是一个图,其中每个顶点最多不与其他s-1个顶点相邻;一个团是一个1-plex。与Cluster Vertex Deletion相比,s-Cluster Vertex Deletion允许平衡顶点删除的数量与结果聚类的大小和密度,这些聚类是s-plexes而不是团。这项工作的重点是可证明的高效和有效的数据约简规则的发展,s-聚类顶点删除。在固定参数算法方面,这些产生了所谓的问题核。一个类似的问题,s-plexediting,其中的任务是插入或删除的边缘,使连接组件的图成为s-plexes,也被研究的固定参数算法。使用允许的图形修改数量作为参数,我们预计s-ClusterVertex Deletion的典型参数值将显著低于s-ClusterEditing,因为一个顶点删除可能导致大量的边删除。这为s-ClusterVertex Deletion的快速固定参数算法提供了前景。

英文摘要:

We introduce the s-Plex Cluster Vertex Deletion problem. Like the Cluster Vertex Deletion problem, it is NP-hard and motivated by graph-based data clustering. While the task in Cluster Vertex Deletion is to delete vertices from a graph so that its connected components become cliques, the task in s-Plex Cluster Vertex Deletion is to delete vertices from a graph so that its connected components become s-plexes. An s-plex is a graph in which every vertex is nonadjacent to at most s-1 other vertices; a clique is an 1-plex. In contrast to Cluster Vertex Deletion, s-Plex Cluster Vertex Deletion allows to balance the number of vertex deletions against the sizes and the density of the resulting clusters, which are s-plexes instead of cliques. The focus of this work is the development of provably efficient and effective data reduction rules for s-Plex Cluster Vertex Deletion. In terms of fixed-parameter algorithmics, these yield a so-called problem kernel. A similar problem, s-Plex Editing, where the task is the insertion or the deletion of edges so that the connected components of a graph become s-plexes, has also been studied in terms of fixed-parameter algorithmics. Using the number of allowed graph modifications as parameter, we expect typical parameter values for s-Plex Cluster Vertex Deletion to be significantly lower than for s-Plex Editing, because one vertex deletion can lead to a high number of edge deletions. This holds out the prospect for faster fixed-parameter algorithms for s-Plex Cluster Vertex Deletion.

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

↑