{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:24:55Z","timestamp":1743053095241,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319320489"},{"type":"electronic","value":"9783319320496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32049-6_25","type":"book-chapter","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T08:47:36Z","timestamp":1458809256000},"page":"403-418","source":"Crossref","is-referenced-by-count":13,"title":["Popular Route Planning with Travel Cost Estimation"],"prefix":"10.1007","author":[{"given":"Huiping","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheqing","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on A road network with speed patterns. In: Proceedings of ICDE (2006)","DOI":"10.1109\/ICDE.2006.71"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: Proceedings of EDBT, pp. 205\u2013216 (2008)","DOI":"10.1145\/1353343.1353371"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., Huang, Y.: T-drive: driving directions based on taxi trajectories. In: Proceedings of SIGSPATIAL (2010)","DOI":"10.1145\/1869790.1869807"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Yuan, J., Zheng, Y., Xie, X., Sun, G.: Driving with knowledge from the physical world. In: Proceedings of KDD (2011)","DOI":"10.1145\/2020408.2020462"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Wang, Y., Zheng, Y., Xue, Y.: Travel time estimation of a path using sparse trajectories. In Proceedings of KDD (2014)","DOI":"10.1145\/2623330.2623656"},{"key":"25_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1114.001.0001","volume-title":"Advances in Minimum Description Length: Theory and Applications","author":"PD Gr\u00fcnwald","year":"2005","unstructured":"Gr\u00fcnwald, P.D., Myung, I.J., Pitt, M.A.: Advances in Minimum Description Length: Theory and Applications. MIT Press, Cambridge (2005)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Zheng, K., Zheng, Y., Xie, X., Zhou, X.: Reducing uncertainty of low-sampling-rate trajectories. In: Proceedings of ICDE (2012)","DOI":"10.1109\/ICDE.2012.42"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Wei, L.-Y., Zheng, Y., Peng, W.-C.: Constructing popular routes from uncertain trajectories. In: Proceedings of KDD (2012)","DOI":"10.1145\/2339530.2339562"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Z., Shen, H.T., Zhou, X.: Discovering popular routes from trajectories. In: Proceedings of ICDE (2011)","DOI":"10.1109\/ICDE.2011.5767890"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Luo, W., Tan, H., Chen, L., Ni, L.M.: Finding time period-based most frequent path in big trajectory data. In: Proceedings of SIGMOD (2013)","DOI":"10.1145\/2463676.2465287"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische mathematik 1(1), 269\u2013271 (1959)","journal-title":"Numerische mathematik"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"KL Kenneth","year":"1966","unstructured":"Kenneth, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. J. Math. Anal. Appl. 14(3), 493\u2013498 (1966)","journal-title":"J. Math. Anal. Appl."},{"key":"25_CR14","unstructured":"Gonzalez, H., Han, J., Li, X., Myslinska, M., Sondag, J.P.: Adaptive fastest path computation on a road network: a traffic mining approach. In: Proceedings of VLDB (2007)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Yang, B., Guo, C., Jensen, C.S., Kaul, M., Shang, S.: Stochastic skyline route planning under time-varying uncertainty. In: Proceedings of ICDE (2014)","DOI":"10.1109\/ICDE.2014.6816646"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Mao, J., Song, Q., Jin, C., Zhang, Z., Zhou, A.: Tscluwin: trajectory stream clustering over sliding window. In: Proceedings of DASFAA (2016)","DOI":"10.1007\/978-3-319-32049-6_9"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Duan, X., Jin, C., Wang, X., Zhou, A., Yue, K.: Real-time personalized taxi-sharing. In: Proceedings of the DASFAA (2016)","DOI":"10.1007\/978-3-319-32049-6_28"},{"key":"25_CR18","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of KDD (1996)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Ranu, S., Deepak, P., Aditya, D. Telang, A., Deshpande, P., Raghavan, S.: Indexing and matching trajectories under inconsistent sampling rates. In: Proceedings of ICDE (2015)","DOI":"10.1109\/ICDE.2015.7113351"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Lee, J.-G., Han, J., Whang, K.-Y.: Trajectory clustering: a partition-and-group framework. In: Proceedings of SIGMOD (2007)","DOI":"10.1145\/1247480.1247546"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Balan, R.K., Nguyen, K.X., Jiang, L.: Real-time trip information service for a large taxi fleet. In: Proceedings of MobiSys (2011)","DOI":"10.1145\/1999995.2000006"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32049-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:52:27Z","timestamp":1559411547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32049-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319320489","9783319320496"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32049-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}