arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.09808stat.MLcs.LG
收藏

经常性对抗性服务时间

Recurrent Adversarial Service Times

Fraunhofer Center for Machine Learning(弗劳恩霍夫机器学习中心);Fraunhofer IAIS(弗劳恩霍夫智能分析与信息系统研究所);B-IT, University of Bonn(波恩大学波恩-亚琛国际信息技术中心)

César Ojeda, Kostadin Cvejosky, Ramsés J. Sánchez, Jannis Schuecker, Bogdan Georgiev, Christian Bauckhage

摘要:

服务系统动态发生在客户行为和服务提供商的反应之间的相互作用。这种动态可以有效地建模的框架内排队论,客户的到来描述的点过程模型。然而,这些方法受到参数假设的限制,例如,事件间的时间分布。在本文中,我们解决这些限制,并提出了一种新的,深入的神经网络解决排队问题。我们的解决方案结合了一个经常性的神经网络模型的到达过程与一个经常性的生成对抗网络模型的服务时间分布。我们在各种经验数据集上评估我们的方法,从互联网服务(区块链,GitHub,Stackoverflow)到移动服务系统(纽约出租车)。

英文摘要:

Service system dynamics occur at the interplay between customer behaviour and a service provider's response. This kind of dynamics can effectively be modeled within the framework of queuing theory where customers' arrivals are described by point process models. However, these approaches are limited by parametric assumptions as to, for example, inter-event time distributions. In this paper, we address these limitations and propose a novel, deep neural network solution to the queuing problem. Our solution combines a recurrent neural network that models the arrival process with a recurrent generative adversarial network which models the service time distribution. We evaluate our methodology on various empirical datasets ranging from internet services (Blockchain, GitHub, Stackoverflow) to mobility service systems (New York taxi cab).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑