{"id":"https://openalex.org/W2209953108","doi":"https://doi.org/10.1109/bigdata.2015.7363799","title":"Bandwidth-efficient distributed k-nearest-neighbor search with dynamic time warping","display_name":"Bandwidth-efficient distributed k-nearest-neighbor search with dynamic time warping","publication_year":2015,"publication_date":"2015-10-01","ids":{"openalex":"https://openalex.org/W2209953108","doi":"https://doi.org/10.1109/bigdata.2015.7363799","mag":"2209953108"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata.2015.7363799","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2015.7363799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-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/A5021381102","display_name":"Chin-Chi Hsu","orcid":"https://orcid.org/0000-0003-1880-8182"},"institutions":[{"id":"https://openalex.org/I4210098366","display_name":"Institute of Information Science, Academia Sinica","ror":"https://ror.org/00z83z196","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210098366","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Chin-Chi Hsu","raw_affiliation_strings":["Institute of Information Science, Academia Sinica, Taiwan"],"affiliations":[{"raw_affiliation_string":"Institute of Information Science, Academia Sinica, Taiwan","institution_ids":["https://openalex.org/I4210098366"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051914992","display_name":"Perng-Hwa Kung","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Perng-Hwa Kung","raw_affiliation_strings":["The Media Lab, Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"The Media Lab, Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013596889","display_name":"Mi-Yen Yeh","orcid":"https://orcid.org/0000-0001-7707-4487"},"institutions":[{"id":"https://openalex.org/I4210098366","display_name":"Institute of Information Science, Academia Sinica","ror":"https://ror.org/00z83z196","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210098366","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Mi-Yen Yeh","raw_affiliation_strings":["Institute of Information Science, Academia Sinica, Taiwan"],"affiliations":[{"raw_affiliation_string":"Institute of Information Science, Academia Sinica, Taiwan","institution_ids":["https://openalex.org/I4210098366"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087480257","display_name":"Shou-De Lin","orcid":"https://orcid.org/0000-0001-9970-1250"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shou-De Lin","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taiwan University, Taipei, TW"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan University, Taipei, TW","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014824446","display_name":"Phillip B. Gibbons","orcid":"https://orcid.org/0000-0001-6967-2735"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR","US"],"is_corresponding":false,"raw_author_name":"Phillip B. Gibbons","raw_affiliation_strings":["Computer Science Department and Electrical & Computer Engineering Department, Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Computer Science Department and Electrical & Computer Engineering Department, Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139","https://openalex.org/I4210156583"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5021381102"],"corresponding_institution_ids":["https://openalex.org/I4210098366"],"apc_list":null,"apc_paid":null,"fwci":1.436,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.8280667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"551","last_page":"560"},"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.9887999892234802,"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.9631999731063843,"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/dynamic-time-warping","display_name":"Dynamic time warping","score":0.8423117399215698},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.796550989151001},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7861391305923462},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6093486547470093},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5868958234786987},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5834752321243286},{"id":"https://openalex.org/keywords/similarity-measure","display_name":"Similarity measure","score":0.5826628804206848},{"id":"https://openalex.org/keywords/image-warping","display_name":"Image warping","score":0.5443678498268127},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5010743141174316},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.43677476048469543},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.42129117250442505},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3725656270980835},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29782843589782715},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07737165689468384}],"concepts":[{"id":"https://openalex.org/C88516994","wikidata":"https://www.wikidata.org/wiki/Q1268863","display_name":"Dynamic time warping","level":2,"score":0.8423117399215698},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.796550989151001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7861391305923462},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6093486547470093},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5868958234786987},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5834752321243286},{"id":"https://openalex.org/C2776517306","wikidata":"https://www.wikidata.org/wiki/Q29017317","display_name":"Similarity measure","level":2,"score":0.5826628804206848},{"id":"https://openalex.org/C157202957","wikidata":"https://www.wikidata.org/wiki/Q1659609","display_name":"Image warping","level":2,"score":0.5443678498268127},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5010743141174316},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.43677476048469543},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.42129117250442505},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3725656270980835},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29782843589782715},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07737165689468384},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata.2015.7363799","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2015.7363799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320307102","display_name":"Intel Corporation","ror":"https://ror.org/01ek73717"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1560013842","https://openalex.org/W1853995153","https://openalex.org/W1968010112","https://openalex.org/W2012609801","https://openalex.org/W2091921805","https://openalex.org/W2098759488","https://openalex.org/W2107856142","https://openalex.org/W2117526032","https://openalex.org/W2121149665","https://openalex.org/W2139440613","https://openalex.org/W2154680824","https://openalex.org/W2155919101","https://openalex.org/W2483430316","https://openalex.org/W2494980014","https://openalex.org/W4240592325","https://openalex.org/W4255556848","https://openalex.org/W6683353320","https://openalex.org/W6722243183"],"related_works":["https://openalex.org/W71572444","https://openalex.org/W1997383766","https://openalex.org/W2154472250","https://openalex.org/W2350336482","https://openalex.org/W2229352698","https://openalex.org/W2513074791","https://openalex.org/W2347413598","https://openalex.org/W4206434459","https://openalex.org/W2014214435","https://openalex.org/W2052451333"],"abstract_inverted_index":{"We":[0,147],"study":[1],"the":[2,28,53,86,96,102,121,132,144,153,156],"fundamental":[3],"k-nearest":[4],"neighbor":[5],"(kNN)":[6],"search":[7,145],"problem":[8],"on":[9,175],"distributed":[10,37],"time":[11,20,35,104,117,134],"series.":[12,118],"A":[13],"server":[14,154],"has":[15,79],"constantly":[16],"received":[17],"various":[18],"reference":[19,133],"series":[21,36],"Q":[22,61],"of":[23,34,41,55,123],"length":[24],"X":[25,46],"and":[26,47,51,136,155,166,178],"seeks":[27],"exact":[29],"kNN":[30,83,99],"over":[31],"a":[32,39,81,113,127,149],"collection":[33],"across":[38],"set":[40],"M":[42,48,64],"local":[43,157],"sites.":[44],"When":[45],"are":[49],"large,":[50],"when":[52],"amount":[54],"query":[56],"increases,":[57],"simply":[58],"sending":[59],"each":[60],"to":[62,75,191],"all":[63],"sites":[65,158],"incurs":[66],"high":[67],"communication":[68,164,187],"bandwidth":[69,188],"costs,":[70],"which":[71,109],"we":[72,94,125],"would":[73],"like":[74],"avoid.":[76],"Prior":[77],"work":[78],"presented":[80],"communication-efficient":[82,98],"algorithm":[84,100],"for":[85,101,116,131,163,170],"Euclidean":[87],"distance":[88],"similarity":[89,107],"measure.":[90],"In":[91],"this":[92],"paper,":[93],"present":[95,148],"first":[97],"dynamic":[103],"warping":[105],"(DTW)":[106],"measure,":[108],"is":[110],"generally":[111],"believed":[112],"better":[114],"measure":[115],"To":[119],"handle":[120],"complexities":[122],"DTW,":[124],"design":[126],"new":[128,150],"multi-resolution":[129,137,161],"structure":[130],"series,":[135],"lower":[138,168],"bounds":[139,169],"that":[140,159,183],"can":[141],"effectively":[142],"prune":[143],"space.":[146],"protocol":[151],"between":[152],"leverages":[160],"pruning":[162],"efficiency":[165],"cascading":[167],"computational":[171],"efficiency.":[172],"Empirical":[173],"studies":[174],"both":[176],"real-world":[177],"synthetic":[179],"data":[180],"sets":[181],"show":[182],"our":[184],"method":[185],"reduces":[186],"by":[189],"up":[190],"92%.":[192]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}