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

软图聚类的混合整数线性规划方法

A mixed-integer linear programming approach for soft graph clustering

Vicky Mak-Hau, John Yearwood

摘要:

提出了一种求解软图聚类问题的混合线性规划方法。这是第一个同时为位于多个簇中的顶点分配成员资格比例的方法,并且强制实现簇成员资格的平等平衡。与([Palla et al.,2005],[Derenyi等人,2005],[Adamcsek等人,2006]),在我们的方法中发现的集群不限于k-团邻域。与([Hope and Keller,2013])相比,我们的方法即使对于连通的未加权图也可以产生非平凡的聚类。

英文摘要:

This paper proposes a Mixed-Integer Linear Programming approach for the Soft Graph Clustering Problem. This is the first method that simultaneously allocates membership proportion for vertices that lie in multiple clusters, and that enforces an equal balance of the cluster memberships. Compared to ([Palla et al., 2005], [Derenyi et al., 2005], [Adamcsek et al., 2006]), the clusters found in our method are not limited to k-clique neighbourhoods. Compared to ([Hope and Keller, 2013]), our method can produce non-trivial clusters even for a connected unweighted graph.

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

↑