Sankalp Garg, Xiang Ren, Navodita Sharma, Woojeong Jin
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Time series prediction is an important problem in machine learning. Previous methods for time series prediction did not involve additional information. With a lot of dynamic knowledge graphs available, we can use this additional information to predict the time series better. Recently, there has been a focus on the application of deep representation learning on dynamic graphs. These methods predict the structure of the graph by reasoning over the interactions in the graph at previous time steps. In this paper, we propose a new framework to incorporate the information from dynamic knowledge graphs for time series prediction. We show that if the information contained in the graph and the time series data are closely related, then this inter-dependence can be used to predict the time series with improved accuracy. Our framework, DARTNET, learns a static embedding for every node in the graph as well as a dynamic embedding which is dependent on the dynamic attribute value (time-series). Then it captures the information from the neighborhood by taking a relation specific mean and encodes the history information using RNN. We jointly train the model link prediction and attribute prediction. We evaluate our method on five specially curated datasets for this problem and show a consistent improvement in time series prediction results. We release the data and code of model DARTNET for future research 1 .
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2003.03919")
get_code_for_paper("2003.03919")
have("2003.03919")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2003.03919.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2003.03919)
Connect an agent — have() is free.