A Novel Genetic Algorithm Based on Tabu Search for HMM Optimization

Yang, Fengqin; Zhang, Changhai; Bai, Ge

doi:10.1109/icnc.2008.365

Cited by 16 publications

(8 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The following research works are focused on the speech recognition using HMMs, as in Oudelha et al [26] combining the Baum-Welch algorithm (BW); in Cheshomi et al [27] also uses the BW algorithm. Bhuriyakorn et al [28] present approaches for HMMs topologies generation, in Yang et al [29] address the optimization problem combining a Tabu search and BW algorithm; Yang et al [30] uses Particle Swarm Optimization (PSO) and GA on recognition performance, and in Ogawa et al [31] determine the structure of a Partly HMM with GA. -There is a work of Won et al [2] that presents the use of GA for evolving HMMs, used on information prediction of secondary structure for protein sequences.…”

Section: Parameters Optimization Of An Hmmmentioning

confidence: 99%

Network anomaly detection by continuous hidden markov models: An evolutionary programming approach

Flores

Calderón

Antolino

et al. 2015

IDA

View full text Add to dashboard Cite

Information security is an important and growing need. The most common schemes used for detection systems include pattern-or signature-based and anomaly-based. Anomaly-based schemes use a set of metrics, which outline the normal system behavior and any significant deviation from the established profile will be treated as an anomaly. This paper contributes with an anomaly-based scheme that monitors the bandwidth consumption of a subnetwork, at the Universidad Michoacana, in Mexico. A normal behavior model is based on bandwidth consumption of the subnetwork. The presence of an anomaly indicates that something is misusing the network (viruses, worms, denial of service, or any other kind of attack). This work also presents a scheme for an automatic architecture design and parameters optimization of Hidden Markov Models (HMMs), based on Evolutionary Programming (EP). The variables to be used by the HMMs are: the bandwidth consumption of network (IN and OUT), and the associated time where the network activity occurs. The system was tested with univariate and bivariate observation sequences to analyze and detect anomaly behavior. The HMMs, designed and trained by EP, were compared against semi-random HMMs trained by the Baum-Welch algorithm. On a second experiment, the HMMs, designed and trained by EP, were compared against HMMs created by an expert user. The HMMs outperformed the other methods in all cases. Finally, we made the HMMs time-aware, by including time as another variable. This inclusion made the HMMs capable of detecting activity patterns that are normal during a period of time but anomalous at other times. For instance, a heavy load on the network may be completely normal during working times, but anomalous at nights or weekends.speech and gesture recognition, as well as applications to anomaly detection. In an HMM, the estimation of good model parameters affects the performance of the recognition or detection processes [3]. The HMM parameters can be determined during an iterative process called "training". The Baum-Welch algorithm [4] is one method applied in setting an HMM's parameters, but this method has a drawback: being a gradient-based method, it may converge to a local optimum.Global search techniques can be used to optimize an HMM's parameters. Genetic Algorithms (GA) and Evolutionary Programming (EP) are global optimization techniques that can be used to optimize an HMM's parameters [3]. Studies of using GA to train HMMs are relatively rare, particularly in comparison with the large literature on applying GA to neural network training [2].In the study presented in this paper we want to know (given certain events or behaviors of the study objects), what is expected or what can be anticipated as output. That is, we are interested in studying the behavior of a set of random variables over time, working with stochastic processes. In other words, given the behavior of a computer network, the problem is to automatically develop an HMM capable of discerning between normal and anomalous behavior. This tas...

show abstract

Section: Parameters Optimization Of An Hmmmentioning

confidence: 99%

Network anomaly detection by continuous hidden markov models: An evolutionary programming approach

Flores

Calderón

Antolino

et al. 2015

IDA

View full text Add to dashboard Cite

show abstract

“…The experimental results show that the improved genetic algorithm has stronger reality and superior search ability [13][14][15][16].…”

Section: Introductionmentioning

confidence: 99%

Intelligent Planning of Tourism Scenic Routes Based on Genetic Algorithm in Coal WANBEI Mining Subsidence

Li¹,

Song²

2016

TELKOMNIKA

View full text Add to dashboard Cite

show abstract

“…Assim sendo, a investigação de algoritmos alternativos para estimação ML de modelos HMM, com maior facilidade de alcançar a solução ML global e/ou com menor custo computacional, tem despertado o interesse da comunidade científica internacional ao longo dosúltimos anos [11][12][13].…”

Section: Introductionunclassified

Algoritmo Híbrido Para Estimação ML De Modelos HMM Baseado Em Treinamento De Viterbi E Otimização PSO

Marques¹,

Maciel²,

Pinto³

2016

Anais Do 10. Congresso Brasileiro De Inteligência Computacional

View full text Add to dashboard Cite

A Novel Genetic Algorithm Based on Tabu Search for HMM Optimization

Cited by 16 publications

References 4 publications

Network anomaly detection by continuous hidden markov models: An evolutionary programming approach

Network anomaly detection by continuous hidden markov models: An evolutionary programming approach

Intelligent Planning of Tourism Scenic Routes Based on Genetic Algorithm in Coal WANBEI Mining Subsidence

Algoritmo Híbrido Para Estimação ML De Modelos HMM Baseado Em Treinamento De Viterbi E Otimização PSO

Contact Info

Product

Resources

About