{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T18:31:13Z","timestamp":1771525873563,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the National Science Foundation","award":["No. IIS-1717084"],"award-info":[{"award-number":["No. IIS-1717084"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,14]]},"DOI":"10.1145\/3447548.3467406","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T06:12:03Z","timestamp":1628748723000},"page":"393-403","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["ProgRPGAN"],"prefix":"10.1145","author":[{"given":"Tao-yang","family":"Fu","sequence":"first","affiliation":[{"name":"Pennsylvania State University, University Park, PA, USA"}]},{"given":"Wang-Chien","family":"Lee","sequence":"additional","affiliation":[{"name":"Pennsylvania State University, University Park, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2004. OpenStreetMap. https:\/\/www.openstreetmap.org\/.  2004. OpenStreetMap. https:\/\/www.openstreetmap.org\/."},{"key":"e_1_3_2_2_2_1","unstructured":"2015. Taxi Service Trajectory (TST) Prediction Challenge. http:\/\/www.geolink. pt\/ecmlpkdd2015-challenge\/.  2015. Taxi Service Trajectory (TST) Prediction Challenge. http:\/\/www.geolink. pt\/ecmlpkdd2015-challenge\/."},{"key":"e_1_3_2_2_3_1","unstructured":"2016. Taxi Travel Time Prediction Challenge. http:\/\/www.dcjingsai.com.  2016. Taxi Travel Time Prediction Challenge. http:\/\/www.dcjingsai.com."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2013.20"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983672"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767890"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113313"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2006.10.001"},{"key":"e_1_3_2_2_9_1","volume-title":"Proceedings of the ACM Conference on Information and Knowledge Management.","author":"Lee Wang-Chien","unstructured":"Tao-yang Fu, Wang-Chien Lee , and Zhen Lei . [n.d.]. Hin2vec : Explore metapaths in heterogeneous information networks for representation learning . In Proceedings of the ACM Conference on Information and Knowledge Management. Tao-yang Fu, Wang-Chien Lee, and Zhen Lei. [n.d.]. Hin2vec: Explore metapaths in heterogeneous information networks for representation learning. In Proceedings of the ACM Conference on Information and Knowledge Management."},{"key":"e_1_3_2_2_10_1","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems. 2672--2680","author":"Goodfellow Ian","year":"2014","unstructured":"Ian Goodfellow , Jean Pouget-Abadie , Mehdi Mirza , Bing Xu , David Warde-Farley , Sherjil Ozair , Aaron Courville , and Yoshua Bengio . 2014 . Generative adversarial nets . In Proceedings of the Annual Conference on Neural Information Processing Systems. 2672--2680 . Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. 2014. Generative adversarial nets. In Proceedings of the Annual Conference on Neural Information Processing Systems. 2672--2680."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00100"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.71"},{"key":"e_1_3_2_2_13_1","volume-title":"Progressive growing of gans for improved quality, stability, and variation. CoRR abs\/1710.10196","author":"Karras Tero","year":"2017","unstructured":"Tero Karras , Timo Aila , Samuli Laine , and Jaakko Lehtinen . 2017. Progressive growing of gans for improved quality, stability, and variation. CoRR abs\/1710.10196 ( 2017 ). Tero Karras, Timo Aila, Samuli Laine, and Jaakko Lehtinen. 2017. Progressive growing of gans for improved quality, stability, and variation. CoRR abs\/1710.10196 (2017)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.02.012"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447845"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.9971"},{"key":"e_1_3_2_2_17_1","volume-title":"Proceedings of the ACM International Conference on Management of Data. ACM, 713--724","author":"Luo Wuman","year":"2013","unstructured":"Wuman Luo , Haoyu Tan , Lei Chen , and Lionel M Ni . 2013 . Finding time periodbased most frequent path in big trajectory data . In Proceedings of the ACM International Conference on Management of Data. ACM, 713--724 . Wuman Luo, Haoyu Tan, Lei Chen, and Lionel M Ni. 2013. Finding time periodbased most frequent path in big trajectory data. In Proceedings of the ACM International Conference on Management of Data. ACM, 713--724."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.318"},{"key":"e_1_3_2_2_19_1","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems.","author":"Mikolov Tomas","unstructured":"Tomas Mikolov , Ilya Sutskever , Kai Chen , Greg S Corrado , and Jeff Dean . [n.d.]. Distributed representations of words and phrases and their compositionality . In Proceedings of the Annual Conference on Neural Information Processing Systems. Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Corrado, and Jeff Dean. [n.d.]. Distributed representations of words and phrases and their compositionality. In Proceedings of the Annual Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653818"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Michael Pinedo. 2012. Scheduling. Vol. 5. Springer.  Michael Pinedo. 2012. Scheduling. Vol. 5. Springer.","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3004725.3004728"},{"key":"e_1_3_2_2_24_1","unstructured":"Richard S Sutton David A McAllester Satinder P Singh and Yishay Mansour. 2000. Policy gradient methods for reinforcement learning with function approximation. In Advances in neural information processing systems. 1057--1063.  Richard S Sutton David A McAllester Satinder P Singh and Yishay Mansour. 2000. Policy gradient methods for reinforcement learning with function approximation. In Advances in neural information processing systems. 1057--1063."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330824"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339562"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/430"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0491-4"},{"key":"e_1_3_2_2_29_1","volume-title":"Travel cost inference from sparse, spatio temporally correlated time series using Markov models. the VLDB Endowment 6, 9","author":"Yang Bin","year":"2013","unstructured":"Bin Yang , Chenjuan Guo , and Christian S Jensen . 2013. Travel cost inference from sparse, spatio temporally correlated time series using Markov models. the VLDB Endowment 6, 9 ( 2013 ), 769--780. Bin Yang, Chenjuan Guo, and Christian S Jensen. 2013. Travel cost inference from sparse, spatio temporally correlated time series using Markov models. the VLDB Endowment 6, 9 (2013), 769--780."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10804"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869790.1869807"},{"key":"e_1_3_2_2_32_1","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems. 1543--1551","author":"Zheng Stephan","year":"2016","unstructured":"Stephan Zheng , Yisong Yue , and Jennifer Hobbs . 2016 . Generating long-term trajectories using deep hierarchical networks . In Proceedings of the Annual Conference on Neural Information Processing Systems. 1543--1551 . Stephan Zheng, Yisong Yue, and Jennifer Hobbs. 2016. Generating long-term trajectories using deep hierarchical networks. In Proceedings of the Annual Conference on Neural Information Processing Systems. 1543--1551."}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467406","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467406","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:36Z","timestamp":1750191516000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467406"}},"subtitle":["Progressive GAN for Route Planning"],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":32,"alternative-id":["10.1145\/3447548.3467406","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467406","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}