{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T06:57:32Z","timestamp":1774162652752,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030276140","type":"print"},{"value":"9783030276157","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-27615-7_25","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"327-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Discovering Diverse Popular Paths Using Transactional Modeling and Pattern Mining"],"prefix":"10.1007","author":[{"given":"P.","family":"Revanth Rathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Krishna 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":[[2019,8,3]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07821-2","volume-title":"Frequent Pattern Mining","year":"2014","unstructured":"Aggarwal, C.C., Han, J. (eds.): Frequent Pattern Mining. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07821-2"},{"key":"25_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 ACM SIGSPATIAL, pp. 33\u201340 (2011)","DOI":"10.1145\/2063212.2063218"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Chen, Z., Shen, H.T., Zhou, X.: Discovering popular routes from trajectories. In: Proceedings of ICDE, pp. 900\u2013911 (2011)","DOI":"10.1109\/ICDE.2011.5767890"},{"key":"25_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 ACM SIGSPATIAL (2015)","DOI":"10.1145\/2820783.2820858"},{"key":"25_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 EDBT 2017, pp. 414\u2013425 (2017)"},{"key":"25_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 MDM, vol. 1, pp. 242\u2013251 (2016)","DOI":"10.1109\/MDM.2016.45"},{"issue":"1","key":"25_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. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"25_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":"25_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM SIGMOD Rec. 29, 1\u201312 (2000)","journal-title":"ACM SIGMOD Rec."},{"issue":"4","key":"25_CR10","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":"2","key":"25_CR11","first-page":"121","volume":"1","author":"EQ Martins","year":"2003","unstructured":"Martins, E.Q., Pascoal, M.M.: A new implementation of Yen\u2019s ranking loopless paths algorithm. Q. J. Belg. Fr. Ital. Oper. Res. Soc. 1(2), 121\u2013133 (2003)","journal-title":"Q. J. Belg. Fr. Ital. Oper. Res. Soc."},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/2530531","volume":"46","author":"C Sommer","year":"2014","unstructured":"Sommer, C.: Shortest-path queries in static networks. ACM Comput. Surv. (CSUR) 46(4), 45 (2014)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"2","key":"25_CR13","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":"25_CR14","doi-asserted-by":"crossref","unstructured":"Wei, L.Y., Zheng, Y., Peng, W.C.: Constructing popular routes from uncertain trajectories. In: Proceedings of ACM SIGKDD, pp. 195\u2013203 (2012)","DOI":"10.1145\/2339530.2339562"},{"issue":"11","key":"25_CR15","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. Manage. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manage. Sci."},{"issue":"2","key":"25_CR16","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."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27615-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:16:15Z","timestamp":1710249375000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27615-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030276140","9783030276157"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27615-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Linz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mixed (Single-blind and Double-blind)","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ConfDriver","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"157","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}