{"id":"https://openalex.org/W4226216126","doi":"https://doi.org/10.1109/tkde.2022.3167257","title":"Efficient Range and kNN Twin Subsequence Search in Time Series","display_name":"Efficient Range and kNN Twin Subsequence Search in Time Series","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4226216126","doi":"https://doi.org/10.1109/tkde.2022.3167257"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2022.3167257","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2022.3167257","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048688272","display_name":"Georgios Chatzigeorgakidis","orcid":"https://orcid.org/0000-0002-5965-7934"},"institutions":[{"id":"https://openalex.org/I4210156054","display_name":"Athena Research and Innovation Center In Information Communication & Knowledge Technologies","ror":"https://ror.org/0576by029","country_code":"GR","type":"facility","lineage":["https://openalex.org/I4210156054"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Georgios Chatzigeorgakidis","raw_affiliation_strings":["Information Management Systems Institute, Athena Research Center, 112154 Marousi, Attica, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Management Systems Institute, Athena Research Center, 112154 Marousi, Attica, Greece","institution_ids":["https://openalex.org/I4210156054"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087768208","display_name":"Dimitrios Skoutas","orcid":"https://orcid.org/0000-0002-6118-5227"},"institutions":[{"id":"https://openalex.org/I4210156054","display_name":"Athena Research and Innovation Center In Information Communication & Knowledge Technologies","ror":"https://ror.org/0576by029","country_code":"GR","type":"facility","lineage":["https://openalex.org/I4210156054"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Dimitris Skoutas","raw_affiliation_strings":["IMSI, Athena Research and Innovation Center in Information Communication and Knowledge Technologies, 112154 Athens, Attica, Greece, 15125"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMSI, Athena Research and Innovation Center in Information Communication and Knowledge Technologies, 112154 Athens, Attica, Greece, 15125","institution_ids":["https://openalex.org/I4210156054"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071365762","display_name":"Kostas Patroumpas","orcid":"https://orcid.org/0000-0003-3334-8671"},"institutions":[{"id":"https://openalex.org/I4210156054","display_name":"Athena Research and Innovation Center In Information Communication & Knowledge Technologies","ror":"https://ror.org/0576by029","country_code":"GR","type":"facility","lineage":["https://openalex.org/I4210156054"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Kostas Patroumpas","raw_affiliation_strings":["Information Management Systems Institute, Athena Research Center, 112154 Marousi, Attica, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Management Systems Institute, Athena Research Center, 112154 Marousi, Attica, Greece","institution_ids":["https://openalex.org/I4210156054"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053726723","display_name":"Themis Palpanas","orcid":"https://orcid.org/0000-0002-8031-0265"},"institutions":[{"id":"https://openalex.org/I110736937","display_name":"D\u00e9l\u00e9gation Paris 5","ror":"https://ror.org/02e0y6e06","country_code":"FR","type":"government","lineage":["https://openalex.org/I110736937","https://openalex.org/I154526488"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Themis Palpanas","raw_affiliation_strings":["Department of Mathematics and Computer Science, Paris Descartes University, Paris, Ile de France, France, 75006"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Paris Descartes University, Paris, Ile de France, France, 75006","institution_ids":["https://openalex.org/I110736937","https://openalex.org/I204730241"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000205279","display_name":"Spiros Athanasiou","orcid":"https://orcid.org/0000-0003-0208-014X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Spiros Athanasiou","raw_affiliation_strings":["Information Management Systems Institute, Athena Research Center, 112154 Marousi, Attiki, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Management Systems Institute, Athena Research Center, 112154 Marousi, Attiki, Greece","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009411092","display_name":"Spiros Skiadopoulos","orcid":"https://orcid.org/0000-0003-3465-8292"},"institutions":[{"id":"https://openalex.org/I158716096","display_name":"University of Peloponnese","ror":"https://ror.org/04d4d3c02","country_code":"GR","type":"education","lineage":["https://openalex.org/I158716096"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Spiros Skiadopoulos","raw_affiliation_strings":["Department of Computer Science and Technology, University of Peloponnese, Tripolis, Arcadia, Greece, 22100"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, University of Peloponnese, Tripolis, Arcadia, Greece, 22100","institution_ids":["https://openalex.org/I158716096"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6968,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.83530033,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9760000109672546,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11309","display_name":"Music and Audio Processing","score":0.9334999918937683,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/subsequence","display_name":"Subsequence","score":0.8838832378387451},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.7471897602081299},{"id":"https://openalex.org/keywords/dynamic-time-warping","display_name":"Dynamic time warping","score":0.7301583290100098},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7141546010971069},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6970003843307495},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.6565389037132263},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5544115304946899},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.48153096437454224},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.4714202284812927},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4689236283302307},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4645502269268036},{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.463828444480896},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.46246641874313354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4411984980106354},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3823968172073364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25981080532073975},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22254282236099243}],"concepts":[{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.8838832378387451},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.7471897602081299},{"id":"https://openalex.org/C88516994","wikidata":"https://www.wikidata.org/wiki/Q1268863","display_name":"Dynamic time warping","level":2,"score":0.7301583290100098},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7141546010971069},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6970003843307495},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.6565389037132263},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5544115304946899},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.48153096437454224},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.4714202284812927},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4689236283302307},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4645502269268036},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.463828444480896},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.46246641874313354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4411984980106354},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3823968172073364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25981080532073975},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22254282236099243},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tkde.2022.3167257","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2022.3167257","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W646924575","https://openalex.org/W1513731586","https://openalex.org/W1587157435","https://openalex.org/W1973222433","https://openalex.org/W1976345147","https://openalex.org/W1986830331","https://openalex.org/W1997741691","https://openalex.org/W2007398824","https://openalex.org/W2028020839","https://openalex.org/W2042591571","https://openalex.org/W2066796814","https://openalex.org/W2068793464","https://openalex.org/W2098759488","https://openalex.org/W2099302229","https://openalex.org/W2122171709","https://openalex.org/W2123049307","https://openalex.org/W2129270900","https://openalex.org/W2138087993","https://openalex.org/W2155758218","https://openalex.org/W2161621125","https://openalex.org/W2164274563","https://openalex.org/W2405982425","https://openalex.org/W2584499795","https://openalex.org/W2780382071","https://openalex.org/W2900440391","https://openalex.org/W2902708880","https://openalex.org/W2914343162","https://openalex.org/W2967756136","https://openalex.org/W2981881106","https://openalex.org/W3013240994","https://openalex.org/W3030428326","https://openalex.org/W3088131079","https://openalex.org/W3105021520","https://openalex.org/W3165728814","https://openalex.org/W4240774490","https://openalex.org/W4253412457","https://openalex.org/W6659467978","https://openalex.org/W6780330048","https://openalex.org/W6793191580"],"related_works":["https://openalex.org/W2289394377","https://openalex.org/W2968843500","https://openalex.org/W2724740909","https://openalex.org/W3012501802","https://openalex.org/W2110372165","https://openalex.org/W3018902767","https://openalex.org/W2567036944","https://openalex.org/W2470694417","https://openalex.org/W1536701803","https://openalex.org/W4226216126"],"abstract_inverted_index":{"Analyzing":[0],"time":[1,20,87,146],"series":[2,21,88,147],"data":[3],"is":[4,59,121],"crucial":[5],"for":[6],"many":[7],"applications.":[8],"In":[9,50],"particular,":[10],"subsequence":[11,32,96,111],"search":[12,33,112],"refers":[13],"to":[14,26,93,106,133],"finding":[15],"subsequences":[16,157],"within":[17],"an":[18],"input":[19],"T":[22],"that":[23,116,152],"are":[24],"similar":[25,80],"a":[27,102,118],"query":[28],"sequence":[29],"Q.":[30],"Existing":[31],"approaches":[34,143],"typically":[35],"employ":[36],"Euclidean":[37],"distance":[38,119],"or":[39],"Dynamic":[40],"Time":[41],"Warping":[42],"as":[43],"similarity":[44],"measures":[45],"and":[46],"address":[47],"range":[48],"queries.":[49,113,136],"this":[51],"paper,":[52],"we":[53,99,125],"focus":[54],"on":[55],"Chebyshev":[56],"distance,":[57],"which":[58],"the":[60,70,107],"largest":[61],"difference":[62],"between":[63],"each":[64],"individual":[65],"pair":[66],"of":[67,73,109],"points":[68],"across":[69],"entire":[71],"length":[72],"two":[74],"compared":[75],"subsequences.":[76],"We":[77,82],"call":[78],"such":[79],"pairstwins.":[81],"first":[83],"show":[84,126],"how":[85,127],"existing":[86],"indices":[89],"can":[90,129,154],"be":[91,131],"extended":[92],"perform":[94],"twin":[95,110,156],"search.":[97],"Then,":[98],"introduce":[100],"TS-Index,":[101],"novel":[103],"index":[104],"tailored":[105],"computation":[108],"Moreover,":[114],"given":[115],"specifying":[117],"threshold":[120],"often":[122],"not":[123],"straightforward,":[124],"TS-Index":[128,153],"also":[130],"used":[132],"evaluate":[134],"kNN":[135],"Our":[137],"extensive":[138],"experimental":[139],"evaluation":[140],"compares":[141],"these":[142],"using":[144],"real":[145],"datasets.":[148],"The":[149],"results":[150],"demonstrate":[151],"retrieve":[155],"faster":[158],"than":[159],"all":[160],"other":[161],"methods":[162],"under":[163],"various":[164],"conditions.":[165]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
