Tell me where you are and I tell you where you are going: Estimation of dynamic mobility graphs

Marcelo Fiori, P. Musé, Mariano Tepper, G. Sapiro
{"title":"Tell me where you are and I tell you where you are going: Estimation of dynamic mobility graphs","authors":"Marcelo Fiori, P. Musé, Mariano Tepper, G. Sapiro","doi":"10.1109/SAM.2016.7569685","DOIUrl":null,"url":null,"abstract":"The interest in problems related to graph inference has been increasing significantly during the last decade. However, the vast majority of the problems addressed are either static, or systems where changes in one node are immediately reflected in other nodes. In this paper we address the problem of mobility graph estimation, when the available dataset has an asynchronous and time-variant nature. We present a formulation for this problem consisting on an optimization of a cost function having a fitting term to explain the observations with the dynamics of the system, and a sparsity promoting penalty term, in order to select the paths actually used. The formulation is tested on two publicly available real datasets on US aviation and NY taxi traffic, showing the importance of the problem and the applicability of the proposed framework.","PeriodicalId":159236,"journal":{"name":"2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM)","volume":"99 7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAM.2016.7569685","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The interest in problems related to graph inference has been increasing significantly during the last decade. However, the vast majority of the problems addressed are either static, or systems where changes in one node are immediately reflected in other nodes. In this paper we address the problem of mobility graph estimation, when the available dataset has an asynchronous and time-variant nature. We present a formulation for this problem consisting on an optimization of a cost function having a fitting term to explain the observations with the dynamics of the system, and a sparsity promoting penalty term, in order to select the paths actually used. The formulation is tested on two publicly available real datasets on US aviation and NY taxi traffic, showing the importance of the problem and the applicability of the proposed framework.
告诉我你在哪里,我就告诉你要去哪里:动态迁移图的估计
在过去十年中,人们对图推理相关问题的兴趣显著增加。然而,所解决的绝大多数问题要么是静态的,要么是一个节点中的更改立即反映到其他节点中的系统。在本文中,我们解决了当可用数据集具有异步和时变性质时的迁移图估计问题。我们提出了这个问题的一个公式,包括一个成本函数的优化,这个函数有一个拟合项来解释系统动态的观察结果,还有一个稀疏性促进惩罚项,以便选择实际使用的路径。该公式在美国航空和纽约出租车交通的两个公开可用的真实数据集上进行了测试,显示了问题的重要性和拟议框架的适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信