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

NCSAC:通过属性增强电导实现有效的神经社区搜索

NCSAC: Effective Neural Community Search via Attribute-augmented Conductance

College of Computer and Information Science, Southwest University(西南大学计算机与信息科学学院);University of Auckland(奥克兰大学);Chongqing University of Posts and Telecommunications(重庆邮电大学);Huazhong University of Science and Technology(华中科技大学);Beijing Institute of Technology(北京理工大学)

Longlong Lin, Quanao Li, Miao Qiao, Zeli Wang, Jin Zhao, Rong-Hua Li, Xin Luo, Tao Jia

AI总结:

本文提出NCSAC方法,通过融合结构与属性的属性增强电导提取候选社区,并利用强化学习进行图优化,从而显著提升社区搜索的准确性与效率。

摘要:

识别与用户发起查询节点紧密相连的局部密集社区对于广泛的应用至关重要。现有方法要么仅依赖基于规则的约束,要么仅利用深度学习技术来识别目标社区。因此,提出了一个重要问题:深度学习能否与基于规则的约束相结合,以提升社区搜索的质量?在本文中,我们通过引入一种称为基于属性增强电导的神经社区搜索的新方法(缩写为NCSAC)来肯定地回答这个问题。具体而言,NCSAC首先提出了属性增强电导这一新概念,该概念和谐地融合了(内部和外部的)结构邻近性与属性相似性。然后,NCSAC利用所提出的属性增强电导提取出质量令人满意的粗略候选社区。随后,NCSAC将社区搜索构建为一个图优化任务,通过复杂的强化学习技术对候选社区进行细化,从而产生高质量的结果。在六个真实世界图和十个竞争对手上的大量实验证明了我们的解决方案在准确性、效率和可扩展性方面的优越性。值得注意的是,所提出的解决方案优于最先进的方法,实现了从5.3%到42.4%的显著F1分数提升。为了可复现性,源代码可在https://github.com/longlonglin/ncsac获取。

英文摘要:

Identifying locally dense communities closely connected to the user-initiated query node is crucial for a wide range of applications. Existing approaches either solely depend on rule-based constraints or exclusively utilize deep learning technologies to identify target communities. Therefore, an important question is proposed: can deep learning be integrated with rule-based constraints to elevate the quality of community search? In this paper, we affirmatively address this question by introducing a novel approach called Neural Community Search via Attribute-augmented Conductance, abbreviated as NCSAC. Specifically, NCSAC first proposes a novel concept of attribute-augmented conductance, which harmoniously blends the (internal and external) structural proximity and the attribute similarity. Then, NCSAC extracts a coarse candidate community of satisfactory quality using the proposed attribute-augmented conductance. Subsequently, NCSAC frames the community search as a graph optimization task, refining the candidate community through sophisticated reinforcement learning techniques, thereby producing high-quality results. Extensive experiments on six real-world graphs and ten competitors demonstrate the superiority of our solutions in terms of accuracy, efficiency, and scalability. Notably, the proposed solution outperforms state-of-the-art methods, achieving an impressive F1-score improvement ranging from 5.3\% to 42.4\%. For reproducibility purposes, the source code is available at https://github.com/longlonglin/ncsac.

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

↑