December 2024

Rice Classification Using Three-Step Neural Network Integration Meesri, Sarawut., Amornsamankul, Somkid., Kraipeerapun, Pawalai This paper proposes a three-step neural network integration. In the first step, two neural networks are trained to produce a truth output and a falsity output. The second step uses cascade generalization to improve the results of the first step. A sequence […]

Health Data Classification using Applied Cascade Generalization Chatree Nilnumpetch, Somkid Amornsamankul, Pawalai Kraipeerapun This research study introduces two steps to improve the binary classification technique without using threshold value. The first step is to use complementary neural networks to produce the truth data and falsity data. The truth and falsity data are used for decision

Refining a chain theorem from matroids to internally 4-connected graphs Chanun Lewchalermvongs, Guoli Ding Graph theory and matroid theory are interconnected with matroids providing a way to generalize and analyze the structural and independence properties within graphs. Chain theorems, vital tools in both matroid and graph theory, enable the analysis of matroid structures associated with

Enhancing Signed Graph Attention Network by Graph Characteristics: An Analysis Panatda Kaewhit, Chanun Lewchalermvongs, Phakaporn Lewchalermvongs – A graph neural network (GNN) is one of successful methods for handling tasks on a graph data structure, e.g. node embedding, link prediction and node classification. GNNs focus on a graph data structure that must aggregate messages on

A game-theoretic approach for route planning on traveling by public transportation in the PM2.5 pollution: A case study in Bangkok Chanun Lewchalermvongs, Phakaporn Lewchalermvongs, Chettaporn Chuesuphan, Chutchawon Weeranukunjit, Chanon Boonkangwan, Montika Chaikittiporn, Patid Srikirinth, Tanaphoom Glinpatgij Extremely high levels of PM2.5 (particulate matter with a diameter of 2.5 micrometers or less) in Bangkok’s major areas

Maximizing vertex rescue: investigating the firefighter problem with edge subdivision Chutchawon Weeranukunjit, Chanun Lewchalermvongs The firefighter problem is a game played on a connected graph where a fire breaks out at a vertex. In each round, a firefighter chooses a vertex to protect, and the fire then spreads to all unprotected neighbors of the burning vertex.

A note on an analogue of Hadamard’s theorem for determining the radii of m-meromorphy Nattapong Bosuwan In this paper, we prove an extension of Hadamard’s classical theorem for determining the radius of mmeromorphyof an analytic function in terms of its Taylor coefficients. Our extension is expressed in terms of Fouriercoefficients with respect to an orthonormal