{"id":"https://openalex.org/W2975425564","doi":"https://doi.org/10.1109/isit.2019.8849595","title":"Sequential Change Detection Based on Universal Compression for Markov Sources","display_name":"Sequential Change Detection Based on Universal Compression for Markov Sources","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2975425564","doi":"https://doi.org/10.1109/isit.2019.8849595","mag":"2975425564"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849595","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","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/A5055337386","display_name":"Ashwin Verma","orcid":"https://orcid.org/0000-0001-5473-1966"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Verma","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, University of California, San Diego"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of California, San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081395120","display_name":"Rahul Bansal","orcid":"https://orcid.org/0000-0002-9455-2521"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"R. K. Bansal","raw_affiliation_strings":["Dept. of Electrical Engineering, Indian Institute of Technology, Kanpur"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, Indian Institute of Technology, Kanpur","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055337386"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":0.2894,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67093182,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2189","last_page":"2193"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9984999895095825,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9984999895095825,"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/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.9925000071525574,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9923999905586243,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cusum","display_name":"CUSUM","score":0.7574453353881836},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5768599510192871},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5374477505683899},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.47488611936569214},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.474489688873291},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45744889974594116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44400039315223694},{"id":"https://openalex.org/keywords/asymptotic-distribution","display_name":"Asymptotic distribution","score":0.43327975273132324},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43197399377822876},{"id":"https://openalex.org/keywords/estimator","display_name":"Estimator","score":0.3983244001865387},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.225458562374115}],"concepts":[{"id":"https://openalex.org/C178518018","wikidata":"https://www.wikidata.org/wiki/Q1024555","display_name":"CUSUM","level":2,"score":0.7574453353881836},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5768599510192871},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5374477505683899},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.47488611936569214},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.474489688873291},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45744889974594116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44400039315223694},{"id":"https://openalex.org/C65778772","wikidata":"https://www.wikidata.org/wiki/Q12345341","display_name":"Asymptotic distribution","level":3,"score":0.43327975273132324},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43197399377822876},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.3983244001865387},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.225458562374115}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849595","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W601863383","https://openalex.org/W2055309977","https://openalex.org/W2056339533","https://openalex.org/W2079733395","https://openalex.org/W2112072995","https://openalex.org/W2171090762","https://openalex.org/W2887842855"],"related_works":["https://openalex.org/W2056974159","https://openalex.org/W2753583628","https://openalex.org/W2138199368","https://openalex.org/W1788036421","https://openalex.org/W4301776783","https://openalex.org/W4384561785","https://openalex.org/W1972553508","https://openalex.org/W2069885834","https://openalex.org/W1511751337","https://openalex.org/W2899018032"],"abstract_inverted_index":{"A":[0],"universal":[1,22,133],"compression":[2],"code":[3],"can":[4],"act":[5],"as":[6],"an":[7,94],"estimator":[8],"for":[9,66,93,150],"the":[10,37,44,49,90,104,124,138,147,151,154,160,164,169],"distribution":[11,51],"of":[12,21,36,57,72,89,106,123,140,163],"a":[13,34,67,101,110,120],"finite":[14],"alphabet":[15],"finite-order":[16],"Markov":[17],"source.":[18],"This":[19,80],"property":[20],"codes":[23],"was":[24,60,82,113],"exploited":[25],"by":[26,130],"Jacob":[27],"and":[28,70],"Bansal":[29],"in":[30,40,85,143,168],"[5]":[31],"to":[32,42,62,145],"propose":[33],"modification":[35],"CUSUM":[38,92,127],"test":[39,59,129,152,167],"order":[41,144],"solve":[43],"change":[45],"detection":[46],"problem":[47],"when":[48],"post-change":[50],"is":[52],"not":[53],"known.":[54],"The":[55],"performance":[56,88],"this":[58,116],"proven":[61],"be":[63],"asymptotically":[64],"optimal":[65],"memoryless":[68],"sources":[69,73],"class":[71],"with":[74],"memory":[75],"under":[76,97,153],"Lorden's":[77],"minimax":[78],"formulation.":[79],"study":[81],"further":[83,158],"extended":[84],"[9]":[86],"where":[87],"modified":[91,121,165],"i.i.d.":[95],"setting":[96],"Lai's":[98],"criterion":[99],"involving":[100],"constraint":[102],"on":[103],"probability":[105],"false":[107],"alarm":[108],"within":[109],"window":[111,125],"(PFAW)":[112],"analyzed.":[114],"In":[115],"paper,":[117],"we":[118],"introduce":[119],"version":[122],"limited":[126],"(WL-CUSUM)":[128],"incorporating":[131],"strongly":[132],"code.":[134],"We":[135,157],"closely":[136],"follow":[137],"work":[139],"Lai":[141],"[8]":[142],"prove":[146,159],"asymptotic":[148,161],"optimality":[149,162],"PFAW":[155],"criterion.":[156],"WL-CUSUM":[166],"Bayesian":[170],"setting.":[171]},"counts_by_year":[{"year":2022,"cited_by_count":2}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}