The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks
Open accessAbstract
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 JODIE, a coupled recurrent neural network model that learns the embedding trajectories of users and items. JODIE employs two recurrent neural networks to update the embedding of a user and an item at every interaction. Crucially, JODIE 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 t-Batch algorithm that creates time-consistent batches and leads to 9x faster training. We conduct six experiments to validate JODIE on two prediction tasks---future interaction prediction and state change prediction---using four real-world datasets. We show that JODIE outperforms six state-of-the-art algorithms in these tasks by at least 20% in predicting future interactions and 12% in state change prediction.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
Self-citationNew extension of the Kalman filter to nonlinear systems
Julier, S. J., & Uhlmann, J. K. (1997) · SPIE Proceedings · doi:10.1117/12.280797 · Cited by 5,331
Deep Learning Based Recommender System: A Survey and New Perspectives
Zhang, S., Yao, L., Sun, A., & Tay, Y. (2020) · ACM Computing Surveys · doi:10.1145/3285029 · Cited by 3,485
Graph embedding techniques, applications, and performance: A survey
Goyal, P., & Ferrara, E. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.03.022 · Cited by 1,801
MOOCs: A systematic study of the published literature 2008-2012
Liyanagunawardena, T. R., Adams, A. A., & Williams, S. A. (2013) · The International Review of Research in Open and Distributed Learning · doi:10.19173/irrodl.v14i3.1455 · Cited by 1,092
Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
Qiu, J., Dong, Y., Ma, H., Li, J., Wang, K., & Tang, J. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159706 · Cited by 717
Recurrent Recommender Networks
Wu, C.-Y., Ahmed, A., Beutel, A., Smola, A. J., & Jing, H. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018689 · Cited by 713
Patient Subtyping via Time-Aware LSTM Networks
Baytas, I. M., Xiao, C., Zhang, X., Wang, F., Jain, A. K., & Zhou, J. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3097997 · Cited by 613
Self-citationContinuous-Time Dynamic Network Embeddings
Nguyen, G. H., Lee, J. B., Rossi, R. A., Ahmed, N. K., Koh, E., & Kim, S. (2018) · Companion of the The Web Conference 2018 on The Web Conference 2018 - WWW '18 · doi:10.1145/3184558.3191526 · Cited by 538
Recurrent Marked Temporal Point Processes: Embedding Event History to Vector
Du, N., Dai, H., Trivedi, R., Upadhyay, U., Gomez-Rodriguez, M., & Song, L. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939875 · Cited by 536
Anyone Can Become a Troll: Causes of Trolling Behavior in Online Discussions
Cheng, J., Bernstein, M., Danescu-Niculescu-Mizil, C., & Leskovec, J. (2017) · Proceedings of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing · doi:10.1145/2998181.2998213 · Cited by 480
Self-citationREV2: Fraudulent User Prediction in Rating Platforms
Kumar, S., Hooi, B., Makhija, D., Kumar, M., Faloutsos, C., & Subrahmanian, V. S. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159729 · Cited by 372
Self-citationAttributed Network Embedding for Learning in a Dynamic Environment
Li, J., Dani, H., Hu, X., Tang, J., Chang, Y., & Liu, H. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3132919 · Cited by 352
“Predicting MOOC dropout over weeks using machine learning methods,”
Kloft, M., Stiehler, F., Zheng, Z., & Pinkwart, N. (2014) · Proceedings of the EMNLP 2014 Workshop on Analysis of Large Scale Social Interaction in MOOCs · doi:10.3115/v1/w14-4111 · Cited by 325
Community Interaction and Conflict on the Web
Kumar, S., Hamilton, W. L., Leskovec, J., & Jurafsky, D. (2018) · Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18 · doi:10.1145/3178876.3186141 · Cited by 314
Self-citationLatent Cross: Making Use of Context in Recurrent Recommender Systems
Beutel, A., Covington, P., Jain, S., Xu, C., Li, J., Gatto, V., & Chi, E. H. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159727 · Cited by 313
Representation Learning on Graphs: Methods and Applications
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.05584 · Cited by 290
Self-citationScalable Temporal Latent Space Inference for Link Prediction in Dynamic Social Networks
Zhu, L., Guo, D., Yin, J., Steeg, G. V., & Galstyan, A. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2591009 · Cited by 245
A Deep Learning Approach to Link Prediction in Dynamic Networks
Li, X., Du, N., Li, H., Li, K., Gao, J., & Zhang, A. (2014) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611973440.33 · Cited by 175
COEVOLVE: A Joint Point Process Model for Information Diffusion and Network Co-evolutionPreprint
Farajtabar, M., Wang, Y., Gomez-Rodriguez, M., Li, S., Hongyuan Zha, B., & Song, L. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.02293 · Cited by 153
Deep Dynamic Network Embedding for Link Prediction
Li, T., Zhang, J., Yu, P. S., Zhang, Y., & Yan, Y. (2018) · IEEE Access · doi:10.1109/access.2018.2839770 · Cited by 148
Fast ALS-Based Tensor Factorization for Context-Aware Recommendation from Implicit Feedback
Hidasi, B., & Tikk, D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33486-3_5 · Cited by 136
Hierarchical Temporal Convolutional Networks for Dynamic Recommender Systems
You, J., Wang, Y., Pal, A., Eksombatchai, P., Rosenburg, C., & Leskovec, J. (2019) · International World Wide Web Conference (WWW) · doi:10.1145/3308558.3313747 · Cited by 136
Self-citationAnalyzing the Creative Editing Behavior of Wikipedia Editors
Iba, T., Nemoto, K., Peters, B., et al. (2010) · Procedia - Social and Behavioral Sciences · doi:10.1016/j.sbspro.2010.04.054 · Cited by 89
VEWS: A Wikipedia Vandal Early Warning System
Kumar, S., Spezzano, F., & Subrahmanian, V. S. (2015) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2783258.2783367 · Cited by 89
Self-citationModeling Temporal Activity Patterns in Dynamic Social Networks
Raghavan, V., Steeg, G. V., Galstyan, A., & Tartakovsky, A. G. (2014) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2014.2307453 · Cited by 81
Learning Node Embeddings in Interaction Graphs
Zhang, Y., Xiong, Y., Kong, X., & Zhu, Y. (2017) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3132847.3132918 · Cited by 66
Exploiting temporal influence in online recommendation
Pálovics, R., Benczúr, A. A., Kocsis, L., Kiss, T., & Frigó, E. (2014) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2645710.2645723 · Cited by 62
Predicting Intent Using Activity Logs: How Goal Specificity and Temporal Range Affect User Behavior
Cheng, J., Lo, C., & Leskovec, J. (2017) · International World Wide Web Conference (WWW) · doi:10.1145/3041021.3054198 · Cited by 47
Self-citationAgrawal, D., Budak, C., Abbadi, A. E., Georgiou, T., & Yan, X. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-05693-7_1 · Cited by 45
DyLink2Vec: Effective Feature Representation for Link Prediction in Dynamic NetworksPreprint
Rahman, M., Saha, T. K., Hasan, M. A., Xu, K. S., & Reddy, C. K. A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.05755 · Cited by 36
The Block Point Process Model for Continuous-time Event-based Dynamic Networks
Junuthula, R. R., Haghdan, M., Xu, K. S., & Devabhaktuni, V. (2019) · International World Wide Web Conference (WWW) · doi:10.1145/3308558.3313633 · Cited by 32
Leveraging Friendship Networks for Dynamic Link Prediction in Social Interaction Networks
Junuthula, R. R., Xu, K. S., & Devabhaktuni, V. (2018) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v12i1.15059 · Cited by 14
Sedhain, S., Sanner, S., Xie, L., Kidd, R., Tran, N. K., & Christen, P. (2013) · Conference on Online Social Networks · doi:10.1145/2512938.2512947 · Cited by 13
Combining structural and dynamic information to predict activity in link streams
Arnoux, T., Tabourier, L., & Matthieu Latapy, B. (2017) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/3110025.3116209 · Cited by 11
Predicting interactions between individuals with structural and dynamical informationPreprint
Arnoux, T., Tabourier, L., & Matthieu Latapy, B. (2018) · arXiv (Cornell University) · doi:10.18713/jimis-150719-5-3 · Cited by 3
Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphs
Trivedi, R., Dai, H., Wang, Y., & Song, L. (2017) · arXiv · doi:10.48550/arxiv.1705.05742
Cited by
Temporal Graph Networks for Deep Learning on Dynamic Graphs
Rossi, E., Chamberlain, B., Frasca, F., Eynard, D., Monti, F., & Bronstein, M. (2020) · arXiv · doi:10.48550/arxiv.2006.10637 · Cited by 382
Foundations and Modeling of Dynamic Networks Using Dynamic Graph Neural Networks: A Survey
Skarding, J., Gabrys, B., & Musial, K. (2021) · IEEE Access · doi:10.1109/access.2021.3082932 · Cited by 331
eFraudCom: An E-commerce Fraud Detection System via Competitive Graph Neural Networks
Zhang, G., Li, Z., Huang, J., Wu, J., Zhou, C., Yang, J., & Gao, J. (2022) · ACM Transactions on Information Systems · doi:10.1145/3474379 · Cited by 177
Anonymous Edge Representation for Inductive Anomaly Detection in Dynamic Bipartite Graph
Fang, L., Feng, K., Gui, J., Feng, S., & Hu, A. (2023) · Proceedings of the VLDB Endowment · doi:10.14778/3579075.3579088 · Cited by 21
Event2Graph: Event-driven Bipartite Graph for Multivariate Time-series Anomaly Detection
Wu, Y., Gu, M., Wang, L., Lin, Y., Wang, F., & Yang, H. (2021) · arXiv · doi:10.48550/arxiv.2108.06783 · Cited by 6
Metadata
- Authors
- Kumar, S., Zhang, X., & Leskovec, J.
- Venue
- Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
- Publisher
- ACM
- Published
- 2019-07-25
- Volume
- 2019
- Pages
- 1269-1278
- OpenAlex
- W2965683718
- Cited by
- 692
- References
- 37
- FWCI
- 35.43
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.