Clinical pathway analysis using graph-based approach and Markov models

2007 2nd International Conference on Digital Information Management, ICDIM

Volumn 1, Issue , 2007, Pages 279-284

  Elghazel, Haytham ^a   Deslandres, Véronique ^a   Kallel, Kassem ^a   Dussauchoy, Alain ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; DATA MINING; DECISION SUPPORT SYSTEMS; FORECASTING; GRAPHIC METHODS; INFORMATION MANAGEMENT; MARKOV CHAINS;

BASED CLUSTERING; CLINICAL PATHWAYS; CLINICAL PROCESS; DATA MINING PROCESS; GENERIC DECISIONS; MARKOV CHAIN MODELS; MEDICAL PROFESSIONALS; PROBABILISTIC PREDICTION;

PREDICTIVE ANALYTICS;

EID: 50149113352     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDIM.2007.4444236     Document Type: Conference Paper

References (11)

1. Elghazel, H., V. Deslandres, M-S. Hacid, A. Dussauchoy and H. Kheddouci, "A new clustering approach for symbolic data and its validation: Application to the healthcare data", In F. Esposito et al., editors, ISMIS2006 (Springer Verlag LNAI 4208), pp.473-482, 2006.
2. Antunes, C. and A. Oliveira, "Temporal data mining: an overview" In KDD Workshop on Temporal Data Mining, pp.1-13, 2001.
3. Cadez, I. V., D. Heckerman, C. Meek, P. Smyth and S. White, "Visualization of navigation patterns on a Web site using model-based clustering", In Knowledge Discovery and Data Mining, pp.280-284, 2000.
4. Cadez I. V., S. Gaffney, and P. Smyth, "A general probabilistic framework for clustering individuals and objects". In Knowledge Discovery and Data Mining, pp.140-149, 2000.
5. Smyth, P., "Clustering sequences with hidden markov models", In Advances in Neural Information Processing, Vol. 9. 1997.
6. Dempster, A. P., N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the EM-Algorithm", Journal of the Royal Statistical Society, Series B, Vol. 39, pp.1-38, 1977.
7. Oates T., L. Firoiu, and P. Cohen, "Clustering time series with hidden Markov models and dynamic time warping", In Proceedings of the IJCAI-99 Workshop on Neural, Symbolic and Reinforcement Learning Methods for Sequence Learning, pp.17-21, 1999.
8. Paterson M. and V. Dancik, "Longest Common Subsequences". Mathematical Foundations of Computer Science, Vol. 841, pp.127-142, 1994.
9. Kruskall, J. B., and M. Liberman, "The symmetric time warping problem: From continuous to discrete", In Kruskal J.B., Sankoff D., editors. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Stanford: CSLI Publications, pp.125-161, 1999.
10. Jain, A.K., M.N. Murty and P.J. Flynn, "Data Clustering: A Review", ACM Computing Surveys, Vol. 31, pp.264-323, 1999.
11. Kalyani, M. and M. Sushmita, "Clustering and its validation in a symbolic framework", Pattern Recognition Letters, 24(14), pp.2367-2376, 2003.