EP 2686796 A1 20140122 - METHOD FOR UNCOVERING HIDDEN MARKOV MODELS
Title (en)
METHOD FOR UNCOVERING HIDDEN MARKOV MODELS
Title (de)
VERFAHREN ZUM FREILEGEN VON VERBORGENEN MARKOV-MODELLEN
Title (fr)
PROCÉDÉ POUR DÉCOUVRIR DES MODÈLES DE MARKOV CACHÉS
Publication
Application
Priority
US 2011028302 W 20110314
Abstract (en)
[origin: WO2012125146A1] The invention uses the ModelGrower program to generate possible candidates from an original or aggregated model. An isomorphic reduction program operates on the candidates to identify and exclude isomorphic models. A Markov model evaluation and optimization program operates on the remaining non-isomorphic candidates. The candidates are optimized and the ones that most closely conform to the data are kept. The best optimized candidate of one stage becomes the starting candidate for the next stage where ModelGrower and the other programs operate on the optimized candidate to generate a new optimized candidate. The invention repeats the steps of growing, excluding isomorphs, evaluating and optimizing until such repetitions yield no significantly better results.
IPC 8 full level
G06F 17/18 (2006.01); G06F 19/00 (2011.01); G06K 9/00 (2006.01); G06N 7/00 (2006.01); G10L 15/14 (2006.01)
CPC (source: EP)
G06F 17/18 (2013.01); G06N 7/01 (2023.01); G10L 15/142 (2013.01); G06F 2218/12 (2023.01)
Designated contracting state (EPC)
AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR
DOCDB simple family (publication)
WO 2012125146 A1 20120920; AU 2011362611 A1 20130926; AU 2011362611 B2 20170601; CA 2830159 A1 20120920; CA 2830159 C 20171003; EP 2686796 A1 20140122; EP 2686796 A4 20150513; JP 2014515131 A 20140626; JP 5898704 B2 20160406; SG 193450 A1 20131030
DOCDB simple family (application)
US 2011028302 W 20110314; AU 2011362611 A 20110314; CA 2830159 A 20110314; EP 11861132 A 20110314; JP 2013557997 A 20110314; SG 2013069059 A 20110314