{"id":"https://openalex.org/W7097233160","doi":null,"title":"An Efficient Self-Tuning Explicit and Adaptive HMM with Duration Algorithm","display_name":"An Efficient Self-Tuning Explicit and Adaptive HMM with Duration Algorithm","publication_year":2013,"publication_date":"2013-08-09","ids":{"openalex":"https://openalex.org/W7097233160"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.321.2331","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.321.2331","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uno.edu/~winters/ESTEAHMMD_paper.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5003810007","display_name":"Stephen N. Winters-Hilt","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Winters-hilt","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Z. Jiang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Z. Jiang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.49729707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.43290001153945923,"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/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.43290001153945923,"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/T10201","display_name":"Speech Recognition and Synthesis","score":0.3953000009059906,"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/T11269","display_name":"Algorithms and Data Compression","score":0.019099999219179153,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/auto-tuning","display_name":"auto-tuning","score":0.7089999914169312},{"id":"https://openalex.org/keywords/forward-backward-algorithm","display_name":"forward-backward algorithm","score":0.781000018119812},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.9409999847412109},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.7129999995231628}],"concepts":[{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.8575000166893005},{"id":"https://openalex.org/C196455857","wikidata":"https://www.wikidata.org/wiki/Q5473264","display_name":"Forward algorithm","level":5,"score":0.7718999981880188},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.6915000081062317},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6534000039100647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6478999853134155},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.628000020980835},{"id":"https://openalex.org/C64939953","wikidata":"https://www.wikidata.org/wiki/Q3859882","display_name":"Hidden semi-Markov model","level":5,"score":0.6103000044822693},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5741000175476074},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.507099986076355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45190000534057617},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4507000148296356},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.4325999915599823},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.42829999327659607},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40059998631477356},{"id":"https://openalex.org/C112758219","wikidata":"https://www.wikidata.org/wiki/Q16038819","display_name":"Duration (music)","level":2,"score":0.36640000343322754},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.34549999237060547},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.33309999108314514},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3147999942302704},{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.29670000076293945},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.29179999232292175},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C101454708","wikidata":"https://www.wikidata.org/wiki/Q17106019","display_name":"Standard Model (mathematical formulation)","level":3,"score":0.2800999879837036},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.2752000093460083}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.321.2331","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.321.2331","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uno.edu/~winters/ESTEAHMMD_paper.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2119545313","https://openalex.org/W2106368941","https://openalex.org/W2090394430","https://openalex.org/W2087305127","https://openalex.org/W2385472426","https://openalex.org/W114764461","https://openalex.org/W2793945053","https://openalex.org/W2146143523","https://openalex.org/W2375417030","https://openalex.org/W7099001927"],"abstract_inverted_index":{"*":[0,1],"ZJ":[2],"is":[3,66,73,93,117,177,195],"an":[4,10,182,219],"equally":[5],"contributing":[6],"author":[7],"We":[8],"describe":[9],"efficient,":[11],"self-tuning,":[12],"explicit":[13],"and":[14,71,129,163,194,213,232],"adaptive,":[15],"hidden":[16,26,41,102],"Markov":[17,27,42],"model":[18,28,43],"with":[19,44],"Duration":[20],"(the":[21],"ESTEAHMMD":[22,153],"algorithm).":[23],"The":[24,114,152],"standard":[25,40,56,202,226],"(HMM)":[29],"constrains":[30],"state":[31,98,133,160,192],"occupancy":[32],"durations":[33],"to":[34,198,210],"be":[35,138],"geometrically":[36],"distributed,":[37],"while":[38,100],"the":[39,67,74,94,158,178,186,189,225],"duration":[45],"(HMMD)":[46,81],"addresses":[47],"this":[48],"limitation,":[49],"but":[50],"at":[51,218,233],"significant":[52],"computational":[53],"expense.":[54],"A":[55],"HMM":[57,80,227],"requires":[58,82,105,164],"computation":[59,83,106,165],"of":[60,69,76,84,107,166,185],"order":[61,85,108,167],"O(T":[62,86,109,168],"NN),":[63],"where":[64,91,174],"T":[65,89,112,171],"period":[68],"observations":[70],"N":[72,124,229],"number":[75,180],"states.":[77],"An":[78],"explicitduration":[79],"NN":[87,110,169],"+":[88,111,170],"ND2),":[90],"D":[92,122,175],"maximum":[95,132,159],"interval":[96,134,161,190],"between":[97,191],"transitions,":[99,193],"a":[101,131,208],"semi-Markov":[103],"HMMD":[104,216],"ND).":[113],"latter":[115],"improvement":[116],"still":[118],"fundamentally":[119],"limited":[120],"if":[121],"\u226b":[123],"(where":[125],"D>":[126],"500,":[127],"typically),":[128],"imposes":[130],"constraint":[135,162],"that":[136],"may":[137],"too":[139],"restrictive":[140],"in":[141,148,181],"some":[142],"situations":[143],"such":[144],"as":[145],"intron":[146],"modeling":[147],"gene":[149],"structure":[150],"identification.":[151],"algorithm":[154,215],"proposed":[155],"here":[156],"relaxes":[157],"ND":[172],"\u2217),":[173],"\u2217":[176],"bin":[179],"adaptive":[183],"representation":[184],"distribution":[187],"on":[188],"typically":[196],"reducible":[197],"\u223c":[199],"50":[200],"for":[201,228],"single-peak":[203],"probability":[204],"distributions.":[205],"This":[206],"provides":[207],"means":[209],"do":[211],"forward-backward":[212],"Viterbi":[214],"computations":[217],"expense":[220,236],"only":[221],"marginally":[222],"greater":[223],"than":[224],"<":[230],"50;":[231],"negligible":[234],"added":[235],"when":[237]},"counts_by_year":[],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2025-10-27T00:00:00"}