kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Powering hidden markov model by neural network based generative models
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0003-0394-1087
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0003-0166-1356
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0003-2638-6047
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0001-7182-9543
2020 (English)In: ECAI 2020: 24TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, IOS Press BV , 2020, p. 1324-1331Conference paper, Published paper (Refereed)
Abstract [en]

Hidden Markov model (HMM) has been successfully used for sequential data modeling problems. In this work, we propose to power the modeling capacity of HMM by bringing in neural network based generative models. The proposed model is termed as GenHMM. In the proposed GenHMM, each HMM hidden state is associated with a neural network based generative model that has tractability of exact likelihood and provides efficient likelihood computation. A generative model in GenHMM consists of a mixture of generators that are realized by flow models. A learning algorithm for GenHMM is proposed in expectation-maximization framework. The convergence of the learning GenHMM is analyzed. We demonstrate the efficiency of GenHMM by classification tasks on practical sequential data. 

Place, publisher, year, edition, pages
IOS Press BV , 2020. p. 1324-1331
Keywords [en]
Clustering algorithms, Learning algorithms, Maximum principle, Neural networks, Classification tasks, Expectation-Maximization frameworks, Flow model, Generative model, Hidden state, Likelihood computation, Model problems, Sequential data, Hidden Markov models
National Category
Probability Theory and Statistics
Identifiers
URN: urn:nbn:se:kth:diva-286482DOI: 10.3233/FAIA200235ISI: 000650971301073Scopus ID: 2-s2.0-85091756873OAI: oai:DiVA.org:kth-286482DiVA, id: diva2:1511179
Conference
ECAI 2020: 24TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE 29 August 2020 through 8 September 2020
Note

QC 20210621

Available from: 2020-12-17 Created: 2020-12-17 Last updated: 2023-03-30Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Liu, DongHonore, AntoineChatterjee, SaikatRasmussen, Lars Kildehöj

Search in DiVA

By author/editor
Liu, DongHonore, AntoineChatterjee, SaikatRasmussen, Lars Kildehöj
By organisation
Information Science and Engineering
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 188 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf