大规模网络上的高效最大公平团搜索
Efficient Maximum Fair Clique Search over Large Networks
AI总结:
针对大规模属性图,本文首次研究最大相对公平团搜索,提出彩色支持度图归约、多上界剪枝及线性时间启发式算法,并在六个真实数据集上验证其高效性与可扩展性。
摘要:
在属性图中挖掘内聚子图是图数据分析领域的一个基本问题。公平性考量的融入显著激发了人们对公平感知内聚子图挖掘模型与算法的兴趣。值得注意的是,相对公平团作为一种鲁棒模型出现,它不仅确保全面的属性覆盖,而且在分配属性顶点方面具有更大的灵活性。受该模型优势的启发,我们首次开创性地研究了在大规模图中识别最大相对公平团的问题。我们提出了彩色支持度这一新概念,作为两种新颖图归约技术的基础。这些技术通过迭代移除不属于相对公平团的边,有效缩小图的规模。此外,通过结合顶点属性和颜色的考量,我们提出了最大相对公平团大小的一系列上界。由这些上界导出的剪枝技术能够在分支定界过程中大幅削减不必要的搜索空间。除此之外,我们还提出了一种具有线性时间复杂度的启发式算法,同时采用基于度的贪心策略和基于彩色度的贪心策略来识别更大的相对公平团。该启发式算法可发挥双重作用,辅助分支剪枝,从而提升整体搜索效率。在六个真实数据集上进行的大量实验证明了我们算法的效率、可扩展性和有效性。
英文摘要:
Mining cohesive subgraphs in attributed graphs is an essential problem in the domain of graph data analysis. The integration of fairness considerations significantly fuels interest in models and algorithms for mining fairness-aware cohesive subgraphs. Notably, the relative fair clique emerges as a robust model, ensuring not only comprehensive attribute coverage but also greater flexibility in distributing attribute vertices. Motivated by the strength of this model, we for the first time pioneer an investigation into the identification of the maximum relative fair clique in large-scale graphs. We introduce a novel concept of colorful support, which serves as the foundation for two innovative graph reduction techniques. These techniques effectively narrow the graph's size by iteratively removing edges that do not belong to relative fair cliques. Furthermore, a series of upper bounds of the maximum relative fair clique size is proposed by incorporating consideration of vertex attributes and colors. The pruning techniques derived from these upper bounds can significantly trim unnecessary search space during the branch-and-bound procedure. Adding to this, we present a heuristic algorithm with a linear time complexity, employing both a degree-based greedy strategy and a colored degree-based greedy strategy to identify a larger relative fair clique. This heuristic algorithm can serve a dual purpose by aiding in branch pruning, thereby enhancing overall search efficiency. Extensive experiments conducted on six real-life datasets demonstrate the efficiency, scalability, and effectiveness of our algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。