Shichao Zhu, Shirui Pan, Cheng Wang, Ming Cheng, Xiaoliang Fan, Xu Yan, Chuanpan Zheng, Shangbin Wu
We lifted 5 functions out of this paper's own repositories and ran 2 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| wushangbin/mgfn | — | 2 of 5 |
| Function | Status | Where it lives |
|---|---|---|
| DeepFc | Ran | wushangbin/mgfn/mgfn.py pointer only (licence: NONE) · get_code("d6c6bca3a317278c") |
| GraphStructuralEncoder | Ran | wushangbin/mgfn/mgfn.py pointer only (licence: NONE) · get_code("8276a9b7c7c1e378") |
| ConcatLinear | Not yet run | wushangbin/mgfn/mgfn.py pointer only (licence: NONE) · get_code("2c31041a2c01e4b4") |
| MGFN | Not yet run | wushangbin/mgfn/mgfn.py pointer only (licence: NONE) · get_code("086bbcc26095207a") |
| MobilityPatternJointLearning | Not yet run | wushangbin/mgfn/mgfn.py pointer only (licence: NONE) · get_code("d1dae4b5d3a345e0") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Learning the embeddings for urban regions from human mobility data can reveal the functionality of regions, and then enables the correlated but distinct tasks such as crime prediction. Human mobility data contains rich but abundant information, which yields to the comprehensive region embeddings for cross domain tasks. In this paper, we propose multi-graph fusion networks (MGFN) to enable the cross domain prediction tasks. First, we integrate the graphs with spatio-temporal similarity as mobility patterns through a mobility graph fusion module. Then, in the mobility pattern joint learning module, we design the multi-level crossattention mechanism to learn the comprehensive embeddings from multiple mobility patterns based on intra-pattern and inter-pattern messages. Finally, we conduct extensive experiments on realworld urban datasets. Experimental results demonstrate that the proposed MGFN outperforms the state-of-the-art methods by up to 12.35% improvement.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2201.09760")
get_code_for_paper("2201.09760")
have("2201.09760")
Connect an agent — have() is free.