scholarly journals Understanding People Lifestyles: Construction of Urban Movement Knowledge Graph from GPS Trajectory

Author(s):  
Chenyi Zhuang ◽  
Nicholas Jing Yuan ◽  
Ruihua Song ◽  
Xing Xie ◽  
Qiang Ma

Technologies are increasingly taking advantage of the explosion in the amount of data generated by social multimedia (e.g., web searches, ad targeting, and urban computing). In this paper, we propose a multi-view learning framework for presenting the construction of a new urban movement knowledge graph, which could greatly facilitate the research domains mentioned above. In particular, by viewing GPS trajectory data from temporal, spatial, and spatiotemporal points of view, we construct a knowledge graph of which nodes and edges are their locations and relations, respectively. On the knowledge graph, both nodes and edges are represented in latent semantic space. We verify its utility by subsequently applying the knowledge graph to predict the extent of user attention (high or low) paid to different locations in a city. Experimental evaluations and analysis of a real-world dataset show significant improvements in comparison to state-of-the-art methods.

Informatica ◽  
2019 ◽  
Vol 30 (1) ◽  
pp. 33-52 ◽  
Author(s):  
Pengfei HAO ◽  
Chunlong YAO ◽  
Qingbin MENG ◽  
Xiaoqiang YU ◽  
Xu LI

2021 ◽  
Author(s):  
Chao Chen ◽  
Daqing Zhang ◽  
Yasha Wang ◽  
Hongyu Huang

2019 ◽  
Vol 8 (9) ◽  
pp. 411 ◽  
Author(s):  
Tang ◽  
Deng ◽  
Huang ◽  
Liu ◽  
Chen

Ubiquitous trajectory data provides new opportunities for production and update of the road network. A number of methods have been proposed for road network construction and update based on trajectory data. However, existing methods were mainly focused on reconstruction of the existing road network, and the update of newly added roads was not given much attention. Besides, most of existing methods were designed for high sampling rate trajectory data, while the commonly available GPS trajectory data are usually low-quality data with noise, low sampling rates, and uneven spatial distributions. In this paper, we present an automatic method for detection and update of newly added roads based on the common low-quality trajectory data. First, additive changes (i.e., newly added roads) are detected using a point-to-segment matching algorithm. Then, the geometric structures of new roads are constructed based on a newly developed decomposition-combination map generation algorithm. Finally, the detected new roads are refined and combined with the original road network. Seven trajectory data were used to test the proposed method. Experiments show that the proposed method can successfully detect the additive changes and generate a road network which updates efficiently.


2020 ◽  
Vol 9 (3) ◽  
pp. 181
Author(s):  
Banqiao Chen ◽  
Chibiao Ding ◽  
Wenjuan Ren ◽  
Guangluan Xu

The requirements of location-based services have generated an increasing need for up-to-date digital road maps. However, traditional methods are expensive and time-consuming, requiring many skilled operators. The feasibility of using massive GPS trajectory data provides a cheap and quick means for generating and updating road maps. The detection of road intersections, being the critical component of a road map, is a key problem in map generation. Unfortunately, low sampling rates and high disparities are ubiquitous among floating car data (FCD), making road intersection detection from such GPS trajectories very challenging. In this paper, we extend a point clustering-based road intersection detection framework to include a post-classification course, which utilizes the geometric features of road intersections. First, we propose a novel turn-point position compensation algorithm, in order to improve the concentration of selected turn-points under low sampling rates. The initial detection results given by the clustering algorithm are recall-focused. Then, we rule out false detections in an extended classification course based on an image thinning algorithm. The detection results of the proposed method are quantitatively evaluated by matching with intersections from OpenStreetMap using a variety of distance thresholds. Compared with other methods, our approach can achieve a much higher recall rate and better overall performance, thereby better supporting map generation and other similar applications.


Sign in / Sign up

Export Citation Format

Share Document