首页 | 官方网站   微博 | 高级检索  
     

基于稀疏轨迹聚类的自驾车旅游路线挖掘
引用本文:杨奉毅,马玉鹏,包恒彬,韩云飞,马博.基于稀疏轨迹聚类的自驾车旅游路线挖掘[J].计算机应用,2020,40(4):1079-1084.
作者姓名:杨奉毅  马玉鹏  包恒彬  韩云飞  马博
作者单位:1. 中国科学院新疆理化技术研究所, 乌鲁木齐 830011;2. 中国科学院大学, 北京 100049;3. 新疆民族语音语言信息处理实验室, 乌鲁木齐 830011
基金项目:新疆维吾尔自治区自然科学基金资助项目(2019D01A92);新疆天山杰出青年计划项目(2018Q005)。
摘    要:针对自驾车游客加油轨迹稀疏,还原真实旅游路线困难的问题,提出一种基于语义表示的稀疏轨迹聚类算法,用以挖掘流行的自驾车旅游路线。与基于轨迹点匹配的传统轨迹聚类算法不同,该算法考虑不同轨迹点之间的语义关系,学习轨迹的低维向量表示。首先,利用神经网络语言模型学习加油站点的分布式向量表示;然后,取每条轨迹中所有站点向量的平均值作为该轨迹的向量表示;最后,采用经典的k均值算法对轨迹向量进行聚类。最终的可视化结果表明,所提算法有效地挖掘出了两条流行的自驾车旅游线路。

关 键 词:稀疏轨迹  旅游路线挖掘  轨迹聚类  分布式表示  自驾车旅游  
收稿时间:2019-08-23
修稿时间:2019-10-19

Self-driving tour route mining based on sparse trajectory clustering
YANG Fengyi,MA Yupeng,BAO Hengbin,HAN Yunfei,MA Bo.Self-driving tour route mining based on sparse trajectory clustering[J].journal of Computer Applications,2020,40(4):1079-1084.
Authors:YANG Fengyi  MA Yupeng  BAO Hengbin  HAN Yunfei  MA Bo
Affiliation:1. The Xinjiang Technical Institute of Physics & Chemistry, Chinese Academy of Sciences, Urumqi Xinjiang 830011, China;2. University of Chinese Academy of Sciences, Beijing 100049, China;3. Xinjiang Laboratory of Minority Speech and Language Information Processing, Urumqi Xinjiang 830011, China
Abstract:Aiming at the difficulty of constructing real tour routes from sparse refueling trajectories of self-driving tourists,a sparse trajectory clustering algorithm based on semantic representation was proposed to mine popular self-driving tour routes. Different from traditional trajectory clustering algorithms based on trajectory point matching,in this algorithm, the semantic relationships between different trajectory points were considered and the low-dimensional vector representation of the trajectory was learned. Firstly,the neural network language model was used to learn the distributed vector representation of the gas stations. Then,the average value of all the station vectors in each trajectory was taken as the vector representation of this trajectory. Finally,the classical k-means algorithm was used to cluster the trajectory vectors. The final visualization results show that the proposed algorithm mines two popular self-driving tour routes effectively.
Keywords:sparse trajectory                                                                                                                        tour route mining                                                                                                                        trajectory clustering                                                                                                                        distributed representation                                                                                                                        self-driving tour
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号