{"id":"https://openalex.org/W2605144659","doi":"https://doi.org/10.1504/ijbic.2016.10004307","title":"A Mathematical Framework for Possibility Theory Based Hidden Markov Model","display_name":"A Mathematical Framework for Possibility Theory Based Hidden Markov Model","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2605144659","doi":"https://doi.org/10.1504/ijbic.2016.10004307","mag":"2605144659"},"language":"en","primary_location":{"id":"doi:10.1504/ijbic.2016.10004307","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijbic.2016.10004307","pdf_url":null,"source":{"id":"https://openalex.org/S121342672","display_name":"International Journal of Bio-Inspired Computation","issn_l":"1758-0366","issn":["1758-0366","1758-0374"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Bio-Inspired Computation","raw_type":"journal-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/A5084066204","display_name":"Neha Baranwal","orcid":null},"institutions":[{"id":"https://openalex.org/I26072440","display_name":"Indian Institute of Information Technology Allahabad","ror":"https://ror.org/03rgjt374","country_code":"IN","type":"education","lineage":["https://openalex.org/I26072440"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Neha Baranwal","raw_affiliation_strings":["Robotics and Artificial Intelligence Laboratory, Indian Institute of Information Technology, Allahabad, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics and Artificial Intelligence Laboratory, Indian Institute of Information Technology, Allahabad, India","institution_ids":["https://openalex.org/I26072440"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084066204"],"corresponding_institution_ids":["https://openalex.org/I26072440"],"apc_list":null,"apc_paid":null,"fwci":1.4777,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.83849994,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"1","issue":"1","first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11192","display_name":"Underwater Vehicles and Communication Systems","score":0.8149999976158142,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11192","display_name":"Underwater Vehicles and Communication Systems","score":0.8149999976158142,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hidden-markov-model","display_name":"Hidden Markov model","score":0.8026294708251953},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.7174316048622131},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.697109580039978},{"id":"https://openalex.org/keywords/forward-algorithm","display_name":"Forward algorithm","score":0.6511228680610657},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.5223473310470581},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5221531391143799},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4796717166900635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47288933396339417},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.46562713384628296},{"id":"https://openalex.org/keywords/hidden-semi-markov-model","display_name":"Hidden semi-Markov model","score":0.43273866176605225},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4271549582481384},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.42551711201667786},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40420517325401306},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.38209933042526245},{"id":"https://openalex.org/keywords/markov-property","display_name":"Markov property","score":0.3634929060935974},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3269254267215729},{"id":"https://openalex.org/keywords/variable-order-markov-model","display_name":"Variable-order Markov model","score":0.27644574642181396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2316223680973053}],"concepts":[{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.8026294708251953},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.7174316048622131},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.697109580039978},{"id":"https://openalex.org/C196455857","wikidata":"https://www.wikidata.org/wiki/Q5473264","display_name":"Forward algorithm","level":5,"score":0.6511228680610657},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.5223473310470581},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5221531391143799},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4796717166900635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47288933396339417},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.46562713384628296},{"id":"https://openalex.org/C64939953","wikidata":"https://www.wikidata.org/wiki/Q3859882","display_name":"Hidden semi-Markov model","level":5,"score":0.43273866176605225},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4271549582481384},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.42551711201667786},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40420517325401306},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.38209933042526245},{"id":"https://openalex.org/C189973286","wikidata":"https://www.wikidata.org/wiki/Q176695","display_name":"Markov property","level":4,"score":0.3634929060935974},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3269254267215729},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.27644574642181396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2316223680973053},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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.1504/ijbic.2016.10004307","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijbic.2016.10004307","pdf_url":null,"source":{"id":"https://openalex.org/S121342672","display_name":"International Journal of Bio-Inspired Computation","issn_l":"1758-0366","issn":["1758-0366","1758-0374"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Bio-Inspired Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4099999964237213,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2738224259","https://openalex.org/W3044198794","https://openalex.org/W2593596363","https://openalex.org/W2076166534","https://openalex.org/W2379938888","https://openalex.org/W2116722627","https://openalex.org/W4302561434","https://openalex.org/W1510894296","https://openalex.org/W2143650221","https://openalex.org/W1542903750"],"abstract_inverted_index":{"Exploring":[0],"correct":[1],"pattern":[2],"from":[3],"low":[4],"frequency":[5],"time":[6,91],"series":[7],"data":[8],"is":[9],"challenging.":[10],"In":[11,27],"resolving":[12],"this":[13,28],"problem,":[14],"the":[15,31],"concept":[16],"of":[17,39,56,61,64],"possibility":[18,46,57],"theory-based":[19],"hidden":[20],"Markov":[21],"model":[22],"(PTBHMM)":[23],"has":[24,84,89],"been":[25,43,76,85],"proposed.":[26],"paper,":[29],"all":[30],"three":[32],"fundamental":[33],"problems":[34],"(evaluation,":[35],"decoding":[36],"and":[37,71,78,93],"learning)":[38],"conventional":[40],"HMM":[41,65],"have":[42,52,75],"addressed":[44],"using":[45],"theory.":[47,58],"For":[48],"handling":[49],"uncertainty,":[50],"we":[51],"used":[53],"axiomatic":[54],"approach":[55],"Time":[59],"complexity":[60,92],"existing":[62],"solutions":[63,74],"(forward,":[66],"backward,":[67],"Viterbi,":[68],"Baum":[69],"Welch)":[70],"proposed":[72],"possibility-based":[73],"calculated":[77],"compared.":[79],"From":[80],"comparison":[81],"result,":[82],"it":[83],"found":[86],"that":[87],"PTBHMM":[88],"lesser":[90],"hence":[94],"will":[95],"be":[96],"more":[97],"suitable":[98],"for":[99],"real-time":[100],"applications.":[101]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}