How do you visit: Identifying addicts from large-scale transit records via scenario deep embedding

2021 
Identification of individuals based on transit modes is of great importance in user tracking systems. However, identifying users in real-life studies is not trivial owing to the following challenges: 1) activity data containing both temporal and spatial context are high-order and sparse; 2) traditional two-step classifiers depend on trajectory patterns as input features, which limits accuracy especially in the case of scattered and diverse data; 3) in some cases, there are few positive instances and they are difficult to detect. Therefore, approaches involving statistics-based or trajectory-based features do not work effectively. Deep learning methods also suffer from the problem of how to represent trajectory vectors for user classification. Here, we propose a novel end-to-end scenario-based deep learning method to address these challenges, based on the observation that individuals may visit the same place for different reasons. We first define a scenario using critical places and related trajectories. Next, we embed scenarios via path-based or graph-based approaches using extended embedding techniques. Finally, a two-level convolution neural network is constructed for the classification. Our model is applied to the problem of detection of addicts using transit records directly without feature engineering, based on real-life data collected from mobile devices. Based on constructed scenario with dense trajectories, our model outperforms classical classification approaches, anomaly detection methods, state-of-the-art sequential deep learning models, and graph neural networks. Moreover, we provide statistical analyses and intuitiveexplanations to interpret the characteristics of resident and addict mobility. Our method could be generalized to other trajectory-related tasks involving scattered and diverse data.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    43
    References
    0
    Citations
    NaN
    KQI
    []