{"id":"https://openalex.org/W2130882168","doi":"https://doi.org/10.1109/isit.2009.5205678","title":"Unrestricted BIC context tree estimation for not necessarily finite memory processes","display_name":"Unrestricted BIC context tree estimation for not necessarily finite memory processes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2130882168","doi":"https://doi.org/10.1109/isit.2009.5205678","mag":"2130882168"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205678","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205678","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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/A5068122599","display_name":"Zsolt Talata","orcid":null},"institutions":[{"id":"https://openalex.org/I146416000","display_name":"University of Kansas","ror":"https://ror.org/001tmjg57","country_code":"US","type":"education","lineage":["https://openalex.org/I146416000"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zsolt Talata","raw_affiliation_strings":["Department of Mathematics, University of Kansas, Lawrence, KS, USA","Department of Mathematics, University of Kansas Lawrence, 66045, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kansas, Lawrence, KS, USA","institution_ids":["https://openalex.org/I146416000"]},{"raw_affiliation_string":"Department of Mathematics, University of Kansas Lawrence, 66045, USA","institution_ids":["https://openalex.org/I146416000"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054666993","display_name":"Tyrone E. Duncan","orcid":"https://orcid.org/0000-0002-6664-9967"},"institutions":[{"id":"https://openalex.org/I146416000","display_name":"University of Kansas","ror":"https://ror.org/001tmjg57","country_code":"US","type":"education","lineage":["https://openalex.org/I146416000"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tyrone Duncan","raw_affiliation_strings":["Department of Mathematics, University of Kansas, Lawrence, KS, USA","Department of Mathematics, University of Kansas Lawrence, 66045, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kansas, Lawrence, KS, USA","institution_ids":["https://openalex.org/I146416000"]},{"raw_affiliation_string":"Department of Mathematics, University of Kansas Lawrence, 66045, USA","institution_ids":["https://openalex.org/I146416000"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068122599"],"corresponding_institution_ids":["https://openalex.org/I146416000"],"apc_list":null,"apc_paid":null,"fwci":0.8724,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.8087202,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"724","last_page":"728"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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.9911999702453613,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9850999712944031,"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/mathematics","display_name":"Mathematics","score":0.655147910118103},{"id":"https://openalex.org/keywords/bayesian-information-criterion","display_name":"Bayesian information criterion","score":0.6208270788192749},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6060723066329956},{"id":"https://openalex.org/keywords/estimator","display_name":"Estimator","score":0.580945611000061},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.50811767578125},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4483633041381836},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.43127843737602234},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.34897786378860474},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3446672260761261},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11837181448936462}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.655147910118103},{"id":"https://openalex.org/C168136583","wikidata":"https://www.wikidata.org/wiki/Q1988242","display_name":"Bayesian information criterion","level":2,"score":0.6208270788192749},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6060723066329956},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.580945611000061},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.50811767578125},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4483633041381836},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.43127843737602234},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.34897786378860474},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3446672260761261},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11837181448936462},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5205678","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205678","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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":20,"referenced_works":["https://openalex.org/W1531679840","https://openalex.org/W1533169541","https://openalex.org/W1979625845","https://openalex.org/W1999120268","https://openalex.org/W2011485152","https://openalex.org/W2039033710","https://openalex.org/W2053807426","https://openalex.org/W2082430318","https://openalex.org/W2082967074","https://openalex.org/W2103396489","https://openalex.org/W2105342805","https://openalex.org/W2117090766","https://openalex.org/W2129902114","https://openalex.org/W2139789442","https://openalex.org/W2163294786","https://openalex.org/W2171560765","https://openalex.org/W2183235533","https://openalex.org/W2573934436","https://openalex.org/W2809627566","https://openalex.org/W6752446581"],"related_works":["https://openalex.org/W2105284594","https://openalex.org/W2617987378","https://openalex.org/W1502087262","https://openalex.org/W2509820422","https://openalex.org/W3122388856","https://openalex.org/W2107617395","https://openalex.org/W2626271282","https://openalex.org/W2999695592","https://openalex.org/W2963415778","https://openalex.org/W3187368641"],"abstract_inverted_index":{"Context":[0],"trees":[1,106,121],"of":[2,27,34,50,54,111,117,155],"arbitrary":[3],"stationary":[4],"ergodic":[5],"processes":[6],"with":[7,145],"finite":[8,112],"alphabets":[9],"are":[10],"considered.":[11],"Such":[12],"a":[13,18,32,46,148],"process":[14,133],"is":[15,42,135],"not":[16],"necessarily":[17],"Markov":[19],"chain,":[20],"so":[21],"the":[22,37,51,55,67,75,80,99,104,115,118,132,139,153,156,159,164],"context":[23,52,61,69,77,105,120,166],"tree":[24,53,78,167],"may":[25],"be":[26,110],"infinite":[28],"depth.":[29],"Calculated":[30],"from":[31],"sample":[33],"size":[35],"n,":[36],"Bayesian":[38],"information":[39],"criterion":[40],"(BIC)":[41],"shown":[43,137],"to":[44,84,95,109,168],"provide":[45],"strongly":[47],"consistent":[48],"estimator":[49,161],"process,":[56],"via":[57],"minimization":[58],"over":[59],"hypothetical":[60,68,119],"trees,":[62],"without":[63],"any":[64,85],"restriction":[65],"on":[66,131],"trees.":[70],"Strong":[71],"consistency":[72],"means":[73],"that":[74,138],"estimated":[76],"recovers":[79],"true":[81,165],"one":[82],"up":[83],"fixed":[86],"level":[87,140],"K,":[88],"eventually":[89],"almost":[90],"surely":[91],"as":[92],"n":[93,146],"tends":[94],"infinity.":[96],"This":[97],"generalizes":[98],"previous":[100],"results,":[101],"where":[102],"either":[103],"were":[107],"assumed":[108],"depth":[113,116],"or":[114],"was":[122],"bounded":[123],"by":[124,152],"O(log":[125],"n).":[126],"Moreover,":[127],"under":[128],"some":[129],"conditions":[130],"it":[134],"also":[136],"K":[141],"above":[142],"can":[143,162],"grow":[144],"at":[147],"specific":[149],"rate":[150],"determined":[151],"distribution":[154],"process;":[157],"thus":[158],"BIC":[160],"recover":[163],"larger":[169,171],"and":[170],"depths.":[172]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}