{"id":"https://openalex.org/W4392118326","doi":"https://doi.org/10.4230/lipics.icalp.2025.133","title":"Faster, Deterministic and Space Efficient Subtrajectory Clustering","display_name":"Faster, Deterministic and Space Efficient Subtrajectory Clustering","publication_year":2024,"publication_date":"2024-02-20","ids":{"openalex":"https://openalex.org/W4392118326","doi":"https://doi.org/10.4230/lipics.icalp.2025.133"},"language":"en","primary_location":{"id":"pmh:oai:pure.atira.dk:openaire/238acb26-3618-46a7-9397-a6b8a7ba1010","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/238acb26-3618-46a7-9397-a6b8a7ba1010","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van der Hoog, I, van der Horst, T & Ophelders, T 2025, Faster, Deterministic and Space Efficient Subtrajectory Clustering. in 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). vol. 52, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Leibniz International Proceedings in Informatics, vol. 334, pp. 1-18, EATCS International Colloquium on Automata, Languages, and Programming, Aarhus, Denmark, 08/07/2025. https://doi.org/https://arxiv.org/abs/2402.13117, https://doi.org/10.4230/LIPICS.ICALP.2025.133","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.itu.dk/portal/da/publications/238acb26-3618-46a7-9397-a6b8a7ba1010","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009550388","display_name":"Ivor van der Hoog","orcid":"https://orcid.org/0009-0006-2624-0231"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"van der Hoog, Ivor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064143970","display_name":"Thijs van der Horst","orcid":"https://orcid.org/0009-0002-6987-4489"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van der Horst, Thijs","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5013950801","display_name":"Tim Ophelders","orcid":"https://orcid.org/0000-0002-9570-024X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ophelders, Tim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5009550388"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01453517,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9846000075340271,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9846000075340271,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11550","display_name":"Text and Document Classification Technologies","score":0.9534000158309937,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9395999908447266,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7058148980140686},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5256292223930359},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.28490149974823}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7058148980140686},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5256292223930359},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28490149974823}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:pure.atira.dk:openaire/238acb26-3618-46a7-9397-a6b8a7ba1010","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/238acb26-3618-46a7-9397-a6b8a7ba1010","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van der Hoog, I, van der Horst, T & Ophelders, T 2025, Faster, Deterministic and Space Efficient Subtrajectory Clustering. in 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). vol. 52, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Leibniz International Proceedings in Informatics, vol. 334, pp. 1-18, EATCS International Colloquium on Automata, Languages, and Programming, Aarhus, Denmark, 08/07/2025. https://doi.org/https://arxiv.org/abs/2402.13117, https://doi.org/10.4230/LIPICS.ICALP.2025.133","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:2402.13117","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2402.13117","pdf_url":"https://arxiv.org/pdf/2402.13117","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.tue.nl:openaire/95171db2-8748-46dc-8101-9b2d07c338bf","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/95171db2-8748-46dc-8101-9b2d07c338bf","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"van der Hoog, I, van der Horst, T & Ophelders, T A E 2024, 'Faster and Deterministic Subtrajectory Clustering', Paper presented at 40th European Workshop on Computational Geometry (EuroCG 2024), Ioannina, Greece, 13/03/24 - 15/03/24 pp. 41.1-41.7.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.48550/arxiv.2402.13117","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2402.13117","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.icalp.2025.133","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2025.133","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/238acb26-3618-46a7-9397-a6b8a7ba1010","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/238acb26-3618-46a7-9397-a6b8a7ba1010","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van der Hoog, I, van der Horst, T & Ophelders, T 2025, Faster, Deterministic and Space Efficient Subtrajectory Clustering. in 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). vol. 52, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Leibniz International Proceedings in Informatics, vol. 334, pp. 1-18, EATCS International Colloquium on Automata, Languages, and Programming, Aarhus, Denmark, 08/07/2025. https://doi.org/https://arxiv.org/abs/2402.13117, https://doi.org/10.4230/LIPICS.ICALP.2025.133","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G505682253","display_name":null,"funder_award_id":"899987","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5767971500","display_name":"Efficient Distance Measures for Simplicial Complexes","funder_award_id":"VI.Veni.212.260","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"Given":[0],"a":[1,5,12,161,180],"trajectory":[2],"$T$":[3,27],"and":[4,49,68,121,141,175],"distance":[6,35],"$\u0394$,":[7],"we":[8,24,167],"wish":[9],"to":[10,37,51,70,87,187],"find":[11,52],"set":[13],"$C$":[14,46],"of":[15,17,55,92,102,112,172],"curves":[16],"complexity":[18],"at":[19,38],"most":[20],"$\\ell$,":[21],"such":[22],"that":[23,30,99],"can":[25],"cover":[26],"with":[28],"subcurves":[29],"each":[31],"are":[32],"within":[33],"Fr\u00e9chet":[34],"$\u0394$":[36],"least":[39],"one":[40],"curve":[41],"in":[42,139,164,183],"$C$.":[43],"We":[44,96,117,151],"call":[45],"an":[47,53,89],"$(\\ell,\u0394)$-clustering":[48,54],"aim":[50],"minimum":[56],"cardinality.":[57],"This":[58],"problem":[59],"variant":[60],"was":[61],"introduced":[62],"by":[63,160,179],"Akitaya":[64],"$et$":[65],"$al.$":[66],"(2021)":[67],"shown":[69],"be":[71,88],"NP-complete.":[72],"The":[73],"main":[74],"focus":[75],"has":[76],"therefore":[77],"been":[78],"on":[79],"bicriteria":[80],"approximation":[81,137],"algorithms,":[82],"allowing":[83],"for":[84],"the":[85,110,113,132,136,169],"clustering":[86,133],"$(\\ell,":[90,115],"\u0398(\u0394))$-clustering":[91],"roughly":[93],"optimal":[94,114],"size.":[95],"present":[97],"algorithms":[98,128],"construct":[100],"$(\\ell,4\u0394)$-clusterings":[101],"$\\mathcal{O}(k":[103,122],"\\log":[104,149],"n)$":[105,125],"size,":[106],"where":[107],"$k$":[108],"is":[109],"size":[111,142],"\u0394)$-clustering.":[116],"use":[118],"$\\mathcal{O}(n^3)$":[119],"space":[120,170],"n^3":[123],"\\log^4":[124],"time.":[126],"Our":[127],"significantly":[129],"improve":[130,176],"upon":[131],"quality":[134],"(improving":[135],"factor":[138,162,181],"$\u0394$)":[140],"(whenever":[143],"$\\ell":[144],"\\in":[145],"\u03a9(\\log":[146],"n":[147],"/":[148],"k)$).":[150],"offer":[152],"deterministic":[153,188],"running":[154],"times":[155],"improving":[156],"known":[157],"expected":[158],"bounds":[159],"near-linear":[163],"$\\ell$.":[165],"Additionally,":[166],"match":[168],"usage":[171],"prior":[173],"work,":[174],"it":[177],"substantially,":[178],"super-linear":[182],"$n\\ell$,":[184],"when":[185],"compared":[186],"results.":[189]},"counts_by_year":[],"updated_date":"2026-05-19T08:33:51.333923","created_date":"2024-02-24T00:00:00"}