重叠相关聚类:一种启发式图编辑方法
Correlation Clustering with Overlap: a Heuristic Graph Editing Approach
AI总结:
针对簇编辑模型中“紧密相关需直接相邻”和“数据元素无法多簇归属”的问题,提出通过小直径子图转化和顶点克隆解决重叠相关聚类,并给出有效启发式方法及实验验证。
摘要:
相关聚类旨在将给定图/网络的顶点集划分为紧密相关或足够接近的顶点组,使得不同组的元素彼此不接近。该问题此前已被建模和研究为图编辑问题,即簇编辑(Cluster Editing),其假设紧密相关的数据元素必须相邻。因此,簇编辑问题的主要目标是将簇转化为团以识别它们,这需通过两种主要边编辑操作实现:添加和删除。本文旨在解决簇编辑模型的两个问题:首先,“紧密”相关不一定意味着“直接”相关,因此应通过相对较短的距离衡量接近度,我们寻求将簇转化为小直径(子)图;其次,在实际应用中,数据元素可属于多个组或承担多种角色,若不允许每个数据元素属于多个簇,经典基于划分的方法难以实现聚类,我们通过允许顶点克隆(也称为顶点分裂)解决该问题。本文提出了针对所引入问题的启发式方法,并给出实验结果,证明所提模型和算法方法的有效性。
英文摘要:
Correlation clustering seeks a partition of the vertex set of a given graph/network into groups of closely related, or just close enough, vertices so that elements of different groups are not close to each other. The problem has been previously modeled and studied as a graph editing problem, namely Cluster Editing, which assumes that closely related data elements must be adjacent. As such, the main objective (of the Cluster Editing problem) is to turn clusters into cliques as a way to identify them. This is to be obtained via two main edge editing operations: additions and deletions. There are two problems with the Cluster Editing model that we seek to address in this paper. First, ``closely'' related does not necessarily mean ``directly'' related. So closeness should be measured by relatively short distance. As such, we seek to turn clusters into (sub)graphs of small diameter. Second, in real applications, a data element can belong, or have roles, in multiple groups. In some cases, without allowing data elements to belong to more than one cluster each, makes it hard to achieve any clustering via classical partition-based methods. We address this latter problem by allowing vertex cloning, also known as vertex splitting. Heuristic methods for the introduced problem are presented along with experimental results showing the effectiveness of the proposed model and algorithmic approach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。