Now showing 1 - 10 of 14
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Hybrid Genetic Algorithm with Baum-Welch Algorithm by using diversity population technique
    (2006-12-01) ;
    Kruatrachue, Boontee
    Baum-Welch Algorithm (BWA) have used in recognition systems, many researchers have improved BWA performances by using Hybrid Genetic Algorithm (HGA). This paper presents a new HGA technique by using diversity population structure. We surveyed HGA techniques and divided into four types. There were separate processes, population types, fitness determiners, and diversity population structure. A technique of diversity population structure protected applying BWA to similar population. Different population structures make available GA to find optimum point quickly. This paper compared all of HGA techniques, which there trained on Hidden Markov Models (HMM), in an application Thai off-line handwritten recognition, we used database from NECTEC. An experiment of HGA, HMM probability of diversity population techniques get better than techniques of population types 52.65% improvement and there better than techniques of separately process 37.91% improvement. Moreover, HGA experimented five times repeatedly, standard derivation value of diversity population techniques showed closely results. © 2006 IEEE.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Reinforcement learning applied to scrum team towards large-scale global optimization
    (2019-02-02) ;
    Ounsrimuang, Pimolrat
    Large-scale problems have size of problem over a thousand dimensions in finding a best solution that uses long computation times. In this work, we use an idea of scrum methodology that is a well-known in software development companies, to create an optimization algorithm. The scrum methodology describing about the team organization likes as rugby team management that player have expert in game. The proposed algorithm is developed based on concept of the evolutionary computation by this work added agent specifics in leaning environment of the problem. The specific of the agent is reinforcement learning by taking an action and getting reward. The proposed algorithm was experimented on a large-scale global optimization finding optimum point of numerical function, comparing between with and without reinforcement learning. The experiment result showed that the usage of reinforcement learning has good results.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    HMM Parameters Optimization using Combine Genetic Algorithm and Iterative Training
    (2003-12-01)
    Kruatrachue, Boontee
    ;
    Siriboon, Kritawan
    ;
    HMM have been used extensively for recognizing observation sequence especially in speech recognition. Iterative training procedure such as Baum-Weltch, or gradient techniques are normally used to find locally optimize HMM parameters. This paper presents genetic algorithm (GA) to perform global search for Hidden Markov Model (HMM) parameters that maximize probability of observation sequence given the model. In order to increase the convergence rate and parameters optimization, we combine iterative procedure with GA. The probability of observation sequence of the train model using iterative procedure, GA, and GA with iterative procedure will be compared along with their convergence rates. The test patterns are chain code sequences generated from 38 isolated on-line Thai handwritten characters. The recognition rate and the probability of the train observation sequences of GA were better than the iterative training. The recognition rate of HMM with iterative training 95.05%, GA 97.50% and GA with iterative training 98.41% on 3839 patterns.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Predicting Fuel Burn with Neural Network to Adjust Contingency Fuel of Airplane
    (2023-01-01)
    Ounsrimoung, Pimolrat
    ;
    ; ;
    The amount of fuel in an airplane tank is very important for flying. however, flying a short distance by adding a fuel-full tank is not energy efficient because spending a lot of tons for holding fuel weight. The flight planners who consider the amount of fuel to add to the tank by using historical data, use fuel burn calculating and adjust contingency fuel. This research presents the neural networks to predict fuel burn, which learn from historical airplane data. The experiment applied to local and international flight data and used both Airbus and Boeing. The predicted model was swapped and tested on the outbound and inbound replacements for confirmation capable of the predicted mode.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Gold Investment Model on RNN and Finding Best Investment Strategy on PSO
    (2022-01-01)
    Kanchanakantikul, Pakamas
    ;
    Nowadays, Algorithm trading in community and stock is interesting research, while gold is also an investment option. This research presents two steps. Three inputs sequence consists of the gold price(sell), gold spot and crude oil. Output has an order sequence indicating buy, sell, and wait for the signal. Firstly, finding the best strategy from historical data by particle swarm optimization (PSO) compared with random search (RS). That will get buying, selling, or waiting signals in the gold trading market Secondly, creating gold investment by recurrent neural network (RNN) model. The experiment result showed RNN trading model based on PSO is better than RS, which has a profit of 79.667 percent.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Roulette wheel selection applied to PSO on numerical function in discrete and continuous space
    (2016-07-22)
    Ounsrimuang, Pimolrat
    ;
    Particle Swarm Optimization (PSO) successfully finds a solution as shown in various literatures. In some problems creating on discrete space, adjustment control-parameter may be difficult to modify a reach of optimum solution. The paper proposes an approach applying roulette wheel selection to PSO, which can help PSO escape from a local solution. This approach tested on both continuous and discrete space by finding solution of 12-numerical functions and an engineering-problem. The experiment result showed that the proposed technique can help PSO getting the best result both problem spaces, the performance improvement but also maintain easily to implementation.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Hidden Markov Models predict foreign exchange rate
    (2015-01-15) ;
    Choengtong, Wuttichow
    This paper presents the prediction Thai baht by using Hidden Markov Models (HMM) with which the prediction model uses four factors, dollar index, interest rate, inflation rate and economic growth. The main idea of this work is a technique of encoding four factors into one observation sequence to train HMM. One result of prediction data will present four factors after decoding. The experiment is done using the data-by-day from 2002 to 2013 and showed that the technique has the mean percentage error of 0.167% to predict Thai currency exchange.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    The hybrid implementation genetic algorithm with particle swarm optimization to solve the unconstrained optimization problems
    (2012-10-26)
    Genetic algorithm (GA) has an advantage in exploration search. Particle swarm optimization (PSO) has an advantage in sharing movement information between particles. The combining between GA and PSO is proposed in this research. We design hybrid-GA with PSO, and compare the performance with simple GA and simple PSO, which their models will find the solution of five-difference complexity of numerical functions. The experiment result showed that hybrid GA with PSO can find the solution of a multimodal problem and unimodal with noise signal quickly. © 2012 IEEE.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Comparison solving discrete space on flower pollination algorithm, PSO and GA
    (2016-03-23)
    Rathasamuth, Wanthanee
    ;
    In order to find an optimal solution of a research problem, the problem parameters are encoded in discrete space (e.g. bits or integers). Genetic algorithm (GA) performs the discrete space by binary chromosome. Particle swarm optimization (PSO) uses probability and sigmoid function to convert the next bird's velocity into binary bit. Flower pollination algorithm (FPA) is quite new and also has a few number of the paper implements to discrete space. This research uses a cut-off parameter applied on FPA. The main objective is to examine the performance of the algorithms on discrete space and calculate velocity of PSO as well as Levy fight movement of FPA when using discrete parameter. The experiment used eight-numerical functions to test conversion from a real value to a bit value and measure the effectiveness of each algorithm. Experiment result showed that FPA could perform better than PSO and GA.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Categorize Level of Crystal Sugar Making with Recurrent Neural Network
    (2022-01-01)
    Ounsrimuang, Pimolrat
    ;
    This research presents the study of recurrent neural networks to predict industrial crystal sugar making. The recurrent neural network trains on six parameters consisting of liquid in the pan, Brix levels, vacuum in the pan, liquor temperatures, water steam supplier, and current for mix-motor agitator. The input variables were the trained model to predict by categorizing data in three levels high, middle, and low which the data came from human control the sugar boiler machine. The trained model for the future can be extended to make an experience meter to indicate the ability of workers to control the machine.