{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T14:40:19Z","timestamp":1751467219995,"version":"3.35.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1109\/icdim.2007.4444236","type":"proceedings-article","created":{"date-parts":[[2008,7,23]],"date-time":"2008-07-23T13:49:26Z","timestamp":1216820966000},"page":"279-284","source":"Crossref","is-referenced-by-count":6,"title":["Clinical pathway analysis using graph-based approach and Markov models"],"prefix":"10.1109","author":[{"given":"Haytham","family":"Elghazel","sequence":"first","affiliation":[]},{"given":"Veronique","family":"Deslandres","sequence":"additional","affiliation":[]},{"given":"Kassem","family":"Kallel","sequence":"additional","affiliation":[]},{"given":"Alain","family":"Dussauchoy","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347119"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347151"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM-Algorithm","volume":"39","author":"dempster","year":"1977","journal-title":"Journal of the Royal Statistical Society Series B"},{"key":"ref5","article-title":"Clustering sequences with hidden markov models","volume":"9","author":"smyth","year":"1997","journal-title":"Advances in Neural Information Processing"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"2367","DOI":"10.1016\/S0167-8655(03)00066-7","article-title":"Clustering and its validation in a symbolic framework","volume":"24","author":"kalyani","year":"2003","journal-title":"Pattern Recognition Letters"},{"key":"ref8","first-page":"127","article-title":"Longest Common Subsequences","volume":"841","author":"paterson","year":"1994","journal-title":"Mathematical Foundations of Computer Science"},{"key":"ref7","first-page":"17","article-title":"Clustering time series with hidden Markov models and dynamic time warping","author":"oates","year":"1999","journal-title":"Proc IJCAI-99 Workshop Neural Symbolic and Reinforcement Learning Methods for Sequence Learning"},{"key":"ref2","first-page":"1","article-title":"Temporal data mining: an overview","author":"antunes","year":"2001","journal-title":"KDD Workshop on Temporal Data Mining"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11875604_54"},{"key":"ref9","first-page":"125","article-title":"The symmetric time warping problem: From continuous to discrete","author":"kruskall","year":"1999","journal-title":"Time Warps String Edits and Macromolecules The Theory and Practice of Sequence Comparison"}],"event":{"name":"2007 2nd International Conference on Digital Information Management","start":{"date-parts":[[2007,10,28]]},"location":"Lyon, France","end":{"date-parts":[[2007,10,31]]}},"container-title":["2007 2nd International Conference on Digital Information Management"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4444189\/4444190\/04444236.pdf?arnumber=4444236","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T04:42:39Z","timestamp":1738298559000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4444236\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/icdim.2007.4444236","relation":{},"subject":[],"published":{"date-parts":[[2007]]}}}