{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:09:55Z","timestamp":1775912995846,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T00:00:00Z","timestamp":1521590400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T00:00:00Z","timestamp":1521590400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61232006"],"award-info":[{"award-number":["61232006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502324"],"award-info":[{"award-number":["61502324"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["LP130100164"],"award-info":[{"award-number":["LP130100164"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP170101172"],"award-info":[{"award-number":["DP170101172"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61532018"],"award-info":[{"award-number":["61532018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s00778-018-0499-4","type":"journal-article","created":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T13:06:47Z","timestamp":1521637607000},"page":"321-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":58,"title":["Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1386-767X","authenticated-orcid":false,"given":"Lei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sibo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Hua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"issue":"1","key":"499_CR1","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. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"499_CR2","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 156\u2013165. Society for Industrial and Applied Mathematics (2005)"},{"issue":"5","key":"499_CR3","doi-asserted-by":"publisher","first-page":"406","DOI":"10.14778\/2140436.2140438","volume":"5","author":"L Wu","year":"2012","unstructured":"Wu, L., Xiao, X., Deng, D., Cong, G., Zhu, A.D., Zhou, S.: Shortest path and distance queries on road networks: an experimental evaluation. Proc. VLDB Endow. 5(5), 406\u2013417 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"499_CR4","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 the 22nd International Conference on Data Engineering, ICDE\u201906, p. 10. IEEE (2006)","DOI":"10.1109\/ICDE.2006.71"},{"key":"499_CR5","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology, pp. 205\u2013216. ACM (2008)","DOI":"10.1145\/1353343.1353371"},{"key":"499_CR6","doi-asserted-by":"publisher","first-page":"170","DOI":"10.3141\/1645-21","volume":"1645","author":"I Chabini","year":"1998","unstructured":"Chabini, I.: Discrete dynamic shortest path problems in transportation applications: complexity and algorithms with optimal run time. Transp. Res. Rec. J. Transp. Res. Board 1645, 170\u2013175 (1998)","journal-title":"Transp. Res. Rec. J. Transp. Res. Board"},{"issue":"3","key":"499_CR7","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A Orda","year":"1990","unstructured":"Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM (JACM) 37(3), 607\u2013625 (1990)","journal-title":"J. ACM (JACM)"},{"key":"499_CR8","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-22922-0_7","volume-title":"Advances in spatial and temporal databases","author":"U Demiryurek","year":"2011","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C., Ranganathan, A.: Online computation of fastest path in time-dependent spatial networks. In: Pfoser, D., et al. (eds.) Advances in spatial and temporal databases, pp. 92\u2013111. Springer, Berlin (2011)"},{"issue":"3","key":"499_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<141::AID-NET2>3.0.CO;2-H","volume":"29","author":"X Cai","year":"1997","unstructured":"Cai, X., Kloks, T., Wong, C.: Time-varying shortest path problems with constraints. Networks 29(3), 141\u2013150 (1997)","journal-title":"Networks"},{"issue":"3","key":"499_CR10","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"SE Dreyfus","year":"1969","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 395\u2013412 (1969)","journal-title":"Oper. Res."},{"key":"499_CR11","doi-asserted-by":"crossref","unstructured":"Demiryurek, U., Pan, B., Banaei-Kashani, F., Shahabi, C.: Towards modeling the traffic data on road networks. In: Proceedings of the Second International Workshop on Computational Transportation Science, pp. 13\u201318. ACM (2009)","DOI":"10.1145\/1645373.1645376"},{"key":"499_CR12","doi-asserted-by":"publisher","first-page":"1846","DOI":"10.1109\/TKDE.2017.2703848","volume":"29","author":"B Zheng","year":"2017","unstructured":"Zheng, B., Su, H., Hua, W., Zheng, K., Zhou, X., Li, G.: Efficient clue-based route search on road networks. IEEE Trans. Knowl. Data Eng. 29, 1846 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"499_CR13","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.14778\/3137628.3137638","volume":"10","author":"L Li","year":"2017","unstructured":"Li, L., Hua, W., Du, X., Zhou, X.: Minimal on-road time route scheduling on time-dependent graphs. Proc. VLDB Endow. 10(11), 1274\u20131285 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"499_CR14","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"KL Cooke","year":"1966","unstructured":"Cooke, 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":"499_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-13193-6_7","volume-title":"Experimental algorithms","author":"R Geisberger","year":"2010","unstructured":"Geisberger, R.: Contraction of timetable networks with realistic transfers. In: Festa, P. (ed.) Experimental algorithms, pp. 71\u201382. Springer, Berlin (2010)"},{"issue":"9","key":"499_CR16","doi-asserted-by":"publisher","first-page":"721","DOI":"10.14778\/2732939.2732945","volume":"7","author":"H Wu","year":"2014","unstructured":"Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. Proc. VLDB Endow. 7(9), 721\u2013732 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"499_CR17","doi-asserted-by":"crossref","unstructured":"Wang, S., Lin, W., Yang, Y., Xiao, X., Zhou, S.: Efficient route planning on public transportation networks: a labelling approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 967\u2013982. ACM (2015)","DOI":"10.1145\/2723372.2749456"},{"issue":"3","key":"499_CR18","first-page":"117","volume":"21","author":"J Halpern","year":"1977","unstructured":"Halpern, J.: Shortest route with time dependent length of edges and limited delay possibilities in nodes. Z. Oper. Res. 21(3), 117\u2013124 (1977)","journal-title":"Z. Oper. Res."},{"issue":"3","key":"499_CR19","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230210304","volume":"21","author":"A Orda","year":"1991","unstructured":"Orda, A., Rom, R.: Minimum weight paths in time-dependent networks. Networks 21(3), 295\u2013319 (1991)","journal-title":"Networks"},{"issue":"4","key":"499_CR20","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s00453-012-9714-7","volume":"68","author":"L Foschini","year":"2014","unstructured":"Foschini, L., Hershberger, J., Suri, S.: On the complexity of time-dependent shortest paths. Algorithmica 68(4), 1075\u20131097 (2014)","journal-title":"Algorithmica"},{"key":"499_CR21","doi-asserted-by":"crossref","unstructured":"Cai, X., Kloks, T., Wong, C.: Shortest path problems with time constraints. In: International Symposium on Mathematical Foundations of Computer Science, pp. 255\u2013266. Springer (1996)","DOI":"10.1007\/3-540-61550-4_153"},{"key":"499_CR22","doi-asserted-by":"crossref","unstructured":"Batz, G.V., Delling, D., Sanders, P., Vetter, C.: Time-dependent contraction hierarchies. In: Proceedings of the Meeting on Algorithm Engineering and Experiments, pp. 97\u2013105. Society for Industrial and Applied Mathematics (2009)","DOI":"10.1137\/1.9781611972894.10"},{"issue":"1","key":"499_CR23","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s00453-009-9341-0","volume":"60","author":"D Delling","year":"2011","unstructured":"Delling, D.: Time-dependent sharc-routing. Algorithmica 60(1), 60\u201394 (2011)","journal-title":"Algorithmica"},{"key":"499_CR24","doi-asserted-by":"crossref","unstructured":"Li, L., Zhou, X., Zheng, K.: Finding least on-road travel time on road network. In: Australasian Database Conference, pp. 137\u2013149. Springer (2016)","DOI":"10.1007\/978-3-319-46922-5_11"},{"issue":"9","key":"499_CR25","doi-asserted-by":"publisher","first-page":"673","DOI":"10.14778\/2732939.2732941","volume":"7","author":"Y Yang","year":"2014","unstructured":"Yang, Y., Gao, H., Yu, J.X., Li, J.: Finding the cost-optimal path with time constraint over time-dependent graphs. Proc. VLDB Endow. 7(9), 673\u2013684 (2014)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"499_CR26","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s11067-013-9221-7","volume":"16","author":"JD Adler","year":"2016","unstructured":"Adler, J.D., Mirchandani, P.B., Xue, G., Xia, M.: The electric vehicle shortest-walk problem with battery exchanges. Netw. Spat. Econ. 16(1), 155\u2013173 (2016)","journal-title":"Netw. Spat. Econ."},{"issue":"3","key":"499_CR27","doi-asserted-by":"publisher","first-page":"277","DOI":"10.15807\/jorsj.24.277","volume":"24","author":"T Ichimori","year":"1981","unstructured":"Ichimori, T., Ishii, H., Nishida, T.: Routing a vehicle with the limitation of fuel. J. Oper. Res. Soc. Jpn. 24(3), 277\u2013281 (1981)","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"2","key":"499_CR28","first-page":"63","volume":"2","author":"Y Xiao","year":"2005","unstructured":"Xiao, Y., Thulasiraman, K., Xue, G., J\u00fcttner, A.: The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization. AKCE Int. J. Graphs Comb. 2(2), 63\u201386 (2005)","journal-title":"AKCE Int. J. Graphs Comb."},{"issue":"2","key":"499_CR29","doi-asserted-by":"publisher","first-page":"61","DOI":"10.14778\/3015274.3015277","volume":"10","author":"S Wang","year":"2016","unstructured":"Wang, S., Xiao, X., Yang, Y., Lin, W.: Effective indexing for approximate constrained shortest path queries on large road networks. Proc. VLDB Endow. 10(2), 61\u201372 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"499_CR30","first-page":"157","volume":"14","author":"D Blokh","year":"1996","unstructured":"Blokh, D., Gutin, G.: An approximate algorithm for combinatorial optimization problems with two parameters. Australas. J. Comb. 14, 157\u2013164 (1996)","journal-title":"Australas. J. Comb."},{"key":"499_CR31","doi-asserted-by":"crossref","unstructured":"Juttner, A., Szviatovski, B., M\u00e9cs, I., Rajk\u00f3, Z.: Lagrange relaxation based method for the QoS routing problem. In: Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2001, vol. 2, pp. 859\u2013868. IEEE (2001)","DOI":"10.1109\/INFCOM.2001.916277"},{"issue":"11","key":"499_CR32","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.14778\/3137628.3137643","volume":"10","author":"Y Tong","year":"2017","unstructured":"Tong, Y., Wang, L., Zhou, Z., Ding, B., Chen, L., Ye, J., Xu, K.: Flexible online task assignment in real-time spatial data. Proc. VLDB Endow. 10(11), 1334\u20131345 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"499_CR33","doi-asserted-by":"crossref","unstructured":"Tong, Y., Chen, Y., Zhou, Z., Chen, L., Wang, J., Yang, Q., Ye, J., Lv, W.: The simpler the better: a unified approach to predicting original taxi demands based on large-scale online platforms. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1653\u20131662. ACM (2017)","DOI":"10.1145\/3097983.3098018"},{"issue":"3","key":"499_CR34","first-page":"85","volume":"10","author":"J Dai","year":"2016","unstructured":"Dai, J., Yang, B., Guo, C., Jensen, C.S., Hu, J.: Path cost distribution estimation using trajectory data. PVLDB 10(3), 85\u201396 (2016)","journal-title":"PVLDB"},{"key":"499_CR35","doi-asserted-by":"crossref","unstructured":"Bakalov, P., Hoel, E., Heng, W.-L.: Time dependent transportation network models. In: 2015 IEEE 31st International Conference on Data Engineering (ICDE), pp. 1364\u20131375. IEEE (2015)","DOI":"10.1109\/ICDE.2015.7113383"},{"issue":"9","key":"499_CR36","doi-asserted-by":"publisher","first-page":"769","DOI":"10.14778\/2536360.2536375","volume":"6","author":"B Yang","year":"2013","unstructured":"Yang, B., Guo, C., Jensen, C.S.: Travel cost inference from sparse, spatio temporally correlated time series using Markov models. Proc. VLDB Endow. 6(9), 769\u2013780 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"499_CR37","doi-asserted-by":"crossref","unstructured":"Shang, J., Zheng, Y., Tong, W., Chang, E., Yu, Y.: Inferring gas consumption and pollution emission of vehicles throughout a city. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1027\u20131036. ACM (2014)","DOI":"10.1145\/2623330.2623653"},{"key":"499_CR38","doi-asserted-by":"crossref","unstructured":"Xin, X., Lu, C., Wang, Y., Huang, H.: Forecasting collector road speeds under high percentage of missing data. In: AAAI, pp. 1917\u20131923 (2015)","DOI":"10.1609\/aaai.v29i1.9447"},{"key":"499_CR39","doi-asserted-by":"crossref","unstructured":"Asif, M.T., Mitrovic, N., Garg, L., Dauwels, J., Jaillet, P.: Low-dimensional models for missing data imputation in road networks. In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3527\u20133531. IEEE (2013)","DOI":"10.1109\/ICASSP.2013.6638314"},{"key":"499_CR40","doi-asserted-by":"crossref","unstructured":"Shan, Z., Zhao, D., Xia, Y.: Urban road traffic speed estimation for missing probe vehicle data based on multiple linear regression model. In: 16th International IEEE Conference on Intelligent Transportation Systems-(ITSC), pp. 118\u2013123. IEEE (2013)","DOI":"10.1109\/ITSC.2013.6728220"},{"key":"499_CR41","doi-asserted-by":"crossref","unstructured":"Widhalm, P., Piff, M., Br\u00e4ndle, N., Koller, H., Reinthaler, M.: Robust road link speed estimates for sparse or missing probe vehicle data. In: 15th International IEEE Conference on Intelligent Transportation Systems (ITSC), pp. 1693\u20131697. IEEE (2012)","DOI":"10.1109\/ITSC.2012.6338906"},{"issue":"3","key":"499_CR42","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/2694428.2694432","volume":"43","author":"C Guo","year":"2014","unstructured":"Guo, C., Jensen, C.S., Yang, B.: Towards total traffic awareness. SIGMOD Rec. 43(3), 18\u201323 (2014)","journal-title":"SIGMOD Rec."},{"issue":"3","key":"499_CR43","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s10707-014-0221-7","volume":"19","author":"C Guo","year":"2015","unstructured":"Guo, C., Yang, B., Andersen, O., Jensen, C.S., Torp, K.: Ecomark 2.0: empowering eco-routing with vehicular environmental models and actual vehicle fuel consumption data. GeoInformatica 19(3), 567\u2013599 (2015)","journal-title":"GeoInformatica"},{"key":"499_CR44","doi-asserted-by":"crossref","unstructured":"Id\u00e9, T., Sugiyama, M.: Trajectory regression on road networks. In: AAAI (2011)","DOI":"10.1609\/aaai.v25i1.7855"},{"key":"499_CR45","doi-asserted-by":"crossref","unstructured":"Zheng, J., Ni, L.M.: Time-dependent trajectory regression on road networks via multi-task learning. In: AAAI (2013)","DOI":"10.1609\/aaai.v27i1.8577"},{"issue":"5","key":"499_CR46","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1109\/TKDE.2013.89","volume":"26","author":"B Yang","year":"2014","unstructured":"Yang, B., Kaul, M., Jensen, C.S.: Using incomplete information for complete weight annotation of road networks. IEEE Trans. Knowl. Data Eng. 26(5), 1267\u20131279 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"499_CR47","doi-asserted-by":"crossref","unstructured":"Zhang, J., Zheng, Y., Qi, D.: Deep spatio-temporal residual networks for citywide crowd flows prediction. In: AAAI, pp. 1655\u20131661 (2017)","DOI":"10.1609\/aaai.v31i1.10735"},{"issue":"3","key":"499_CR48","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM (JACM) 34(3), 596\u2013615 (1987)","journal-title":"J. ACM (JACM)"},{"key":"499_CR49","doi-asserted-by":"crossref","unstructured":"Lou, Y., Zhang, C., Zheng, Y., Xie, X., Wang, W., Huang, Y.: Map-matching for low-sampling-rate GPS trajectories. In: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 352\u2013361. ACM (2009)","DOI":"10.1145\/1653771.1653820"},{"key":"499_CR50","doi-asserted-by":"crossref","unstructured":"Yuan, J., Zheng, Y., Zhang, C., Xie, X., Sun, G.-Z.: An interactive-voting based map matching algorithm. In: Proceedings of the 2010 Eleventh International Conference on Mobile Data Management, pp. 43\u201352. IEEE Computer Society (2010)","DOI":"10.1109\/MDM.2010.14"},{"issue":"5","key":"499_CR51","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.trc.2007.05.002","volume":"15","author":"MA Quddus","year":"2007","unstructured":"Quddus, M.A., Ochieng, W.Y., Noland, R.B.: Current map-matching algorithms for transport applications: state-of-the art and future research directions. Transp. Res. Part C Emerg. Technol. 15(5), 312\u2013328 (2007)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"499_CR52","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1111\/j.2517-6161.1958.tb00292.x","volume":"1","author":"DR Cox","year":"1958","unstructured":"Cox, D.R.: The regression analysis of binary sequences. J. R. Stat. Soc. Ser. B (Methodol.) 1, 215\u2013242 (1958)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"499_CR53","volume-title":"The Historical Development of the Gauss Linear Model","author":"HL Seal","year":"1968","unstructured":"Seal, H.L.: The Historical Development of the Gauss Linear Model. Yale University, New Haven (1968)"},{"key":"499_CR54","doi-asserted-by":"crossref","unstructured":"Shatkay, H., Zdonik, S.B.: Approximate queries and representations for large data sequences. In: Proceedings of the Twelfth International Conference on Data Engineering, pp. 536\u2013545. IEEE (1996)","DOI":"10.1109\/ICDE.1996.492204"},{"key":"499_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/9789812565402_0001","volume":"57","author":"E Keogh","year":"2004","unstructured":"Keogh, E., Chu, S., Hart, D., Pazzani, M.: Segmenting time series: a survey and novel approach. Data Min. Time Ser. Databases 57, 1\u201322 (2004)","journal-title":"Data Min. Time Ser. Databases"},{"issue":"1","key":"499_CR56","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/2379776.2379788","volume":"45","author":"P Esling","year":"2012","unstructured":"Esling, P., Agon, C.: Time-series data mining. ACM Comput. Surv. (CSUR) 45(1), 12 (2012)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"499_CR57","doi-asserted-by":"crossref","unstructured":"Li, C.-S., Yu, P.S., Castelli, V.: Malm: A framework for mining sequence database at multiple abstraction levels. In: Proceedings of the Seventh International Conference on Information and Knowledge Management, pp. 267\u2013272. ACM (1998)","DOI":"10.1145\/288627.288666"},{"key":"499_CR58","first-page":"239","volume":"98","author":"E\u00a0J Keogh","year":"1998","unstructured":"Keogh, E\u00a0.J., Pazzani, M\u00a0.J.: An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback. KDD 98, 239\u2013243 (1998)","journal-title":"KDD"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-018-0499-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-018-0499-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-018-0499-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T22:22:44Z","timestamp":1751494964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-018-0499-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,21]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["499"],"URL":"https:\/\/doi.org\/10.1007\/s00778-018-0499-4","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,21]]},"assertion":[{"value":"15 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}