CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Parameter Estimation of Hidden Markov Models (HMM) using go with the Winner Algorithms

by Ravindra Nath, Renu Jain
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 18 - Number 5
Year of Publication: 2011
Authors: Ravindra Nath, Renu Jain
10.5120/2282-2954

Ravindra Nath, Renu Jain . Parameter Estimation of Hidden Markov Models (HMM) using go with the Winner Algorithms. International Journal of Computer Applications. 18, 5 ( March 2011), 11-15. DOI=10.5120/2282-2954

@article{ 10.5120/2282-2954,
author = { Ravindra Nath, Renu Jain },
title = { Parameter Estimation of Hidden Markov Models (HMM) using go with the Winner Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { March 2011 },
volume = { 18 },
number = { 5 },
month = { March },
year = { 2011 },
issn = { 0975-8887 },
pages = { 11-15 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume18/number5/2282-2954/ },
doi = { 10.5120/2282-2954 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:05:29.814551+05:30
%A Ravindra Nath
%A Renu Jain
%T Parameter Estimation of Hidden Markov Models (HMM) using go with the Winner Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 18
%N 5
%P 11-15
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Hidden Markov model (HMM) is a stochastic method which has been used in various application like speech processing, signal processing and character recognition. It has three main problems. Third problem of HMM is the one in which we optimize the model parameters so as to describe how a given observation sequence comes about. The observation sequence is used to adjust the model parameters is called training sequence since it is used to train the HMM. One of the conventional methods that are applied in setting HMM model parameters values is Baum Welch algorithm. So in this paper Go With the Winner (GWW) method is used to train the HMM Parameters. We have already done experiment of same set of data using Baum Welch, Metropolis, Simulated Annealing and Genetic algorithm. The experimental results show that GWW is found to reach maxima in less number of transactions and the value of P(O|λ) is also much higher in comparison to Metropolis, Simulated Annealing and Genetic algorithm.

References
  1. Rabiner L.R. “A tutorial on HMM and Selected Applications in Speech Recognition", Proceedings of the IEEE, Vol. 77, NO. 2, P267-296.
  2. I. Wegener, Randomized Search Heuristics as an Alternative to Exact Optimization, Technical report , University of Dortmund, Dept of the Computer Science, February 2004.
  3. J. Kleinberg and E. Tardos, Algorithm Design , Cornell University Spring 2004.
  4. R. Durbin, R. Eddy and A. Krogh , Graeme Mitchison , Biological Sequence Analysis. Cambridge University Press 2005.
  5. Muthaiah Venkatachalam, Ismail Syed, “Web Site Optimization Through Web Log Analysis”.
  6. Morteza ShahRam, “Image Processing and Reconstruction HMM-Based Pattern Detection” Project Report for EE 262: 2002.
  7. The Metropolis Algorithm, “Statistical Systems and Simulated Annealing”.
  8. E. Rich & K.Knight “Artificial Intelligence” TMH Edition 1991.
  9. C. M. Coleman “Investigation of Simulated Annealing, Ant-Colony Optimization, and genetic Algorithms for self – Structuring Antennas” Vol.52 No.4, April 2004.
  10. Ravindra Nath, and Renu Jain ”Using Randomized Search Algorithms to Estimate HMM Learning Parameters” IEEE International Advanced computing Conference (IACC-2009).
  11. A.H. Mantawy, L. Abdul Mazid, Z. Selim “Integrating genetic Algorithms, Tabu search and Simulated Annealing for the unit commitment problem”, IEEE Transaction on power system, Vol.14, No. 3 August 1999.
  12. Mark Pirlot, “general local search method”, European journal of operational research -92 (1996) 493-511.
  13. David Aldous, Umesh Vazirani,”Go With the Winner Algorithms”.
  14. Tassos Dimitriou, Russell Impagliazzo,” Towards an analysis of local optimization algorithms”
  15. Anastasia Rita Widiarti and Phalita Nari wastu “Javanese Character Recognition using HMM ”, word Academy of science, Engineering and Technology 57 2009
Index Terms

Computer Science
Information Sciences

Keywords

Hidden Markov Models (HMM) Go With the Winner (GWW) Genetic Algorithm(GA) Baum-Welch method (BW)

Powered by PhDFocusTM