• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

预测时间交互网络中的动态嵌入轨迹

Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks.

作者信息

Kumar Srijan, Zhang Xikun, Leskovec Jure

机构信息

Stanford University, USA and Georgia Institute of Technology, USA.

University of Illinois, Urbana-Champaign, USA.

出版信息

KDD. 2019 Aug;2019:1269-1278. doi: 10.1145/3292500.3330895.

DOI:10.1145/3292500.3330895
PMID:31538030
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC6752886/
Abstract

Modeling sequential interactions between users and items/products is crucial in domains such as e-commerce, social networking, and education. Representation learning presents an attractive opportunity to model the dynamic evolution of users and items, where each user/item can be embedded in a Euclidean space and its evolution can be modeled by an embedding trajectory in this space. However, existing dynamic embedding methods generate embeddings only when users take actions and do not explicitly model the future trajectory of the user/item in the embedding space. Here we propose , a coupled recurrent neural network model that learns the embedding trajectories of users and items. employs two recurrent neural networks to update the embedding of a user and an item at every interaction. Crucially, also models the future embedding trajectory of a user/item. To this end, it introduces a novel projection operator that learns to estimate the embedding of the user at any time in the future. These estimated embeddings are then used to predict future user-item interactions. To make the method scalable, we develop a algorithm that creates time-consistent batches and leads to 9× faster training. We conduct six experiments to validate on two prediction tasks- future interaction prediction and state change prediction-using four real-world datasets. We show that outperforms six state-of-the-art algorithms in these tasks by at least 20% in predicting future interactions and 12% in state change prediction.

摘要

对用户与商品/产品之间的序列交互进行建模在电子商务、社交网络和教育等领域至关重要。表示学习为对用户和商品的动态演变进行建模提供了一个有吸引力的机会,其中每个用户/商品都可以嵌入到欧几里得空间中,并且其演变可以通过该空间中的嵌入轨迹来建模。然而,现有的动态嵌入方法仅在用户采取行动时生成嵌入,并未明确对用户/商品在嵌入空间中的未来轨迹进行建模。在此,我们提出了一种耦合循环神经网络模型,该模型可学习用户和商品的嵌入轨迹。该模型采用两个循环神经网络在每次交互时更新用户和商品的嵌入。至关重要的是,它还对用户/商品的未来嵌入轨迹进行建模。为此,它引入了一种新颖的投影算子,该算子学习估计用户在未来任何时间的嵌入。然后,这些估计的嵌入用于预测未来的用户-商品交互。为了使该方法具有可扩展性,我们开发了一种算法,该算法创建时间一致的批次,使训练速度提高9倍。我们进行了六项实验,使用四个真实世界的数据集在两个预测任务(未来交互预测和状态变化预测)上验证该模型。我们表明,在这些任务中,该模型在预测未来交互方面比六种最先进的算法至少高出20%,在状态变化预测方面高出12%。

相似文献

1
Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks.预测时间交互网络中的动态嵌入轨迹
KDD. 2019 Aug;2019:1269-1278. doi: 10.1145/3292500.3330895.
2
Neural Time-Aware Sequential Recommendation by Jointly Modeling Preference Dynamics and Explicit Feature Couplings.通过联合建模偏好动态和显式特征耦合进行神经时序感知序列推荐。
IEEE Trans Neural Netw Learn Syst. 2022 Oct;33(10):5125-5137. doi: 10.1109/TNNLS.2021.3069058. Epub 2022 Oct 5.
3
TigeCMN: On exploration of temporal interaction graph embedding via Coupled Memory Neural Networks.TigeCMN:基于耦合记忆神经网络的时间交互图嵌入探索。
Neural Netw. 2021 Aug;140:13-26. doi: 10.1016/j.neunet.2021.02.016. Epub 2021 Mar 4.
4
A Novel Temporal Network-Embedding Algorithm for Link Prediction in Dynamic Networks.一种用于动态网络中链路预测的新型时间网络嵌入算法。
Entropy (Basel). 2023 Jan 31;25(2):257. doi: 10.3390/e25020257.
5
Session Recommendation via Recurrent Neural Networks over Fisher Embedding Vectors.基于Fisher嵌入向量的循环神经网络会话推荐
Sensors (Basel). 2019 Aug 10;19(16):3498. doi: 10.3390/s19163498.
6
Graph convolutional network and self-attentive for sequential recommendation.用于序列推荐的图卷积网络和自注意力机制
PeerJ Comput Sci. 2023 Dec 1;9:e1701. doi: 10.7717/peerj-cs.1701. eCollection 2023.
7
ConTIG: Continuous representation learning on temporal interaction graphs.ConTIG:基于时间交互图的连续表示学习。
Neural Netw. 2024 Apr;172:106151. doi: 10.1016/j.neunet.2024.106151. Epub 2024 Jan 29.
8
Context Attention Heterogeneous Network Embedding.上下文注意力异质网络嵌入。
Comput Intell Neurosci. 2019 Aug 21;2019:8106073. doi: 10.1155/2019/8106073. eCollection 2019.
9
Deep Bi-LSTM Networks for Sequential Recommendation.用于序列推荐的深度双向长短期记忆网络
Entropy (Basel). 2020 Aug 7;22(8):870. doi: 10.3390/e22080870.
10
Routing User-Interest Markov Tree for Scalable Personalized Knowledge-Aware Recommendation.用于可扩展个性化知识感知推荐的路由用户兴趣马尔可夫树
IEEE Trans Neural Netw Learn Syst. 2024 Oct;35(10):14233-14246. doi: 10.1109/TNNLS.2023.3276395. Epub 2024 Oct 7.

引用本文的文献

1
Continually-Adaptive Representation Learning Framework for Time-Sensitive Healthcare Applications.用于时间敏感型医疗保健应用的持续自适应表示学习框架
Proc ACM Int Conf Inf Knowl Manag. 2023;2023:4538-4544. doi: 10.1145/3583780.3615464. Epub 2023 Oct 21.
2
Dynamic Periodic Event Graphs for multivariate time series pattern prediction.用于多变量时间序列模式预测的动态周期事件图
PeerJ Comput Sci. 2025 Feb 24;11:e2717. doi: 10.7717/peerj-cs.2717. eCollection 2025.
3
GAD-NR: Graph Anomaly Detection via Neighborhood Reconstruction.

本文引用的文献

1
Anyone Can Become a Troll: Causes of Trolling Behavior in Online Discussions.任何人都可能成为网络喷子:在线讨论中喷子行为的成因。
CSCW Conf Comput Support Coop Work. 2017 Feb-Mar;2017:1217-1230. doi: 10.1145/2998181.2998213.
2
node2vec: Scalable Feature Learning for Networks.节点2向量:网络的可扩展特征学习
KDD. 2016 Aug;2016:855-864. doi: 10.1145/2939672.2939754.
GAD-NR:通过邻域重构进行图异常检测
Proc Int Conf Web Search Data Min. 2024 Mar;2024:576-585. doi: 10.1145/3616855.3635767. Epub 2024 Mar 4.
4
A Temporal Graph Dataset of Bitcoin Entity-Entity Transactions.比特币实体-实体交易的时态图数据集。
Sci Data. 2025 Feb 26;12(1):337. doi: 10.1038/s41597-025-04595-8.
5
Multi-angle information aggregation for inductive temporal graph embedding.用于归纳式时态图嵌入的多角度信息聚合
PeerJ Comput Sci. 2024 Nov 26;10:e2560. doi: 10.7717/peerj-cs.2560. eCollection 2024.
6
Dynamic identification of important nodes in complex networks based on the KPDN-INCC method.基于KPDN-INCC方法的复杂网络中重要节点的动态识别
Sci Rep. 2024 Mar 9;14(1):5814. doi: 10.1038/s41598-024-56226-8.
7
Dynamic network link prediction with node representation learning from graph convolutional networks.基于图卷积网络的节点表示学习的动态网络链路预测
Sci Rep. 2024 Jan 4;14(1):538. doi: 10.1038/s41598-023-50977-6.
8
A dynamic graph Hawkes process based on linear complexity self-attention for dynamic recommender systems.一种基于线性复杂度自注意力机制的动态图霍克斯过程,用于动态推荐系统。
PeerJ Comput Sci. 2023 May 9;9:e1368. doi: 10.7717/peerj-cs.1368. eCollection 2023.
9
Advances in AI for web integrity, equity, and well-being.人工智能在网络诚信、公平性和福祉方面的进展。
Front Big Data. 2023 May 5;6:1125083. doi: 10.3389/fdata.2023.1125083. eCollection 2023.
10
Natural and Artificial Dynamics in Graphs: Concept, Progress, and Future.图中的自然与人工动力学:概念、进展与未来
Front Big Data. 2022 Dec 2;5:1062637. doi: 10.3389/fdata.2022.1062637. eCollection 2022.