{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T10:28:09Z","timestamp":1725186489836},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T00:00:00Z","timestamp":1281225600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10115-010-0333-9","type":"journal-article","created":{"date-parts":[[2010,8,7]],"date-time":"2010-08-07T08:17:25Z","timestamp":1281169045000},"page":"25-53","source":"Crossref","is-referenced-by-count":13,"title":["Mining fastest path from trajectories with multiple destinations in road networks"],"prefix":"10.1007","volume":"29","author":[{"given":"Eric Hsueh-Chan","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang-Chien","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent S.","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,8]]},"reference":[{"key":"333_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rule between sets of items in large databases. In: Proceedings of ACM SIGMOD conference on management of data, pp 207\u2013216","DOI":"10.1145\/170036.170072"},{"key":"333_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: Proceedings of international conference on data engineering, pp 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"333_CR3","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J ACM 45: 753\u2013782","journal-title":"J ACM"},{"key":"333_CR4","doi-asserted-by":"crossref","unstructured":"Awasthi A, Lechevallier Y, Parent M et\u00a0al (2005) Rule based prediction of fastest paths on urban networks. In: Proceedings of 8th IEEE conference on intelligent transportation systems, pp 978\u2013983","DOI":"10.1109\/ITSC.2005.1520183"},{"issue":"5","key":"333_CR5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.3846\/16483840.2003.10414100","volume":"18","author":"SK Barai","year":"2003","unstructured":"Barai SK (2003) Data mining applications in transportation engineering. Transport 18(5): 216\u2013223","journal-title":"Transport"},{"issue":"1","key":"333_CR6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10479-006-0009-8","volume":"144","author":"S Bekhor","year":"2006","unstructured":"Bekhor S, Ben-Akiva ME, Ramming MS (2006) Evaluation of choice set generation algorithms for route choice models. Ann Oper Res 144(1): 235\u2013247","journal-title":"Ann Oper Res"},{"issue":"3","key":"333_CR7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A Ben-Dor","year":"1999","unstructured":"Ben-Dor A, Yakhini Z (1999) Clustering gene expression patterns. J Comput Biol 6(3): 281\u2013297","journal-title":"J Comput Biol"},{"key":"333_CR8","doi-asserted-by":"crossref","unstructured":"Borges J, Levene M (2000) Data mining of user navigation patterns. Lecture Notes in Computer Science 1836, pp 92\u2013112","DOI":"10.1007\/3-540-44934-5_6"},{"issue":"2","key":"333_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/69.683753","volume":"10","author":"MS Chen","year":"1998","unstructured":"Chen MS, Park JS, Yu PS (1998) Efficient data mining for path traversal patterns. IEEE Trans Knowl Data Eng 10(2): 209\u2013221","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"333_CR10","unstructured":"Cheong CH, Wong MH (2006) Mining popular paths in a transportation database system with privacy protection. In: Proceedings of 22nd international conference on data engineering workshops, p 122"},{"key":"333_CR11","doi-asserted-by":"crossref","unstructured":"Chon HD, Agrawal D, El Abbadi A (2003) FATES: Finding a time dependent shortest path. In: Proceedings of 4th international conference on mobile data management, pp 165\u2013180","DOI":"10.1007\/3-540-36389-0_12"},{"issue":"1","key":"333_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-008-0125-7","volume":"18","author":"AM Denton","year":"2009","unstructured":"Denton AM, Besemann CA, Dorr DH (2009) Pattern-based time-series subsequence clustering using radial distribution functions. Knowl Inf Syst 18(1): 1\u201327","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"333_CR13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connection with graphs. Numer Math 1(1): 269\u2013271","journal-title":"Numer Math"},{"key":"333_CR14","volume-title":"Introduction to GPS: the global positioning system","author":"A El-Rabbany","year":"2006","unstructured":"El-Rabbany A (2006) Introduction to GPS: the global positioning system, 2nd edn. Artech House, Boston","edition":"2"},{"key":"333_CR15","unstructured":"Engineer F (2001) Fast shortest path algorithms for large road networks. In: Proceedings of 36th annual ORSNZ conference"},{"key":"333_CR16","doi-asserted-by":"crossref","unstructured":"Fritzsche PC, Rexachs D, Luque E (2007) A computational approach to TSP performance prediction using data mining. In: Proceedings of 21st international conference on advanced information networking and applications workshops, pp 252\u2013259","DOI":"10.1109\/AINAW.2007.13"},{"key":"333_CR17","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Francisco"},{"key":"333_CR18","unstructured":"Gonzalez H, Han J, Li X et\u00a0al (2007) Adaptive fastest path computation on a road network: a traffic mining approach. In: Proceedings of 33rd international conference on very large data bases, pp 794\u2013805"},{"key":"333_CR19","unstructured":"Google Map, http:\/\/maps.google.com\/"},{"key":"333_CR20","doi-asserted-by":"crossref","unstructured":"Halvey M, Keane T, Smyth B (2005) Predicting navigation patterns on the mobile-internet using time of the week. In: Proceedings of 14th international conference on World Wide Web, pp 958\u2013959","DOI":"10.1145\/1062745.1062817"},{"key":"333_CR21","doi-asserted-by":"crossref","unstructured":"Halvey M, Keane T, Smyth B (2006) Time based patterns in mobile-internet surfing. In: Proceedings of SIGCHI conference on human factors in computing system, pp 31\u201334","DOI":"10.1145\/1124772.1124778"},{"issue":"2","key":"333_CR22","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2): 100\u2013107","journal-title":"IEEE Trans Syst Sci Cybern"},{"key":"333_CR23","unstructured":"Johnson DS, McGeoch LA (1995) The traveling salesman problem: a case study in local optimization. In: Aarts EHL, Lenstra JK Local search in combinatorial optimization. Wiley, New York"},{"key":"333_CR24","doi-asserted-by":"crossref","unstructured":"Jula H, Dessouky M, Ioannou PA (2008) Real-time estimation of travel times along the arcs and arrival times at the nodes of dynamic stochastic networks. IEEE Trans Intell Transp Syst 9(1)","DOI":"10.1109\/TITS.2007.908571"},{"key":"333_CR25","doi-asserted-by":"crossref","unstructured":"Kanoulas E, Du Y, Xia T et\u00a0al (2006) Finding fastest paths on a road network with speed patterns. In: Proceedings of 22nd international conference on data engineering, p 10","DOI":"10.1109\/ICDE.2006.71"},{"key":"333_CR26","unstructured":"Kaohsiung City Real-Time Traffic Information, http:\/\/kctraffic.tbkc.gov.tw\/link01.htm"},{"key":"333_CR27","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"1990","unstructured":"Kaufman L, Rousseeuw PJ (1990) Finding groups in data: an introduction to cluster analysis. Wiley, New York"},{"issue":"3","key":"333_CR28","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10115-008-0132-8","volume":"17","author":"A Khoshgozaran","year":"2008","unstructured":"Khoshgozaran A, Khodaei A, Sharifzadeh M et\u00a0al (2008) A hybrid aggregation and compression technique for road network databases. Knowl Inf Syst 17(3): 265\u2013286","journal-title":"Knowl Inf Syst"},{"key":"333_CR29","doi-asserted-by":"crossref","unstructured":"Lassabe N, Berro A, Duthen Y (2007) Improvement of a shortest routes algorithm. In: Proceedings of 10th IEEE conference on intelligent transportation systems, pp 613\u2013617","DOI":"10.1109\/ITSC.2007.4357802"},{"key":"333_CR30","first-page":"1426","volume":"6","author":"Y Lim","year":"2005","unstructured":"Lim Y, Kim H (2005) A shortest path algorithm for real road network based on path overlap. J East Asia Soc Transp Stud 6: 1426\u20131438","journal-title":"J East Asia Soc Transp Stud"},{"key":"333_CR31","doi-asserted-by":"crossref","unstructured":"Lin J, Keogh E, Lonardi S et\u00a0al (2003) A symbolic representation of time series, with implications for streaming algorithms. In: Proceedings of 8th ACM SIGMOD workshop on research issues in data mining and knowledge discovery, pp 2\u201311","DOI":"10.1145\/882082.882086"},{"issue":"1","key":"333_CR32","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/TITS.2008.915649","volume":"9","author":"JWC Lint van","year":"2008","unstructured":"van Lint JWC (2008) Online learning solutions for freeway travel time prediction. IEEE Trans Intell Transp Syst 9(1): 38\u201347","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"333_CR33","unstructured":"Lo C-H, Peng W-C, Chen C-W et\u00a0al (2008) CarWeb: a traffic data collection platform. In: Proceedings of international conference on mobile data management, pp 221\u2013222"},{"key":"333_CR34","unstructured":"Lu EH-C, Lin CC, Tseng VS (2008) Mining the shortest path within a travel time constraint in road network environments. In: Proceedings of IEEE conference on intelligent transportation systems, pp 593\u2013598"},{"key":"333_CR35","doi-asserted-by":"crossref","unstructured":"Pallottino S, Scutella MG (1998) Shortest path algorithms in transportation models: classical and innovative aspects. In: Equilibrium and advanced transportation modelling, pp 245\u2013281","DOI":"10.1007\/978-1-4615-5757-9_11"},{"issue":"1","key":"333_CR36","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/3468.995530","volume":"32","author":"J Pepper","year":"2002","unstructured":"Pepper J, Golden B, Wasil E (2002) Solving the traveling salesman problem with annealing-based heuristics: a computational study. IEEE Trans Man Cybern Syst A Syst Hum 32(1): 72\u201377","journal-title":"IEEE Trans Man Cybern Syst A Syst Hum"},{"issue":"3","key":"333_CR37","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz DJ, Stearns RE, Lewis PM II (1977) An analysis of several heuristics for the traveling salesman problem. SIAM J Comput 6(3): 563\u2013581","journal-title":"SIAM J Comput"},{"issue":"1","key":"333_CR38","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10115-008-0154-2","volume":"20","author":"C-Y Tsai","year":"2009","unstructured":"Tsai C-Y, Chou S-Y, Lin S-W et\u00a0al (2009) Location determination of mobile devices for an indoor WLAN application using a neural network. Knowl Inf Syst 20(1): 81\u201393","journal-title":"Knowl Inf Syst"},{"key":"333_CR39","unstructured":"Tsai H, Yang J, Kao C (2002) Solving traveling salesman problems by combining global and local search mechanisms. In: Proceedings of congress on evolutionary computation, pp 1290\u20131295"},{"key":"333_CR40","unstructured":"Tseng VS, Chen LJ (2002) An empirical study of the validity of gene expression clustering. In: Proceedings of international conference on mathematics and engineering techniques in medicine and biological sciences"},{"issue":"6","key":"333_CR41","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.infsof.2005.12.014","volume":"48","author":"VS Tseng","year":"2006","unstructured":"Tseng VS, Lin KW (2006) Efficient mining and prediction of user behavior patterns in mobile web systems. Inf Softw Technol 48(6): 357\u2013369","journal-title":"Inf Softw Technol"},{"issue":"4","key":"333_CR42","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TCBB.2005.56","volume":"2","author":"VS Tseng","year":"2005","unstructured":"Tseng VS, Kao C (2005) Efficiently mining gene expression data via a novel parameterless clustering method. IEEE\/ACM Trans Comput Biol Bioinform 2(4): 355\u2013365","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"333_CR43","doi-asserted-by":"crossref","unstructured":"Ye Y, Zheng Y, Chen Y et\u00a0al (2009) Mining individual life pattern based on location history. In: Proceedings of international conference on mobile data management systems, services and middleware, pp 1\u201310","DOI":"10.1109\/MDM.2009.11"},{"key":"333_CR44","doi-asserted-by":"crossref","unstructured":"Zheng Y, Zhang L, Xie X et\u00a0al (2009) Mining interesting location and travel sequences from GPS trajectories. In: Proceedings of 18th international World Wide Web conference pp 791\u2013800","DOI":"10.1145\/1526709.1526816"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0333-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-010-0333-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0333-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T12:14:10Z","timestamp":1559391250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-010-0333-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,8]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["333"],"URL":"https:\/\/doi.org\/10.1007\/s10115-010-0333-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,8]]}}}