{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:50:26Z","timestamp":1740124226813,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"national science foundation","doi-asserted-by":"publisher","award":["CCF-1637541","SWIFT 203024"],"award-info":[{"award-number":["CCF-1637541","SWIFT 203024"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10619-022-07413-x","type":"journal-article","created":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T09:08:41Z","timestamp":1655284121000},"page":"603-638","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Searching semantically diverse paths"],"prefix":"10.1007","volume":"41","author":[{"given":"Xu","family":"Teng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goce","family":"Trajcevski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Z\u00fcfle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"key":"7413_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/568271.223794","volume":"24","author":"N Roussopoulos","year":"1995","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. SIGMOD Rec. 24, 71\u201379 (1995)","journal-title":"SIGMOD Rec."},{"issue":"3","key":"7413_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00778-005-0166-4","volume":"15","author":"R Benetis","year":"2006","unstructured":"Benetis, R., Jensen, C.S., Kar\u0109iauskas, G., \u015caltenis, S.: Nearest and reverse nearest neighbor queries for moving objects. VLDB J. 15(3), 229\u2013249 (2006)","journal-title":"VLDB J."},{"key":"7413_CR3","doi-asserted-by":"crossref","unstructured":"Bao, J., Chow, C.-Y., Mokbel, M.F., Ku, W.-S.: Efficient evaluation of k-range nearest neighbor queries in road networks. In: 2010 Eleventh International Conference on Mobile Data Management, pp. 115\u2013124 (2010)","DOI":"10.1109\/MDM.2010.40"},{"key":"7413_CR4","doi-asserted-by":"crossref","unstructured":"Zheng, K., Shang, S., Yuan, N.J., Yang, Y.: Towards efficient search for activity trajectories. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 230\u2013241 (2013)","DOI":"10.1109\/ICDE.2013.6544828"},{"key":"7413_CR5","doi-asserted-by":"crossref","unstructured":"Alvares, L.O., Bogorny, V., Kuijpers, B., de Macedo, J.A.F., Moelans, B., Vaisman, A.: A model for enriching trajectories with semantic geographical information. In: Proceedings of the 15th Annual ACM International Symposium on Advances in Geographic Information Systems, pp. 1\u20138 (2007)","DOI":"10.1145\/1341012.1341041"},{"issue":"4","key":"7413_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2501654.2501656","volume":"45","author":"C Parent","year":"2013","unstructured":"Parent, C., Spaccapietra, S., Renso, C., Andrienko, G., Andrienko, N., Bogorny, V., Damiani, M.L., Gkoulalas-Divanis, A., Macedo, J., Pelekis, N., Theodoridis, Y., Yan, Z.: Semantic trajectories modeling and analysis. ACM Comput. Surv. 45(4), 1\u201332 (2013)","journal-title":"ACM Comput. Surv."},{"key":"7413_CR7","doi-asserted-by":"crossref","unstructured":"Costa, C.F., Nascimento, M.A.: Towards spatially-and category-wise k-diverse nearest neighbors queries. In: Advances in Spatial and Temporal Databases, pp. 163\u2013181 (2017)","DOI":"10.1007\/978-3-319-64367-0_9"},{"key":"7413_CR8","doi-asserted-by":"crossref","unstructured":"Teng, X., Yang, J., Kim, J.-S., Trajcevski, G., Z\u00fcfle, A., Nascimento, M.A.: Fine-grained diversification of proximity constrained queries on road networks. In: Proceedings of the 16th International Symposium on Spatial and Temporal Databases, pp. 51\u201360 (2019)","DOI":"10.1145\/3340964.3340970"},{"issue":"4","key":"7413_CR9","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s10707-018-0332-7","volume":"22","author":"CF Costa","year":"2018","unstructured":"Costa, C.F., Nascimento, M.A., Schubert, M.: Diverse nearest neighbors queries using linear skylines. GeoInformatica 22(4), 815\u2013844 (2018)","journal-title":"GeoInformatica"},{"key":"7413_CR10","doi-asserted-by":"crossref","unstructured":"Grambow, G., Oberhauser, R., Reichert, M.: Semantically-driven workflow generation using declarative modeling for processes in software engineering. In: 2011 IEEE 15th International Enterprise Distributed Object Computing Conference Workshops, pp. 164\u2013173 (2011)","DOI":"10.1109\/EDOCW.2011.54"},{"key":"7413_CR11","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-88194-0_22","volume":"5256","author":"PYH Wong","year":"2008","unstructured":"Wong, P.Y.H., Gibbons, J.: A process semantics for BPMN. Formal Methods Softw Eng 5256, 355\u2013374 (2008)","journal-title":"Formal Methods Softw Eng"},{"key":"7413_CR12","unstructured":"Kelci, M., Pratt, R., Galati, M.: The traveling salesman traverses the genome: using sas\u00ae optimization in jmp\u00ae genomics to build genetic maps. In: In SAS Global Forum (2012)"},{"key":"7413_CR13","doi-asserted-by":"crossref","unstructured":"Teng, X., Trajcevski, G., Kim, J., Z\u00fcfle, A.: Semantically diverse path search. In: 21st IEEE International Conference on Mobile Data Management (MDM), pp. 69\u201378 (2020)","DOI":"10.1109\/MDM48529.2020.00028"},{"key":"7413_CR14","doi-asserted-by":"crossref","unstructured":"Issa, H., Damiani, M.L.: Efficient access to temporally overlaying spatial and textual trajectories. In: 17th IEEE International Conference on Mobile Data Management (MDM), pp. 262\u2013271 (2016)","DOI":"10.1109\/MDM.2016.47"},{"key":"7413_CR15","doi-asserted-by":"crossref","unstructured":"Carbonell, J., Goldstein, J.: The use of MMR, diversity-based reranking for reordering documents and producing summaries. In: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 335\u2013336 (1998)","DOI":"10.1145\/290941.291025"},{"key":"7413_CR16","doi-asserted-by":"crossref","unstructured":"Jain, A., Sarda, P., Haritsa, J.R.: Providing diversity in k-nearest neighbor query results. In: Advances in Knowledge Discovery and Data Mining, pp. 404\u2013413 (2004)","DOI":"10.1007\/978-3-540-24775-3_49"},{"key":"7413_CR17","doi-asserted-by":"crossref","unstructured":"Abbar, S., Amer-Yahia, S., Indyk, P., Mahabadi, S., Varadarajan, K.R.: Diverse near neighbor problem. In: Proceedings of the Twenty-Ninth Annual Symposium on Computational Geometry, pp. 207\u2013214 (2013)","DOI":"10.1145\/2462356.2462401"},{"key":"7413_CR18","doi-asserted-by":"crossref","unstructured":"Vieira, M.R., Razente, H.L., Barioni, M.C., Hadjieleftheriou, M., Srivastava, D., Traina, C., Tsotras, V.J.: On query result diversification. In: IEEE 27th International Conference on Data Engineering, pp. 1163\u20131174 (2011)","DOI":"10.1109\/ICDE.2011.5767846"},{"key":"7413_CR19","doi-asserted-by":"crossref","unstructured":"Amagata, D., Hara, T.: Diversified set monitoring over distributed data streams. In: Proceedings of the 10th ACM International Conference on Distributed and Event-Based Systems, pp. 1\u201312 (2016)","DOI":"10.1145\/2933267.2933298"},{"key":"7413_CR20","doi-asserted-by":"crossref","unstructured":"Lee, K.C.K., Lee, W.-C., Leong, H.V.: Nearest surrounder queries. In: 22nd International Conference on Data Engineering, p. 85 (2006)","DOI":"10.1109\/ICDE.2006.104"},{"issue":"3","key":"7413_CR21","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1109\/TKDE.2011.251","volume":"25","author":"O Kucuktunc","year":"2013","unstructured":"Kucuktunc, O., Ferhatosmanoglu, H.: $$\\lambda$$-diverse nearest neighbors browsing for multidimensional data. IEEE Trans. Knowl. Data Eng. 25(3), 481\u2013493 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7413_CR22","unstructured":"Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings 17th International Conference on Data Engineering, pp. 421\u2013430 (2001)"},{"key":"7413_CR23","unstructured":"Zhang, C., Zhang, Y., Zhang, W., Lin, X., Cheema, M.A., Wang, X.: Diversified spatial keyword search on road networks. In: Advances in Database Technology-EDBT 2014: 17th International Conference on Extending Database Technology, pp. 367\u2013378 (2014)"},{"issue":"3","key":"7413_CR24","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1007\/s11280-018-0535-8","volume":"22","author":"B Zheng","year":"2019","unstructured":"Zheng, B., Zheng, K., Scheuermann, P., Zhou, X., Nguyen, Q.V.H., Li, C.: Searching activity trajectory with keywords. World Wide Web 22(3), 967\u20131000 (2019)","journal-title":"World Wide Web"},{"key":"7413_CR25","doi-asserted-by":"crossref","unstructured":"Rice, M.N., Tsotras, V.J.: Exact graph search algorithms for generalized traveling salesman path problems. In: International Symposium on Experimental Algorithms, pp. 344\u2013355 (2012)","DOI":"10.1007\/978-3-642-30850-5_30"},{"key":"7413_CR26","doi-asserted-by":"crossref","first-page":"8728245","DOI":"10.1155\/2019\/8728245","volume":"2019","author":"Y Yang","year":"2019","unstructured":"Yang, Y., Li, Z., Wang, X., Hu, Q.: Finding the shortest path with vertex constraint over large graphs. Complexity 2019, 8728245\u20131872824513 (2019)","journal-title":"Complexity"},{"key":"7413_CR27","doi-asserted-by":"crossref","unstructured":"Teng, X., Trajcevski, G., Z\u00fcfle, A.: Semantically diverse paths with range and origin constraints. In: Proceedings of the 29th International Conference on Advances in Geographic Information Systems, pp. 375\u2013378 (2021)","DOI":"10.1145\/3474717.3483985"},{"issue":"C","key":"7413_CR28","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.neucom.2017.08.020","volume":"273","author":"R Gao","year":"2018","unstructured":"Gao, R., Li, J., Li, X., Song, C., Zhou, Y.: A personalized point-of-interest recommendation model via fusion of geo-social information. Neurocomputing 273(C), 159\u2013170 (2018)","journal-title":"Neurocomputing"},{"key":"7413_CR29","doi-asserted-by":"crossref","unstructured":"Han, P., Li, Z., Liu, Y., Zhao, P., Li, J., Wang, H., Shang, S.: Contextualized point-of-interest recommendation. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, pp. 2484\u20132490 (2020)","DOI":"10.24963\/ijcai.2020\/344"},{"issue":"10","key":"7413_CR30","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.14778\/3115404.3115407","volume":"10","author":"Y Liu","year":"2017","unstructured":"Liu, Y., Pham, T.-A.N., Cong, G., Yuan, Q.: An experimental evaluation of point-of-interest recommendation in location-based social networks. Proc. VLDB Endow. 10(10), 1010\u20131021 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"7413_CR31","doi-asserted-by":"crossref","unstructured":"Zhou, F., Yin, R., Zhang, K., Trajcevski, G., Zhong, T., Wu, J.: Adversarial point-of-interest recommendation. In: The World Wide Web Conference, pp. 3462\u201334618 (2019)","DOI":"10.1145\/3308558.3313609"},{"key":"7413_CR32","unstructured":"Zhao, S., King, I., Lyu, M.R.: A survey of point-of-interest recommendation in location-based social networks. CoRR (2016) 1607.00647"},{"issue":"2","key":"7413_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3378890","volume":"6","author":"F Zhou","year":"2020","unstructured":"Zhou, F., Wu, H., Trajcevski, G., Khokhar, A., Zhang, K.: Semi-supervised trajectory understanding with poi attention for end-to-end trip recommendation. ACM Trans. Spatial Algorithms Syst. 6(2), 1\u201325 (2020)","journal-title":"ACM Trans. Spatial Algorithms Syst."},{"issue":"4","key":"7413_CR34","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1080\/1369183X.2013.830500","volume":"40","author":"K Schaake","year":"2014","unstructured":"Schaake, K., Burgers, J., Mulder, C.H.: Ethnicity, education and income, and residential mobility between neighbourhoods. J. Ethn. Migr. Stud. 40(4), 512\u2013527 (2014)","journal-title":"J. Ethn. Migr. Stud."},{"issue":"3","key":"7413_CR35","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1111\/tesg.12305","volume":"110","author":"J Yao","year":"2019","unstructured":"Yao, J., Wong, D.W.S., Bailey, N., Minton, J.: Spatial segregation measures: a methodological review. Tijdschr. Econ. Soc. Geogr. 110(3), 235\u2013250 (2019)","journal-title":"Tijdschr. Econ. Soc. Geogr."},{"key":"7413_CR36","unstructured":"Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 853\u2013864 (2005)"},{"key":"7413_CR37","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Some complexity results for the traveling salesman problem. In: Proceedings of the Eighth Annual ACM Symposium on Theory of Computing, pp. 1\u20139 (1976)","DOI":"10.1145\/800113.803625"},{"key":"7413_CR38","volume-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"J Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Longman Publishing Co., Inc, USA (1984)"},{"key":"7413_CR39","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"7413_CR40","doi-asserted-by":"crossref","unstructured":"Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient OLAP operations in spatial data warehouses. In: Advances in Spatial and Temporal Databases, pp. 443\u2013459 (2001)","DOI":"10.1007\/3-540-47724-1_23"},{"issue":"1","key":"7413_CR41","first-page":"39","volume":"31","author":"CE Noon","year":"1993","unstructured":"Noon, C.E., Bean, J.C.: An efficient transformation of the generalized traveling salesman problem. INFOR: Inform. Syst. Operat. Res. 31(1), 39\u201344 (1993)","journal-title":"INFOR: Inform. Syst. Operat. Res."},{"issue":"3\u2013part\u2013ii","key":"7413_CR42","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1287\/opre.28.3.694","volume":"28","author":"B Golden","year":"1980","unstructured":"Golden, B., Bodin, L., Doyle, T., Stewart, W., Jr.: Approximate traveling salesman algorithms. Oper. Res. 28(3\u2013part\u2013ii), 694\u2013711 (1980)","journal-title":"Oper. Res."},{"key":"7413_CR43","doi-asserted-by":"crossref","unstructured":"Hwang, S., Kwon, K., Cha, S.K., Lee, B.S.: Performance evaluation of main-memory r-tree variants. In: Advances in Spatial and Temporal Databases, pp. 10\u201327 (2003)","DOI":"10.1007\/978-3-540-45072-6_2"},{"key":"7413_CR44","volume-title":"Analytic Geometry","author":"V Serdarushich","year":"2014","unstructured":"Serdarushich, V.: Analytic Geometry. Nabla Ltd (2014)"},{"key":"7413_CR45","volume-title":"Modern Calculus and Analytic Geometry","author":"RA Silverman","year":"2012","unstructured":"Silverman, R.A.: Modern Calculus and Analytic Geometry. Dover (2012)"},{"key":"7413_CR46","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische mathematik, 269\u2013271 (1959)","DOI":"10.1007\/BF01386390"},{"key":"7413_CR47","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Pan, J.-Y.: Fast random walk with restart and its applications. In: Sixth International Conference on Data Mining, pp. 613\u2013622 (2006)","DOI":"10.1109\/ICDM.2006.70"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-022-07413-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10619-022-07413-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-022-07413-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T23:29:18Z","timestamp":1727393358000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10619-022-07413-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,15]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["7413"],"URL":"https:\/\/doi.org\/10.1007\/s10619-022-07413-x","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"type":"print","value":"0926-8782"},{"type":"electronic","value":"1573-7578"}],"subject":[],"published":{"date-parts":[[2022,6,15]]},"assertion":[{"value":"5 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}