-
Notifications
You must be signed in to change notification settings - Fork 390
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
How could I get METR-LA dataset? #10
Comments
Hi Louis, you may get the dataset following instructions in the README. |
Hi, the URL in the README is actually the raw data. You can generate the
processed training data using
python -m scripts.generate_training_data --output_dir=data/METR-LA
…On Sun, Oct 7, 2018 at 12:51 AM Louis ***@***.***> wrote:
Thanks. But what I mean is that I want to get rawdata. Is it available?
—
You are receiving this because you commented.
Reply to this email directly, view it on GitHub
<#10 (comment)>, or mute
the thread
<https://github.com/notifications/unsubscribe-auth/AFSHIWkINGeWmLXs3fyktBStbctv5r4cks5uibJkgaJpZM4XLs53>
.
|
hi,where can I get an introduction to the dataset? |
Hi, where can I find information on how |
这是来自QQ邮箱的自动回复邮件。
邮件已收到。
|
This could be helpful to convert to csv and read the h5 files. 207 detectors. Speed in 5min intervals
|
这是来自QQ邮箱的自动回复邮件。
邮件已收到。
|
If you're using the numpy arrays in the npy example: https://pytorch-geometric-temporal.readthedocs.io/en/latest/_modules/torch_geometric_temporal/dataset/metr_la.html. The first array (node_values.npy) is simply the speed values from the mtr-la.h5 file. The second array is the adjacency matrix (adj_mat.npy) as discussed in the article. It's created from the graph_sensor_ids.txt and distances_la_2012.csv. Then it's somehow flattened which I'm still trying to figure out.
|
This PowerPoint has something to do with that: https://www.slideshare.net/chirantanGupta1/traffic-prediction-from-street-network-imagespptx |
|
And this repository is also related to the adjacency matrix: https://github.com/FelixOpolka/STGCN-PyTorch |
Probably just the distances between all two points put in matrix shape (207 Detectors X 207 Detectors), but it's related to the adjacency matrix found in: adj_mat.npy
|
For each detector node the nearest 12 detectors nodes are added into the adjacency matrix, the rest are filled with 0s. 1 is always the weight path to the current detector node in the list. Could maybe also use the k-nearest neighbor algorithm.? Idk. |
Trying to reconstruct this example here because I have my own data from a different city: https://colab.research.google.com/drive/132hNQ0voOtTVk3I4scbD3lgmPTQub0KR?usp=sharing |
Dijkstra finds the optimal route between two detectors. |
An example with Dijkstra using OpenStreetMap. Output slightly different than with Google Maps. https://medium.com/p/2d97d4881996
|
这是来自QQ邮箱的自动回复邮件。
邮件已收到。
|
Here's how I created my own distance matrix: https://github.com/ThomasAFink/osmnx_adjacency_matrix_for_graph_convolutional_networks |
这是来自QQ邮箱的自动回复邮件。
邮件已收到。
|
1 similar comment
这是来自QQ邮箱的自动回复邮件。
邮件已收到。
|
I have already found the data I need in other Repositories. Sorry to bother you. Thank you for your timely attention and wonderful work
…---Original---
From: ***@***.***>
Date: Wed, Jul 12, 2023 16:13 PM
To: ***@***.***>;
Cc: ***@***.******@***.***>;
Subject: Re: [liyaguang/DCRNN] How could I get METR-LA dataset? (#10)
这是来自QQ邮箱的自动回复邮件。
邮件已收到。
—
Reply to this email directly, view it on GitHub, or unsubscribe.
You are receiving this because you commented.Message ID: ***@***.***>
|
No description provided.
The text was updated successfully, but these errors were encountered: