Nootyasakool, Supakit

Preferred name

Alternative Name

Nootyaskool, Supakit

Main Affiliation

School of Information Technology

supakit.no@kmitl.ac.th

Now showing 1 - 10 of 16

Some of the metrics are blocked by your
consent settings
Hybrid Genetic Algorithm with Baum-Welch Algorithm by using diversity population technique
(2006-12-01)
Nootyaskool, Supakit
;
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
consent settings
Reinforcement learning applied to scrum team towards large-scale global optimization
(2019-02-02)
Nootyaskool, Supakit
;
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
consent settings
Gold Investment Model on RNN and Finding Best Investment Strategy on PSO
(2022-01-01)
Kanchanakantikul, Pakamas
;
Nootyaskool, Supakit
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
consent settings
Roulette wheel selection applied to PSO on numerical function in discrete and continuous space
(2016-07-22)
Ounsrimuang, Pimolrat
;
Nootyaskool, Supakit
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
consent settings
Improved Naive RAG by Integrated Advanced Techniques: A Comprehensive Framework Using Parent-Child Architecture, Hybrid Retrieval, and Contextual Compression
(2026-07-01)
Aromsuk, Tinnarat
;
Netisopakul, Ponrudee
;
Nootyaskool, Supakit
This paper presents a novel approach to enhance Retrieval-Augmented Generation (RAG) systems through the integration of three advanced techniques: Parent-Child Architecture, Hybrid Retrieval, and Contextual Compression with cross-encoder re-ranking. We implement this framework using Langchain and FAISS vector search, with Anthropic’s Claude as the foundation model. Our comprehensive evaluation across 14 diverse Wikipedia-based knowledge domains employs the RAGAS framework to measure multiple performance dimensions. Results demonstrate that our advanced framework yields significant improvements in key metrics: Context Precision 10.11%, Context Recall 2.25%,and BLEU scores 1.14% compared to Naive RAG implementations. Domain analysis reveals particularly strong performance in Medicine 8.0% BLEU, Science 4.9%, and specialized Technology domains 4.9%. While, some technical domains such as Cybersecurity (−2.4%) and Biology (−6.6%) show performance degradation. Our framework achieves these improvements with minimal computational overhead by 1.89%,offering a practical approach to implementing domain-adaptive RAG systems that optimize context quality for improved generation performance.
Some of the metrics are blocked by your
consent settings
DEEP LEARNING PREDICTING POWER COSTS FOR POWER PLANNING
(2025-05-01)
Ounsrimung, Pimolrat
;
Phuanphannid, Walaiphan
;
Nootyaskool, Supakit
The current global situation, especially in Thailand, is showing recovery following the easing of COVID-19 restrictions. With a growing population and industrial expansion, there is an increased demand for electricity. This rise in demand, along with factors like fuel costs and fluctuating currency rates, has influenced global power prices. The authors are keen on studying power’s variable price prediction using machine learning techniques. The objective is to analyze factors associated with power costs and their interrelationships. It is essential to have accurate data for strategic power planning. Research has been conducted on theories related to variable power prices, time series, traditional statistical forecasting, machine learning, and deep learning. It was found that three main factors affecting variable power prices were identified: natural gas prices, exchange rates, and inflation rates, with natural gas prices and inflation rates having a strong correlation. Traditional statistical forecasting is less efficient for highly volatile power’s variable price. Deep learning models outperform conventional machine learning for this dataset.
Some of the metrics are blocked by your
consent settings
Hidden Markov Models predict foreign exchange rate
(2015-01-15)
Nootyaskool, Supakit
;
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
consent settings
Comparison solving discrete space on flower pollination algorithm, PSO and GA
(2016-03-23)
Rathasamuth, Wanthanee
;
Nootyaskool, Supakit
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
consent settings
Categorize Level of Crystal Sugar Making with Recurrent Neural Network
(2022-01-01)
Ounsrimuang, Pimolrat
;
Nootyaskool, Supakit
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.
Some of the metrics are blocked by your
consent settings
Roulette wheel selection to encourage discrete Particle Swarm Optimization solving toll-keeper scheduling problem
(2015-12-30)
Ounsrimuang, Pimolrat
;
Nootyaskool, Supakit
Particle Swarm Optimization (PSO) has been proven to solve various applications by most applications using the real problem-space. In some specific problem, the discrete problem-space is selected on PSO that getting the solution result slowly by cause of sticky on local solution, and also the researcher cannot modify or difficult to understand how to improve the performance finding solution. The researcher many be tried to adjust velocity value by giving a new c1, c2 and weight to be a smaller or a larger value. This research proposed how to apply roulette wheel select to improve PSO on the discrete problem-space. Experiment tested the idea by a toll-keeper scheduling and a numerical function. Both problems created parameters inform discrete problem-space. The experiment result showed that PSO with roulette wheel selection taking the solution quickly.

Nootyasakool, Supakit

Filters

Settings

Sort By

Results per page