{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:58:53Z","timestamp":1742947133824,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030609351"},{"type":"electronic","value":"9783030609368"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60936-8_32","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T10:05:52Z","timestamp":1602669952000},"page":"399-404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Temporal Similarity of Trajectories in Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7863-0094","authenticated-orcid":false,"given":"Shima","family":"Moghtasedi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,14]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1007\/s12652-017-0519-z","volume":"9","author":"M Boukhechba","year":"2017","unstructured":"Boukhechba, M., Bouzouane, A., Gaboury, S., Gouin-Vallerand, C., Giroux, S., Bouchard, B.: Prediction of next destinations from irregular patterns. J. Ambient Intell. Hum. Comput. 9, 1345\u20131357 (2017)","journal-title":"J. Ambient Intell. Hum. Comput."},{"issue":"1","key":"32_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10707-004-5621-7","volume":"9","author":"VT De Almeida","year":"2005","unstructured":"De Almeida, V.T., G\u00fcting, R.H.: Indexing the trajectories of moving objects in networks. GeoInformatica 9(1), 33\u201360 (2005)","journal-title":"GeoInformatica"},{"key":"32_CR3","unstructured":"Grossi, R., Marino, A., Moghtasedi, S.: Finding structurally and temporally similar trajectories in graphs. In: 18th International Symposium on Experimental Algorithms (SEA 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-28997-2_17","volume-title":"Advances in Information Retrieval","author":"C Lucchese","year":"2012","unstructured":"Lucchese, C., Perego, R., Silvestri, F., Vahabi, H., Venturini, R.: How random walks can help tourism. In: Baeza-Yates, R., et al. (eds.) ECIR 2012. LNCS, vol. 7224, pp. 195\u2013206. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28997-2_17"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Luo, W., Tan, H., Chen, L., Ni, L.M.: Finding time period-based most frequent path in big trajectory data. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 713\u2013724. ACM (2013)","DOI":"10.1145\/2463676.2465287"},{"key":"32_CR6","unstructured":"Moghtasedi, S.: Time-based similar trajectories on graphs. In: ICTCS, pp. 82\u201386 (2018)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Monreale, A., Pinelli, F., Trasarti, R., Giannotti, F.: WhereNext: a location predictor on trajectory pattern mining. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 637\u2013646. ACM (2009)","DOI":"10.1145\/1557019.1557091"},{"issue":"1","key":"32_CR8","first-page":"8","volume":"7","author":"CI Muntean","year":"2015","unstructured":"Muntean, C.I., Nardini, F.M., Silvestri, F., Baraglia, R.: On learning prediction models for tourists paths. ACM Trans. Intell. Syst. Technol. (TIST) 7(1), 8 (2015)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"32_CR9","unstructured":"Popa, I.S., Zeitouni, K., Oria, V., Barth, D., Vial, S.: PariNet: a tunable access method for in-network trajectories. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), pp. 177\u2013188. IEEE (2010)"},{"issue":"11","key":"32_CR10","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.14778\/3137628.3137630","volume":"10","author":"S Shang","year":"2017","unstructured":"Shang, S., Chen, L., Wei, Z., Jensen, C.S., Zheng, K., Kalnis, P.: Trajectory similarity join in spatial networks. Proc. VLDB Endow. 10(11), 1178\u20131189 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Shang, S., Ding, R., Yuan, B., Xie, K., Zheng, K., Kalnis, P.: User oriented trajectory search for trip recommendation. In: Proceedings of the 15th International Conference on Extending Database Technology, pp. 156\u2013167 (2012)","DOI":"10.1145\/2247596.2247616"},{"issue":"3","key":"32_CR12","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s00778-013-0331-0","volume":"23","author":"S Shang","year":"2013","unstructured":"Shang, S., Ding, R., Zheng, K., Jensen, C.S., Kalnis, P., Zhou, X.: Personalized trajectory matching in spatial networks. VLDB J. 23(3), 449\u2013468 (2013). https:\/\/doi.org\/10.1007\/s00778-013-0331-0","journal-title":"VLDB J."},{"key":"32_CR13","unstructured":"Shima, M., Cristina Ioana, M., Franco Maria, N., Roberto, G., Andrea, M.: High-quality prediction of tourist movements using temporal trajectories in graphs (under submission)"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Tiakas, E., Papadopoulos, A.N., Nanopoulos, A., Manolopoulos, Y., Stojanovic, D., Djordjevic-Kajan, S.: Trajectory similarity search in spatial networks, pp. 185\u2013192. IEEE (2006)","DOI":"10.1109\/IDEAS.2006.48"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-23781-7_17","volume-title":"Model and Data Engineering","author":"E Tiakas","year":"2015","unstructured":"Tiakas, E., Rafailidis, D.: Scalable trajectory similarity search based on locations in spatial networks. In: Bellatreche, L., Manolopoulos, Y. (eds.) MEDI 2015. LNCS, vol. 9344, pp. 213\u2013224. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23781-7_17"},{"issue":"5","key":"32_CR16","doi-asserted-by":"publisher","first-page":"2209","DOI":"10.1007\/s11280-018-0596-8","volume":"22","author":"H Ying","year":"2019","unstructured":"Ying, H., et al.: Time-aware metric embedding with asymmetric projection for successive poi recommendation. World Wide Web 22(5), 2209\u20132224 (2019)","journal-title":"World Wide Web"},{"issue":"1","key":"32_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s11280-016-0400-6","volume":"20","author":"J Zhu","year":"2016","unstructured":"Zhu, J., Jiang, W., Liu, A., Liu, G., Zhao, L.: Effective and efficient trajectory outlier detection based on time-dependent popular route. World Wide Web 20(1), 111\u2013134 (2016). https:\/\/doi.org\/10.1007\/s11280-016-0400-6","journal-title":"World Wide Web"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60936-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:46:18Z","timestamp":1710251178000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60936-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030609351","9783030609368"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60936-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","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":"19","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":"12","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":"38% - 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":"3.9","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","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)"}},{"value":"2 short papers accepted for the SISAP 2020 Doctoral Symposium are also included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}