{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T21:53:45Z","timestamp":1679090025425},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T00:00:00Z","timestamp":1632096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T00:00:00Z","timestamp":1632096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10619-021-07366-7","type":"journal-article","created":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T10:14:59Z","timestamp":1632132899000},"page":"109-133","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A framework for discovering popular paths using transactional modeling and pattern mining"],"prefix":"10.1007","volume":"40","author":[{"given":"P. Revanth","family":"Rathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. Krishna","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anirban","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"7366_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Han, J. (eds.): Frequent Pattern Mining. Springer (2014)","DOI":"10.1007\/978-3-319-07821-2"},{"key":"7366_CR2","doi-asserted-by":"crossref","unstructured":"Chang, K.P., Wei, L.Y., Yeh, M.Y., Peng, W.C.: Discovering personalized routes from trajectories. In: Proceedings of the International Workshop on Location-Based Social Networks, pp. 33\u201340. ACM (2011)","DOI":"10.1145\/2063212.2063218"},{"key":"7366_CR3","doi-asserted-by":"crossref","unstructured":"Chen, Z., Shen, H.T., Zhou, X.: Discovering popular routes from trajectories. In: Proceedings of the International Conference on Data Engineering, pp. 900\u2013911. IEEE (2011)","DOI":"10.1109\/ICDE.2011.5767890"},{"key":"7366_CR4","doi-asserted-by":"crossref","unstructured":"Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U.: Alternative routing: k-shortest paths with limited overlap. In: Proceedings of the International Conference on Advances in Geographic Information Systems, p.\u00a068. ACM (2015)","DOI":"10.1145\/2820783.2820858"},{"key":"7366_CR5","unstructured":"Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U.: Exact and approximate algorithms for finding k-shortest paths with limited overlap. In: Proceedings of the International Conference on Extending Database Technology, pp. 414\u2013425 (2017)"},{"key":"7366_CR6","doi-asserted-by":"crossref","unstructured":"Chondrogiannis, T., Gamper, J.: ParDiSP: A partition-based framework for distance and shortest path queries on road networks. In: Proceedings of the International Conference on Mobile Data Management, vol.\u00a01, pp. 242\u2013251. IEEE (2016)","DOI":"10.1109\/MDM.2016.45"},{"issue":"1","key":"7366_CR7","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"},{"key":"7366_CR8","doi-asserted-by":"publisher","first-page":"2056","DOI":"10.1109\/ACCESS.2016.2553681","volume":"4","author":"Z Feng","year":"2016","unstructured":"Feng, Z., Zhu, Y.: A survey on trajectory data mining: techniques and applications. IEEE Access 4, 2056\u20132067 (2016)","journal-title":"IEEE Access"},{"key":"7366_CR9","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD Record, 2, pp. 1\u201312. ACM (2000)","DOI":"10.1145\/335191.335372"},{"issue":"8","key":"7366_CR10","doi-asserted-by":"publisher","first-page":"2505","DOI":"10.1109\/TITS.2017.2753468","volume":"19","author":"Z He","year":"2017","unstructured":"He, Z., Chen, K., Chen, X.: A collaborative method for route discovery using taxi drivers experience and preferences. IEEE Trans. Intell. Transp. Syst. 19(8), 2505\u20132514 (2017)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"7366_CR11","doi-asserted-by":"crossref","unstructured":"Hendawi, A.M., Rustum, A., Ahmadain, A.A., Hazel, D., Teredesai, A., Oliver, D., Ali, M., Stankovic, J.A.: Smart personalized routing for smart cities. In: Proceedings of the International Conference on Data Engineering, pp. 1295\u20131306. IEEE (2017)","DOI":"10.1109\/ICDE.2017.172"},{"issue":"4","key":"7366_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/1290672.1290682","volume":"3","author":"J Hershberger","year":"2007","unstructured":"Hershberger, J., Maxel, M., Suri, S.: Finding the k shortest simple paths: a new algorithm and its implementation. ACM Trans. Algorithms 3(4), 45 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"6","key":"7366_CR13","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1007\/s11280-017-0511-8","volume":"21","author":"G Hu","year":"2018","unstructured":"Hu, G., Shao, J., Ni, Z., Zhang, D.: A graph based method for constructing popular routes with check-ins. World Wide Web 21(6), 1689\u20131703 (2018)","journal-title":"World Wide Web"},{"issue":"1","key":"7366_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3200200","volume":"4","author":"S Koide","year":"2018","unstructured":"Koide, S., Tadokoro, Y., Yoshimura, T., Xiao, C., Ishikawa, Y.: Enhanced indexing and querying of trajectories in road networks via string algorithms. ACM Trans. Spatial Algorithms Syst. 4(1), 1\u201341 (2018)","journal-title":"ACM Trans. Spatial Algorithms Syst."},{"key":"7366_CR15","unstructured":"Letchner, J., Krumm, J., Horvitz, E.: Trip router with individualized preferences (trip): incorporating personalization into route planning. In: Proceedings of the National Conference on Artificial Intelligence and the Innovative Applications of Artificial Intelligence Conference, pp. 1795\u20131800. AAAI Press (2006)"},{"key":"7366_CR16","doi-asserted-by":"crossref","unstructured":"Li, X., Han, J., Lee, J.G., Gonzalez, H.: Traffic density-based discovery of hot routes in road networks. In: Proceedings of the International Symposium on Spatial and Temporal Databases, pp. 441\u2013459. Springer (2007)","DOI":"10.1007\/978-3-540-73540-3_25"},{"issue":"3","key":"7366_CR17","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1109\/TKDE.2017.2773492","volume":"30","author":"H Liu","year":"2018","unstructured":"Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k shortest paths with diversity. IEEE Trans. Knowl. Data Eng. 30(3), 488\u2013502 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"7366_CR18","first-page":"925","volume":"20","author":"CL Lo","year":"2019","unstructured":"Lo, C.L., Chen, C.H., Hu, J.L., Lo, K.R., Cho, H.J.: A fuel-efficient route plan method based on game theory. J. Internet Technol. 20(3), 925\u2013932 (2019)","journal-title":"J. Internet Technol."},{"issue":"2","key":"7366_CR19","first-page":"121","volume":"1","author":"EQ Martins","year":"2003","unstructured":"Martins, E.Q., Pascoal, M.M.: A new implementation of Yens ranking loopless paths algorithm. Q. J. Belgian French Ital. Operat. Res. Soc. 1(2), 121\u2013133 (2003)","journal-title":"Q. J. Belgian French Ital. Operat. Res. Soc."},{"key":"7366_CR20","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: Proceedings of the ACM Conference on Information and Knowledge Management, pp. 867\u2013876. ACM (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"7366_CR21","doi-asserted-by":"crossref","unstructured":"Rathan, P.R., Reddy, P.K., Mondal, A.: Discovering diverse popular paths using transactional modeling and pattern mining. In: Proceedings of the International Conference on Database and Expert Systems Applications, pp. 327\u2013337. Springer (2019)","DOI":"10.1007\/978-3-030-27615-7_25"},{"key":"7366_CR22","doi-asserted-by":"crossref","unstructured":"Sacharidis, D., Bouros, P., Chondrogiannis, T.: Finding the most preferred path. In: Proceedings of the ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 1\u201310 (2017)","DOI":"10.1145\/3139958.3140029"},{"issue":"4","key":"7366_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2530531","volume":"46","author":"C Sommer","year":"2014","unstructured":"Sommer, C.: Shortest-path queries in static networks. ACM Comput. Surv. 46(4), 1\u201331 (2014)","journal-title":"ACM Comput. Surv."},{"key":"7366_CR24","doi-asserted-by":"crossref","unstructured":"Wang, Z., Che, O., Chen, L., Lim, A.: An efficient shortest path computation system for real road networks. In: Proceedings of the International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, pp. 711\u2013720. Springer (2006)","DOI":"10.1007\/11779568_77"},{"issue":"2","key":"7366_CR25","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10619-013-7139-1","volume":"33","author":"LY Wei","year":"2015","unstructured":"Wei, L.Y., Chang, K.P., Peng, W.C.: Discovering pattern-aware routes from trajectories. Distrib. Parallel Databases 33(2), 201\u2013226 (2015)","journal-title":"Distrib. Parallel Databases"},{"key":"7366_CR26","doi-asserted-by":"crossref","unstructured":"Wei, L.Y., Zheng, Y., Peng, W.C.: Constructing popular routes from uncertain trajectories. In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, pp. 195\u2013203. ACM (2012)","DOI":"10.1145\/2339530.2339562"},{"issue":"11","key":"7366_CR27","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manag. Sci."},{"key":"7366_CR28","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 the International Conference on Advances in Geographic Information Systems, pp. 99\u2013108. ACM (2010)","DOI":"10.1145\/1869790.1869807"},{"issue":"2","key":"7366_CR29","first-page":"32","volume":"33","author":"Y Zheng","year":"2010","unstructured":"Zheng, Y., Xie, X., Ma, W.Y.: Geolife: a collaborative social networking service among user, location and trajectory. IEEE Data Eng. Bull. 33(2), 32\u201339 (2010)","journal-title":"IEEE Data Eng. Bull."},{"key":"7366_CR30","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Zhang, L., Xie, X., Ma, W.Y.: Mining interesting locations and travel sequences from GPS trajectories. In: Proceedings of the International Conference on World Wide Web, pp. 791\u2013800. ACM (2009)","DOI":"10.1145\/1526709.1526816"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-021-07366-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10619-021-07366-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-021-07366-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T08:10:42Z","timestamp":1646295042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10619-021-07366-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,20]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["7366"],"URL":"https:\/\/doi.org\/10.1007\/s10619-021-07366-7","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"value":"0926-8782","type":"print"},{"value":"1573-7578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,20]]},"assertion":[{"value":"9 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}