Insulin Chart Prediction for Diabetic Patients Using Hidden Markov Model (HMM) and Simulated Annealing Method

  • Ravindra Nath
  • Renu Jain
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 236)


Most of the diabetic patients need to take insulin before every meal. The doctors have to decide insulin doses for every patient according to the patient’s previous records of doses and sugar levels measured at regular intervals. This paper proposes a hidden Markov model to predict the insulin chart for a patient and uses simulated annealing search algorithm to efficiently implement the model. The one-month chart maintained by the patient has been used to train the model, and the prediction for next fifteen days is done on the basis of the trained data. We discussed the results with the university medical doctor; he was very pleased to see to the result obtained.


Hidden Markov model (HMM) Randomized algorithm (RA) Simulated annealing (SA) Diabetic patient chart prediction (DPCP) 



The authors of the paper are highly grateful to Dr. Chaman Kumar (MBBS, MD), CSJM University, Kanpur, for discussing the results with us and encouraging us to do more work in this direction.


  1. 1.
    Durbin, R., Eddy, R., Krogh, A.: Graeme Mitchison. Cambridge University Press, Biological Sequence Analysis (2005)Google Scholar
  2. 2.
    Dan, E. Krane., Michael, L. Raymer.: Fundamental Concepts of Bioinformatics. Pearson Education first edition (2000)Google Scholar
  3. 3.
    Antequera, F., Bird, A.: CpG islands as the genomic footprints of promoters that are associated with replication origins. Curr Biol. 9(17), 661–667 (1999)CrossRefGoogle Scholar
  4. 4.
    Larsen, F., Gundersen, G., Lopez, R., Prydz, H.: CpG islands as gene markers in the human genome. Genomics 13(4), 1095–1107 (1992)CrossRefGoogle Scholar
  5. 5.
    Eren, Akdemir., Tolga.: The use of articulator motion information in automatic speech segmentation., Science Direct Received 5 October 2007; received in revised form 7 March 2008; accepted 17 April (2008)Google Scholar
  6. 6.
    Md. Rafiul, Hassan., Baikunth, Nath.: Stock market forecasting using HMM: a new approach. In: Proceeding of international conference on intelligent systems design and applications(ISDA) (2005)Google Scholar
  7. 7.
    Behrooz, Nobakht., Cart-Edward, Joseph., Babak, Loni.: Stock market analysis and prediction Using HMM LIACSGoogle Scholar
  8. 8.
    Sundararajan, R.: Stock market trend and predection using Markov models. RTCSP 09, Department of ECE, Amrita Vishwa vidyapeeth, CoimbatoreGoogle Scholar
  9. 9.
    Kwong, S., Chau, C.W., Man, K.F., Tang, K.S.: Optimization of HMM topology and its model parameters by genetic algorithm. Pattern Recognitions 34, 509–522 (2001)CrossRefMATHGoogle Scholar
  10. 10.
    The Metropolis Algorithm, Statistical systems and simulated annealingGoogle Scholar
  11. 11.
    Mantawy, A.H., Abdul Mazid, L., Selim, Z.: Integrating genetic algorithms. Tabu search and Simulated Annealing for the unit commitment problem. IEEE Trans Power Syst 14(3) August (1999)Google Scholar
  12. 12.
    Ravindra, Nath., Renu, Jain.: Estimating HMM learning parameters using genetic algorithm. In: International conference on computational intelligence applications (2010)Google Scholar
  13. 13.
    Ravindra, Nath., Renu, Jain.: Using randomized search algorithms to estimate HMM learning parameters. In: IEEE international advanced computing conference (IACC) (2009)Google Scholar
  14. 14.
    Rabiner, L.R.: A tutorial on HMM and selected applications in speech recognition. Proc IEEE 77(2), 267–296 (1977)Google Scholar
  15. 15.
    Liu, Y., Lin, Y., Chen Z.: Using hidden markov model for information extraction based on multiple templates. In: Porch of the international conference on natural language processing and knowledge engineering pp. 394–399, (2003)Google Scholar
  16. 16.
    Coleman, C. M.: Investigation of simulated annealing, Ant-colony optimization, and genetic algorithms for self-structuring antennas. 52(4), April (2004)Google Scholar
  17. 17.
    Pirlot, Mark: General local search method. European J. Opera. Res. 92, 493–511 (1996)CrossRefMATHGoogle Scholar
  18. 18.
    Wegener, I.: Randomized search heuristics as an alternative to exact optimization. University of Dortmund, Department of the Computer Science, Technical report February 2004Google Scholar

Copyright information

© Springer India 2014

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringUniversity Institute of Engineering and Technology, Chattrapati Shahuji Maharaj UniversityKanpurIndia

Personalised recommendations