跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 21:02 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-22 00:50 — 2026-11-23 00:50(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 21:02最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 21:00(北京时间)
版本更新 · v2arXiv:2512.02460

UniCom: A Unified Framework for Community Search and Detection via Transfer Learning

Yifan Zhu, Hanchen Wang, Wenjie Zhang, Alexander Zhou, Ying Zhang

原文摘要

Searching and detecting communities in real-world graphs underpins a wide range of applications. Specifically, community search identifies a community for a given query, whereas community detection partitions the entire graph into multiple communities. Although they target different community analysis objectives, both tasks aim to uncover cohesive community structures and are complementary in real-world applications. Despite this connection, current learning-based solutions generally regard them as separate problems, necessitating task- and dataset-specific retraining. This separated learning paradigm limits the applicability and generalization ability of the existing models. To mitigate this limitation, we propose UniCom, a unified framework to solve both community search and detection tasks. UniCom centers on a Universal Graph Learning (UGL) stage that distills local and global community-aware knowledge from multiple source domains. Following UGL, the Domain-aware Specialization (DAS) stage supports on-the-fly adaptation to unseen graphs and tasks through transfer learning, avoiding costly retraining while keeping the model compact. Extensive experiments on both tasks across 16 datasets and 22 baselines have been conducted to ensure a comprehensive, rigorous, and fair evaluation. UniCom consistently outperforms all state-of-the-art baselines across all tasks while maintaining runtime efficiency.

cs.SI · cs.DB