Timeline for How to find next to optimal path in hidden Markov model or what should be LIST-Viterbi algorithm?
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 4, 2012 at 7:54 | comment | added | Alexander Chervov | @Arthur thank you for yours efforts ! It seems I have found an answer in google.ru/… Let me think on yours proposal on Monday. | |
| Aug 1, 2012 at 13:56 | comment | added | Arthur B | Ok, switched to C++, clearer? | |
| Aug 1, 2012 at 13:55 | history | edited | Arthur B | CC BY-SA 3.0 |
deleted 15 characters in body; added 2 characters in body
|
| Aug 1, 2012 at 13:48 | comment | added | Arthur B | Yes, I think of it backwards. There is not then, the "if" is just a filtering condition, in some other languages it would be a "where" | |
| Jul 31, 2012 at 19:33 | comment | added | Alexander Chervov | Also: I get used to think that paths go from initial states S(t=0) to S_{k}(t=T), but you seems to go in opposite direction ? From T to 0 ? | |
| Jul 31, 2012 at 19:31 | comment | added | Alexander Chervov | Thanks for comments. Still not clear: I am not familiar with Python, but seems something missing: you write "IF condition" where is "THEN" part ? | |
| Jul 31, 2012 at 17:55 | history | edited | Arthur B | CC BY-SA 3.0 |
added 404 characters in body; added 7 characters in body
|
| Jul 31, 2012 at 17:25 | comment | added | Alexander Chervov | Code is unclear for me. Can you add comments to code? | |
| Jul 31, 2012 at 17:14 | comment | added | Arthur B | I edited my pseudo-code, there was a mistake. Does that answer your objection? | |
| Jul 31, 2012 at 17:14 | history | edited | Arthur B | CC BY-SA 3.0 |
added 177 characters in body; deleted 2 characters in body
|
| Jul 31, 2012 at 14:10 | comment | added | Alexander Chervov | Thank you for the answer ! I am not sure that I understand it, but what seems unreasonable for me (if I understand correctly) that you suggest to keep suboptimal paths for every time moment - I do not think it will work, I think suboptimal path may be same as true path at number of positions and then diverge from it then may be converge back to optimal - but in you proposal you will loose such situation. (If I understand correctly what you propose). | |
| Jul 31, 2012 at 13:46 | history | answered | Arthur B | CC BY-SA 3.0 |