首页> 外文会议>International conference on artificial intelligence and soft computing >Matrix Factorization for Travel Time Estimation in Large Traffic Networks
【24h】

Matrix Factorization for Travel Time Estimation in Large Traffic Networks

机译:大型交通网络中旅行时间估计的矩阵分解

获取原文
获取外文期刊封面目录资料

摘要

Matrix factorization techniques have become extremely popular in the recommender systems. We show that this kind of methods can also be applied in the domain of travel time estimation from historical data. We consider a large matrix of travel times in which the rows correspond to short road segments and the columns to 15 minute time slots of a week. Then, by applying matrix factorization technique we obtain a sparse model of latent features in the form of two matrices which product gives a low-rank approximation of the original matrix. Such a model is characterized by several desired properties. We only need to store the two low-rank matrices instead of the entire matrix. The estimation of the travel time for a given segment and time slot is fast as it only demands multiplication of the corresponding row and column of the low-rank matrices. Moreover, the latent features discovered by the matrix factorization may give an interesting insight to the analyzed problem. In this paper, we introduce that kind of the model and design a fast learning algorithm based on alternating least squares. We test this model empirically on a large real-life data set and show its advantage over several standard models for travel estimation.
机译:矩阵分解技术已在推荐器系统中变得非常流行。我们证明了这种方法也可以应用于根据历史数据估算出行时间的领域。我们考虑一个较大的行驶时间矩阵,其中行对应于短路段,列对应于一周的15分钟时隙。然后,通过应用矩阵分解技术,我们以两个矩阵的形式获得了一个潜在特征的稀疏模型,其乘积给出了原始矩阵的低秩近似。这种模型的特征是具有几个所需的特性。我们只需要存储两个低阶矩阵,而不是整个矩阵。给定段和时隙的行进时间的估计很快,因为它只需要乘以低秩矩阵的相应行和列。此外,通过矩阵分解发现的潜在特征可以为分析的问题提供有趣的见解。在本文中,我们介绍了这种模型,并设计了一种基于交替最小二乘的快速学习算法。我们在大型现实数据集上经验地测试了该模型,并显示了其相对于几种用于旅行估计的标准模型的优势。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号