通过扩散、从众与贡献解耦预测科学影响力
Predicting Scientific Impact Through Diffusion, Conformity, and Contribution Disentanglement
AI总结:
本文提出 DPPDCC 模型,将论文潜在影响力解耦为扩散、从众与贡献三类因素,在动态异质引用网络中建模知识流动并预测引用增量,实验证明其优于现有基线方法。
摘要:
学术论文的科学影响力受到动态流行度和内在贡献等复杂因素的影响。现有模型通常依赖静态图进行引用次数估计,未能区分其来源。相比之下,我们提出区分由不同因素产生的效应,并在动态语境中将引用增量预测为估计的潜在影响力。在本研究中,我们引入了一种新模型 DPPDCC,它将论文的潜在影响力解耦为扩散值、从众值和贡献值。该模型在从引用网络派生的动态异质图中编码时间和结构特征,并应用各种辅助任务进行解耦。通过强调比较信息以及共被引/引用信息,并以演化方式聚合快照,DPPDCC 捕捉了引用网络中的知识流动。随后,通过对比增强图来提取引用扩散的本质,并预测引用累积区间以进行定量从众建模,从而勾勒出流行度。正交约束确保每个视角的独立建模,保留贡献值。为了衡量跨发表时间的泛化能力并复现真实的动态语境,我们基于特定时间点划分数据,并保留所有样本而不进行严格过滤。在三个数据集上的大量实验验证了 DPPDCC 相对于基线方法在先前发表、新近发表和即时发表的论文上的优越性,进一步分析证实了其鲁棒性。我们的代码和补充材料可在 https://github.com/ECNU-Text-Computing/DPPDCC 找到。
英文摘要:
The scientific impact of academic papers is influenced by intricate factors such as dynamic popularity and inherent contribution. Existing models typically rely on static graphs for citation count estimation, failing to differentiate among its sources. In contrast, we propose distinguishing effects derived from various factors and predicting citation increments as estimated potential impacts within the dynamic context. In this research, we introduce a novel model, DPPDCC, which Disentangles the Potential impacts of Papers into Diffusion, Conformity, and Contribution values. It encodes temporal and structural features within dynamic heterogeneous graphs derived from the citation networks and applies various auxiliary tasks for disentanglement. By emphasizing comparative and co-cited/citing information and aggregating snapshots evolutionarily, DPPDCC captures knowledge flow within the citation network. Afterwards, popularity is outlined by contrasting augmented graphs to extract the essence of citation diffusion and predicting citation accumulation bins for quantitative conformity modeling. Orthogonal constraints ensure distinct modeling of each perspective, preserving the contribution value. To gauge generalization across publication times and replicate the realistic dynamic context, we partition data based on specific time points and retain all samples without strict filtering. Extensive experiments on three datasets validate DPPDCC's superiority over baselines for papers published previously, freshly, and immediately, with further analyses confirming its robustness. Our codes and supplementary materials can be found at https://github.com/ECNU-Text-Computing/DPPDCC.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。