Abstract
In this paper we consider the problem of estimating the difficulty of parking at a particular time and place; this problem is a critical sub-component for any system providing parking assistance to users. We describe an approach to this problem that is currently in production in Google Maps, providing inferences in cities across the world. We present a wide range of features intended to capture different aspects of parking difficulty and study their effectiveness both alone and in combination. We also evaluate various model architectures for the prediction problem. Finally, we present challenges faced in estimating parking difficulty in different regions of the world, and the approaches we have taken to address them.
Cite
CITATION STYLE
Arora, N., Cook, J., Kumar, R., Kuznetsov, I., Li, Y., Liang, H. J., … Wang, Y. (2019). Hard to park? Estimating parking difficulty at scale. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 2296–2304). Association for Computing Machinery. https://doi.org/10.1145/3292500.3330767
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.