Geospatial Area Embedding Based on the Movement Purpose Hypothesis Using Large-Scale Mobility Data from Smart Card
By Masanao Ochi, Yuko Nakashio, Matthew Ruttley, Junichiro Mori, Ichiro Sakata. 2016
3 citations recorded by the source corpus.
With the deployment of modern infrastructure for public transportation, several studies have analyzed movement patterns of people using smart card data and have characterized different areas. In this paper, we propose the “movement purpose hypothesis” that each movement occurs from two causes: where the person is and what the person wants to do at a given moment. We formulate this hypothesis to a synthesis model in which two network graphs generate a movement network graph. Then we develop two novel-embedding models to assess the hypothesis, and demonstrate that the models obtain a vector representation of a geospatial area using movement patterns of people from large-scale smart card data. We conducted an experiment using smart card data for a large network of railroads in the Kansai region of Japan. We obtained a vector representation of each railroad station and each purpose using the developed embedding models. Results show that network embedding methods are suitable for a large-scale movement of data, and the developed models perform better than existing embedding methods in the task of multi-label classification for train stations on the purpose of use data set. Our proposed models can contribute to the prediction of people flows by discovering underlying representations of geospatial areas from mobility data.
Subfields: Geography, Planning and Development, Transportation, Signal Processing
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Geography, Planning and Development
In Transportation
In Signal Processing
Citations in the corpus
- A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications (2017, background): “[41], [42] O min(station, company),O ð2Þ min(station, role),O ð2Þ min(destination, boarding) PLE [84] Orank(mention-type) +O min(mention, feature) + O ð2Þ min(type, type) IONE [26] O min(node, node) +O(anchor align) HEBE [45] O min(node, other nodes in one hyperedge) GAKE [38] Oð2Þ max(node, neighbo”