{"id":"https://openalex.org/W2128267565","doi":"https://doi.org/10.1109/ijcnn.2008.4633978","title":"Pseudometrics for time series classification by nearest neighbor","display_name":"Pseudometrics for time series classification by nearest neighbor","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2128267565","doi":"https://doi.org/10.1109/ijcnn.2008.4633978","mag":"2128267565"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn.2008.4633978","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2008.4633978","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)","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/A5077004298","display_name":"Teesid Korsrilabutr","orcid":null},"institutions":[{"id":"https://openalex.org/I158708052","display_name":"Chulalongkorn University","ror":"https://ror.org/028wp3y58","country_code":"TH","type":"education","lineage":["https://openalex.org/I158708052"]}],"countries":["TH"],"is_corresponding":true,"raw_author_name":"Teesid Korsrilabutr","raw_affiliation_strings":["Department of Computer Engineering, Chulalongkom University, Bangkok, Thailand","Dept. of Comput. Eng., Chulalongkorn Univ., Bangkok"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Chulalongkom University, Bangkok, Thailand","institution_ids":["https://openalex.org/I158708052"]},{"raw_affiliation_string":"Dept. of Comput. Eng., Chulalongkorn Univ., Bangkok","institution_ids":["https://openalex.org/I158708052"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065724368","display_name":"Boonserm Kijsirikul","orcid":"https://orcid.org/0000-0002-9046-7151"},"institutions":[{"id":"https://openalex.org/I158708052","display_name":"Chulalongkorn University","ror":"https://ror.org/028wp3y58","country_code":"TH","type":"education","lineage":["https://openalex.org/I158708052"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Boonserm Kijsirikul","raw_affiliation_strings":["Department of Computer Engineering, Chulalongkom University, Bangkok, Thailand","Dept. of Comput. Eng., Chulalongkorn Univ., Bangkok"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Chulalongkom University, Bangkok, Thailand","institution_ids":["https://openalex.org/I158708052"]},{"raw_affiliation_string":"Dept. of Comput. Eng., Chulalongkorn Univ., Bangkok","institution_ids":["https://openalex.org/I158708052"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077004298"],"corresponding_institution_ids":["https://openalex.org/I158708052"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15669061,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":null,"first_page":"1382","last_page":"1389"},"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.9854000210762024,"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.9620000123977661,"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/subadditivity","display_name":"Subadditivity","score":0.9577368497848511},{"id":"https://openalex.org/keywords/dynamic-time-warping","display_name":"Dynamic time warping","score":0.8401939868927002},{"id":"https://openalex.org/keywords/distance-measures","display_name":"Distance measures","score":0.7106410264968872},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6929981708526611},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.6589466333389282},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6400289535522461},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6194303631782532},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.6044237613677979},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5226245522499084},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5152459740638733},{"id":"https://openalex.org/keywords/similarity-measure","display_name":"Similarity measure","score":0.48824694752693176},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4362800419330597},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.41591113805770874},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.414837509393692},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3763195872306824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3244638442993164},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.320792019367218},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.0942075252532959},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07742750644683838}],"concepts":[{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.9577368497848511},{"id":"https://openalex.org/C88516994","wikidata":"https://www.wikidata.org/wiki/Q1268863","display_name":"Dynamic time warping","level":2,"score":0.8401939868927002},{"id":"https://openalex.org/C2639959","wikidata":"https://www.wikidata.org/wiki/Q1344778","display_name":"Distance measures","level":2,"score":0.7106410264968872},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6929981708526611},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.6589466333389282},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6400289535522461},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6194303631782532},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.6044237613677979},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5226245522499084},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5152459740638733},{"id":"https://openalex.org/C2776517306","wikidata":"https://www.wikidata.org/wiki/Q29017317","display_name":"Similarity measure","level":2,"score":0.48824694752693176},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4362800419330597},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.41591113805770874},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.414837509393692},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3763195872306824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3244638442993164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.320792019367218},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0942075252532959},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07742750644683838},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn.2008.4633978","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2008.4633978","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W28191744","https://openalex.org/W1597504361","https://openalex.org/W1603845670","https://openalex.org/W1647671624","https://openalex.org/W1982570277","https://openalex.org/W2046144220","https://openalex.org/W2091921805","https://openalex.org/W2113119382","https://openalex.org/W2122111042","https://openalex.org/W2128160875","https://openalex.org/W2132585078","https://openalex.org/W2137089646","https://openalex.org/W2157092487","https://openalex.org/W6601184142","https://openalex.org/W6636915900","https://openalex.org/W6682969285"],"related_works":["https://openalex.org/W4206434459","https://openalex.org/W2090890022","https://openalex.org/W2982697608","https://openalex.org/W4281630436","https://openalex.org/W2792071264","https://openalex.org/W2014214435","https://openalex.org/W3011721819","https://openalex.org/W4389080932","https://openalex.org/W2128267565","https://openalex.org/W2052451333"],"abstract_inverted_index":{"Despite":[0],"the":[1,9,18,32,54,80,88,98,114],"success":[2],"of":[3,75,108],"its":[4],"applications":[5],"in":[6],"many":[7],"areas,":[8],"dynamic":[10],"time":[11,30,121],"warping":[12],"(DTW)":[13],"distance":[14,27,48,69,76,116],"does":[15],"not":[16],"satisfy":[17],"triangle":[19],"inequality":[20],"(subadditivity).":[21],"Once":[22],"we":[23],"have":[24,35],"a":[25,72],"subadditive":[26,68],"measure":[28,33,49],"for":[29,66,120],"series,":[31],"will":[34],"at":[36],"least":[37],"one":[38,43],"significant":[39],"advantage":[40],"over":[41],"DTW;":[42],"can":[44,91],"directly":[45],"plug":[46],"such":[47],"into":[50],"systems":[51],"which":[52],"exploit":[53],"subadditivity":[55],"to":[56,94,101],"perform":[57],"faster":[58],"similarity":[59],"search":[60],"techniques.":[61],"We":[62],"propose":[63],"two":[64],"frameworks":[65],"designing":[67],"measures":[70,77,117],"and":[71,90],"few":[73],"examples":[74],"resulting":[78],"from":[79,97],"frameworks.":[81],"One":[82],"framework":[83,100],"is":[84],"more":[85],"general":[86],"than":[87],"other":[89,99],"be":[92],"used":[93],"tailor":[95],"distances":[96],"gain":[102],"better":[103],"classification":[104,111],"performance.":[105],"Experimental":[106],"results":[107],"nearest":[109],"neighbor":[110],"showed":[112],"that":[113],"designed":[115],"are":[118],"practical":[119],"series":[122],"classification.":[123]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}