论文标题
使用自动编码器发现旅行伴侣
Discovering Traveling Companions using Autoencoders
论文作者
论文摘要
随着移动设备的广泛采用,当今的位置跟踪系统(例如卫星,蜂窝基站和无线接入点)不断生成大量移动对象的位置数据。许多应用程序,例如智能运输系统和基于位置的服务,可以发现从其轨迹中发现移动对象,即旅行伴侣。现有的算法是基于定义特定旅行伴侣模式的模式挖掘方法,或者基于表示相似轨迹的类似表示的表示方法。前者的方法遇到了成对点匹配问题,而后者通常会忽略轨迹之间的时间接近。在这项工作中,我们建议使用自动编码器,即ATTN-Mean,以发现旅行伴侣。 ATTN均值分别使用跳过,位置编码技术将空间和时间信息统称为其输入嵌入。此外,我们的模型进一步鼓励轨迹通过利用排序回报算法,平均操作和全球注意机制来向邻居学习。从编码器获得表示形式后,我们运行dbscan以聚集表示形式以找到旅行伴侣。同一集群中的相应轨迹被认为是旅行伴侣。实验结果表明,在寻找旅行伴侣方面,ATTN均值比最先进的算法表现更好。
With the wide adoption of mobile devices, today's location tracking systems such as satellites, cellular base stations and wireless access points are continuously producing tremendous amounts of location data of moving objects. The ability to discover moving objects that travel together, i.e., traveling companions, from their trajectories is desired by many applications such as intelligent transportation systems and location-based services. Existing algorithms are either based on pattern mining methods that define a particular pattern of traveling companions or based on representation learning methods that learn similar representations for similar trajectories. The former methods suffer from the pairwise point-matching problem and the latter often ignore the temporal proximity between trajectories. In this work, we propose a generic deep representation learning model using autoencoders, namely, ATTN-MEAN, for the discovery of traveling companions. ATTN-MEAN collectively injects spatial and temporal information into its input embeddings using skip-gram, positional encoding techniques, respectively. Besides, our model further encourages trajectories to learn from their neighbours by leveraging the Sort-Tile-Recursive algorithm, mean operation and global attention mechanism. After obtaining the representations from the encoders, we run DBSCAN to cluster the representations to find travelling companion. The corresponding trajectories in the same cluster are considered as traveling companions. Experimental results suggest that ATTN-MEAN performs better than the state-of-the-art algorithms on finding traveling companions.