{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:25:50Z","timestamp":1740176750650,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T00:00:00Z","timestamp":1643414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T00:00:00Z","timestamp":1643414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001824","name":"czech science foundation","doi-asserted-by":"crossref","award":["GJ19-06792Y"],"award-info":[{"award-number":["GJ19-06792Y"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s41060-021-00301-0","type":"journal-article","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T13:03:29Z","timestamp":1643720609000},"page":"201-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sampling and sparsification for approximating the packedness of trajectories and detecting gatherings"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1667-6323","authenticated-orcid":false,"given":"Sepideh","family":"Aghamolaei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahideh","family":"Keikha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Mohades","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,29]]},"reference":[{"key":"301_CR1","unstructured":"GPS Trajectories. UCI Machine Learning Repository (2016)"},{"key":"301_CR2","unstructured":"Afshar, R., Goodrich, M.T., Matias, P., Osegueda, M.C.: Reconstructing biological and digital phylogenetic trees in parallel. In: 28th Annual European Symposium on Algorithms (ESA 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"6","key":"301_CR3","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/BF02187809","volume":"5","author":"PK Agarwal","year":"1990","unstructured":"Agarwal, P.K.: Partitioning arrangements of lines ii: applications. Discrete Comput. Geom. 5(6), 533\u2013573 (1990)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"301_CR4","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"PK Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM (JACM) 51(4), 606\u2013635 (2004)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"301_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0925-7721(95)00005-8","volume":"5","author":"PK Agarwal","year":"1995","unstructured":"Agarwal, P.K., Katz, M.J., Sharir, M.: Computing depth orders for fat objects and related problems. Comput. Geom. 5(4), 187\u2013206 (1995)","journal-title":"Comput. Geom."},{"key":"301_CR6","doi-asserted-by":"crossref","unstructured":"Aghamolaei, S., Baharifard, F., Ghodsi, M.: Geometric spanners in the MapReduce model. In International Computing and Combinatorics Conference, pp. 675\u2013687. Springer, Berlin (2018)","DOI":"10.1007\/978-3-319-94776-1_56"},{"key":"301_CR7","doi-asserted-by":"crossref","unstructured":"Aghamolaei, S., Keikha, V., Ghodsi, M., Mohades, A.: Windowing queries using Minkowski sum and their extension to MapReduce. J. Supercomput. (2020)","DOI":"10.1007\/s11227-020-03299-7"},{"issue":"6","key":"301_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3125644","volume":"64","author":"P Beame","year":"2017","unstructured":"Beame, P., Koutris, P., Suciu, D.: Communication steps for parallel query processing. J. ACM (JACM) 64(6), 1\u201358 (2017)","journal-title":"J. ACM (JACM)"},{"key":"301_CR9","doi-asserted-by":"crossref","unstructured":"Bringmann, K., K\u00fcnnemann, M.: Improved approximation for Fr\u00e9chet distance on c-packed curves matching conditional lower bounds. In International Symposium on Algorithms and Computation, pp. 517\u2013528. Springer, Berlin (2015)","DOI":"10.1007\/978-3-662-48971-0_44"},{"key":"301_CR10","doi-asserted-by":"publisher","DOI":"10.5061\/dryad.t7ck5","author":"E Browning","year":"2017","unstructured":"Browning, E., Bolton, M., Owen, E., Shoji, A., Guilford, T., Freeman, R.: Predicting animal behaviour using deep learning: Gps data alone accurately predict diving in seabirds. Methods Ecol. Evol. (2017). https:\/\/doi.org\/10.5061\/dryad.t7ck5","journal-title":"Methods Ecol. Evol."},{"key":"301_CR11","unstructured":"Callahan, P.B.: Dealing with higher dimensions: the well-separated pair decomposition and its applications. Ph.D. thesis, Johns Hopkins University (1995)"},{"key":"301_CR12","doi-asserted-by":"crossref","unstructured":"Chen, D., Driemel, A., Guibas, L.J., Nguyen, A., Wenk, C.: Approximate map matching with respect to the Fr\u00e9chet distance. In 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 75\u201383. SIAM (2011)","DOI":"10.1137\/1.9781611972917.8"},{"key":"301_CR13","doi-asserted-by":"crossref","unstructured":"Cruz, M.O., Macedo, H., Guimaraes, A.: Grouping similar trajectories for carpooling purposes. In 2015 Brazilian Conference on Intelligent Systems (BRACIS), pp. 234\u2013239. IEEE (2015)","DOI":"10.1109\/BRACIS.2015.36"},{"key":"301_CR14","doi-asserted-by":"crossref","unstructured":"De\u00a0Berg, M., Van\u00a0Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational geometry. In Computational Geometry, pp. 1\u201317. Springer, Berlin (1997)","DOI":"10.1007\/978-3-662-03427-9_1"},{"issue":"5","key":"301_CR15","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1137\/120865112","volume":"42","author":"A Driemel","year":"2013","unstructured":"Driemel, A., Har-Peled, S.: Jaywalking your dog: computing the Fr\u00e9chet distance with shortcuts. SIAM J. Comput. 42(5), 1830\u20131866 (2013)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"301_CR16","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s00454-012-9402-z","volume":"48","author":"A Driemel","year":"2012","unstructured":"Driemel, A., Har-Peled, S., Wenk, C.: Approximating the Fr\u00e9chet distance for realistic curves in near linear time. Discrete Comput. Geom. 48(1), 94\u2013127 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"301_CR17","doi-asserted-by":"crossref","unstructured":"Driemel, A., Krivo\u0161ija, A.: Probabilistic embeddings of the Fr\u00e9chet distance. In International Workshop on Approximation and Online Algorithms, pp. 218\u2013237. Springer, Berlin (2018)","DOI":"10.1007\/978-3-030-04693-4_14"},{"issue":"1","key":"301_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jda.2005.01.001","volume":"4","author":"AV Gerbessiotis","year":"2006","unstructured":"Gerbessiotis, A.V.: An architecture independent study of parallel segment trees. J. Discrete Algorithms 4(1), 1\u201324 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"301_CR19","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Sitchinava, N., Zhang, Q.: Sorting, searching, and simulation in the MapReduce framework. In International Symposium on Algorithms and Computation, pp. 374\u2013383. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"301_CR20","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Sitchinava, N., Zhang, Q., IT-Parken, A.: Sorting, searching, and simulation in the MapReduce framework. arXiv preprint arXiv:1101.1902 (2011)","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"301_CR21","doi-asserted-by":"crossref","unstructured":"Gudmundsson, J., van Kreveld, M., Staals, F.: Algorithms for hotspot computation on trajectory data. In Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 134\u2013143 (2013)","DOI":"10.1145\/2525314.2525359"},{"key":"301_CR22","unstructured":"Gudmundsson, J., Sha, Y., Wong, S.: Approximating the packedness of polygonal curves. In Cao, Y., Cheng, S.W., Li, M. (eds.) 31st International Symposium on Algorithms and Computation (ISAAC 2020), Leibniz International Proceedings in Informatics (LIPIcs), vol. 181, pp. 9:1\u20139:15. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). 10.4230\/LIPIcs.ISAAC.2020.9. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2020\/13353"},{"issue":"6","key":"301_CR23","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.comgeo.2015.02.003","volume":"48","author":"J Gudmundsson","year":"2015","unstructured":"Gudmundsson, J., Smid, M.: Fast algorithms for approximate Fr\u00e9chet matching queries in geometric trees. Comput. Geom. 48(6), 479\u2013494 (2015)","journal-title":"Comput. Geom."},{"issue":"1","key":"301_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2532646","volume":"10","author":"S Har-Peled","year":"2014","unstructured":"Har-Peled, S., Raichel, B.: The Fr\u00e9chet distance revisited and extended. ACM Trans. Algorithms (TALG) 10(1), 1\u201322 (2014)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"301_CR25","unstructured":"Har-Peled, S., Zhou, T.: How packed is it, really? CoRR (2021). arXiv:2105.10776"},{"key":"301_CR26","volume-title":"Introduction to parallel algorithms and architectures: Arrays $$\\cdot $$ trees $$\\cdot $$ hypercubes","author":"FT Leighton","year":"2014","unstructured":"Leighton, F.T.: Introduction to parallel algorithms and architectures: Arrays $$\\cdot $$ trees $$\\cdot $$ hypercubes. Elsevier, Amsterdam (2014)"},{"key":"301_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"key":"301_CR28","volume-title":"Introduction to Parallel Processing: Algorithms and Architectures","author":"B Parhami","year":"2006","unstructured":"Parhami, B.: Introduction to Parallel Processing: Algorithms and Architectures. Springer Science and Business Media, Berlin (2006)"},{"issue":"5","key":"301_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3186893","volume":"65","author":"VV Williams","year":"2018","unstructured":"Williams, V.V., Williams, R.R.: Subcubic equivalences between path, matrix, and triangle problems. J. ACM (JACM) 65(5), 1\u201338 (2018)","journal-title":"J. ACM (JACM)"},{"key":"301_CR30","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Li, Q., Chen, Y., Xie, X., Ma, W.Y.: Understanding mobility based on gps data. In Proceedings of the 10th International Conference on Ubiquitous Computing, pp. 312\u2013321 (2008)","DOI":"10.1145\/1409635.1409677"},{"issue":"2","key":"301_CR31","first-page":"32","volume":"33","author":"Y Zheng","year":"2010","unstructured":"Zheng, Y., Xie, X., Ma, W.Y., et al.: 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":"301_CR32","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 18th International Conference on World Wide Web, pp. 791\u2013800 (2009)","DOI":"10.1145\/1526709.1526816"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-021-00301-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-021-00301-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-021-00301-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,11]],"date-time":"2023-03-11T19:10:09Z","timestamp":1678561809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-021-00301-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,29]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["301"],"URL":"https:\/\/doi.org\/10.1007\/s41060-021-00301-0","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2022,1,29]]},"assertion":[{"value":"1 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Publicly available at .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}