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

大型图中公平感知的最大团:概念与算法

Fairness-aware Maximal Clique in Large Graphs: Concepts and Algorithms

Qi Zhang, Rong-Hua Li, Minjia Pan, Yongheng Dai, Qun Tian, Guoren Wang

摘要:

属性图的凝聚子图挖掘是图数据分析中的一个基本问题。现有的属性图内聚子图挖掘算法没有考虑子图中属性的公平性。在本文中,我们首次将公平性引入到广泛使用的团模型中来挖掘公平性感知的内聚子图。特别地,我们提出了三个新的公平意识的最大团模型的属性图,分别称为弱公平团,强公平团和相对公平团。为了枚举所有弱公平团,我们开发了一个高效的回溯算法WFCEnum配备了一种新的彩色k-核心的修剪技术。我们还提出了一个高效的枚举算法SFCEnum找到所有强公平团的基础上一个新的属性交替选择搜索技术。为了进一步提高效率,我们还提出了几个非平凡的排序技术的弱和强公平团枚举。为了枚举所有相对公平的团,设计了一种基于彩色k核的二维属性剪枝技术,并在此基础上提出了两种高效的任意维属性搜索算法:RFCRefineEnum和RFCAterEnum.在四个真实图上的实验结果证明了算法的有效性、可扩展性和可扩展性。

英文摘要:

Cohesive subgraph mining on attributed graphs is a fundamental problem in graph data analysis. Existing cohesive subgraph mining algorithms on attributed graphs do not consider the fairness of attributes in the subgraph. In this paper, we, for the first time, introduce fairness into the widely-used clique model to mine fairness-aware cohesive subgraphs. In particular, we propose three novel fairness-aware maximal clique models on attributed graphs, called weak fair clique, strong fair clique and relative fair clique, respectively. To enumerate all weak fair cliques, we develop an efficient backtracking algorithm called WFCEnum equipped with a novel colorful k-core based pruning technique. We also propose an efficient enumeration algorithm called SFCEnum to find all strong fair cliques based on a new attribute-alternatively-selection search technique. To further improve the efficiency, we also present several non-trivial ordering techniques for both weak and strong fair clique enumerations. To enumerate all relative fair cliques, we design an enhanced colorful k-core based pruning technique for 2D attribute, and then develop two efficient search algorithms: RFCRefineEnum and RFCAlterEnum based on the ideas of WFCEnum and SFCEnum for arbitrary dimension attribute. The results of extensive experiments on four real-world graphs demonstrate the efficiency, scalability and effectiveness of the proposed algorithms.

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

↑