{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T21:40:02Z","timestamp":1748382002132,"version":"3.41.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319180311"},{"type":"electronic","value":"9783319180328"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18032-8_29","type":"book-chapter","created":{"date-parts":[[2015,5,8]],"date-time":"2015-05-08T05:41:54Z","timestamp":1431063714000},"page":"370-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Recommending Profitable Taxi Travel Routes Based on Big Taxi Trajectories Data"],"prefix":"10.1007","author":[{"given":"Wenxin","family":"Yang","sequence":"first","affiliation":[]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Seyyed Mohammadreza","family":"Rahimi","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,9]]},"reference":[{"key":"29_CR1","unstructured":"Schaller Consulting: The New York City Taxicab Fact Book, Schaller Consulting, Brooklyn, NY (2006). http:\/\/www.schallerconsult.com\/taxi\/taxifb.pdf"},{"key":"29_CR2","unstructured":"Hunter, T., Herring, R., Abbeel, P., Bayen, A.: Path and travel time inference from GPS probe vehicle data. In: Proc. Neural Information Processing Systems (NIPS). New York, USA, pp. 316\u2013324 (2009)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Ge, Y., Xiong, H., Alexander, T., Xiao, K., Marco, G., Michael, P.: An energy-efficient mobile recommender system. In: Proc. Knowledge Discovery and Data Mining, KDD 2010. Washington, DC, pp. 899\u2013908 (2010)","DOI":"10.1145\/1835804.1835918"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Yamamoto, K., Uesugi, K., Watanabe, Y.: Adaptive routing of cruising taxis by mutual exchange of pathways. In: Proc. Knowledge-Based Intelligent Information and Engineering Systems. Zagreb, Croatia, pp. 559\u2013566 (2008)","DOI":"10.1007\/978-3-540-85565-1_69"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Powell, J.W., Huang, Y., Bastani, F., Ji, M,: Towards reducing taxi time using spatio-temporal profitability maps. In: Proc. Advances in Spatial and Temporal Databases. Minneapolis, MN, USA, pp. 242\u2013260 (2011)","DOI":"10.1007\/978-3-642-22922-0_15"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Yuan, J., Zhen, Y., Zhang, L., Xie, X., Sun, G.: Where to find my next passenger? In: Proc. Ubiquitous Computing. Beijing, China, pp. 109\u2013118 (2011)","DOI":"10.1145\/2030112.2030128"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Ma, S., Zheng, Y., Wolfson, O.: T-share: A large-scale dynamic taxi ridesharing service. In: Proc. Data Engineering Brisbane, Australia, pp. 410\u2013421 (2013)","DOI":"10.1109\/ICDE.2013.6544843"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Long, C., Wong, R.C.W., Jagadish, H.V.: Direction-preserving trajectory simplification. In: Proc. the VLDB Endowment, pp. 949\u2013960 (2013)","DOI":"10.14778\/2536206.2536221"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Zhang, D., He, Y.: pCruise: reducing cruising miles for taxicab networks. In: Proc. Real-Time Systems Symposium. San Juan, PR, USA, pp. 85\u201394 (2012)","DOI":"10.1109\/RTSS.2012.61"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. In: Communications of the ACM, pp. 509\u2013517 (1975)","DOI":"10.1145\/361002.361007"},{"key":"29_CR11","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. Management of Data, pp. 47\u201357 (1984). Agrawal, D., Bernstein, P., Bertino, E.: Challenges and opportunities with big data (2012). http:\/\/www.cra.org\/ccc\/files\/docs\/init\/bigdatawhitepaper.pdf"},{"key":"29_CR12","unstructured":"Omohundro, S.M.: Five balltree construction algorithms. In: ICSI Technical Report (1989)"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proc. Management of Data, San Jose, CA, pp. 71\u201379 (1995)","DOI":"10.1145\/568271.223794"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18032-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T21:16:07Z","timestamp":1748380567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18032-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180311","9783319180328"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18032-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}