{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:38:27Z","timestamp":1757540307225},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208409"},{"type":"electronic","value":"9783642208416"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20841-6_31","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T08:12:54Z","timestamp":1306483974000},"page":"375-386","source":"Crossref","is-referenced-by-count":6,"title":["Efficiently Retrieving Longest Common Route Patterns of Moving Objects By Summarizing Turning Regions"],"prefix":"10.1007","author":[{"given":"Guangyan","family":"Huang","sequence":"first","affiliation":[]},{"given":"Yanchun","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jing","family":"He","sequence":"additional","affiliation":[]},{"given":"Zhiming","family":"Ding","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10707-007-0042-z","volume":"13","author":"G. Gidofalvi","year":"2009","unstructured":"Gidofalvi, G., Pedersen, T.B.: Mining Long, Sharable Patterns in Trajectories of Moving Objects. GeoInformatica\u00a013(1), 27\u201355 (2009)","journal-title":"GeoInformatica"},{"key":"31_CR2","unstructured":"Cao, H., Mamoulis, N., Cheung, D.W.: Mining frequent spatio-temporal sequential patterns. In: ICDM 2005, pp. 82\u201389 (2005)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Jeung, H., Yiu, M.L., Zhou, X., Jensen, C.S., Shen, H.: Discovery of convoys in trajectory databases. In: VLDB, pp. 1068\u20131080 (2008)","DOI":"10.14778\/1453856.1453971"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10707-006-0002-z","volume":"11","author":"J. Gudmundsson","year":"2007","unstructured":"Gudmundsson, J., Kreveld, M.V., Speckmann, B.: Efficient detection of patterns in 2D trajectories of moving points. Geoinformatica\u00a011, 195\u2013215 (2007)","journal-title":"Geoinformatica"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Giannotti, F., Nanni, M., Pedreschi, D., Pinelli, F.: Trajectory pattern mining. In: SIGKDD 2007, pp. 330\u2013339 (2007)","DOI":"10.1145\/1281192.1281230"},{"issue":"2","key":"31_CR6","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"D.H. Douglas","year":"1973","unstructured":"Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer\u00a010(2), 112\u2013122 (1973)","journal-title":"The Canadian Cartographer"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1559\/152304085783914703","volume":"12","author":"E.R. White","year":"1985","unstructured":"White, E.R.: Assessment of line generalization algorithms using characteristic points. The American Cartographer\u00a012, 17\u201327 (1985)","journal-title":"The American Cartographer"},{"key":"31_CR8","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: SIGKDD 1996, pp. 226\u2013231 (1996)"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"He, J., Huang, G., Zhang, Y., Shi, Y.: Cluster analysis and optimization in color-based clustering for image abstract. In: ICDM Workshops, pp. 213\u2013218 (2007)","DOI":"10.1109\/ICDMW.2007.41"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: HA space-economical suffix tree construction algorithmH. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"31_CR11","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"G. Dan","year":"1997","unstructured":"Dan, G.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, USA (1997)"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Lee, J.-G., Han, J., Whang, K.-Y.: Trajectory clustering: a partition-and-group framework. In: SIGMOD 2007, pp. 593\u2013604 (2007)","DOI":"10.1145\/1247480.1247546"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T.: A framework for generating network-based moving objects. GeoInformatica 6(2) (2002)","DOI":"10.1023\/A:1015231126594"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20841-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T03:27:15Z","timestamp":1560223635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20841-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208409","9783642208416"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20841-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}