Claim Missing Document
Check
Articles

Optimizing Data Classification in Support Vector Machines Using Metaheuristic Algorithms Awalin, Qonita Ilmi; Agustin, Ika Hesti; Hadi, Alfian Futuhul; Dafik, Dafik; Sunder, R.
CAUCHY: Jurnal Matematika Murni dan Aplikasi Vol 9, No 2 (2024): CAUCHY: JURNAL MATEMATIKA MURNI DAN APLIKASI
Publisher : Mathematics Department, Universitas Islam Negeri Maulana Malik Ibrahim Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/ca.v9i2.29320

Abstract

To categorize patient diagnosis data related to Chronic Kidney Disease (CKD), this study compares the classification performance of Support Vector Machines (SVM) enhanced by Particle Swarm Optimization (PSO) and Genetic Algorithm (GA). CKD is a severe illness in which the kidneys fail to adequately filter blood and perform their normal functions. This study utilized secondary data consisting of patient conditions and health information. Based on references from CKD-related journals, 15 independent variables and one dependent variable were selected from an initial set of 54 variables. To address the issue of unbalanced data, an oversampling technique was applied, and the data was subsequently split into 80% for training and 20% for testing. During the training phase, SVM-PSO and SVM-GA models were developed, and the gamma value was optimized using the RBF kernel function of SVM. The results indicated that in classifying CKD patient diagnosis data, the SVM-PSO model (97.54% accuracy) outperformed the SVM-GA model (97.37% accuracy). This finding suggests that PSO-based hyperparameter optimization yields a superior model for data classification
On Local Antimagic b-Coloring and Its Application for STGNN Time Series Forecasting on Horizontal Farming Sunder, R.; Agustin, Ika Hesti; Dafik, Dafik; Maylisa, Ika Nur; Mohanapriya, N.; Marsidi, Marsidi
CAUCHY: Jurnal Matematika Murni dan Aplikasi Vol 10, No 1 (2025): CAUCHY: JURNAL MATEMATIKA MURNI DAN APLIKASI
Publisher : Mathematics Department, Universitas Islam Negeri Maulana Malik Ibrahim Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/cauchy.v10i1.29968

Abstract

This article discusses a local antimagic coloring which is a combination between antimagic labeling and coloring. It is a new notion. We define a vertex weight of  as  where  is the set of edges incident to . The bijection  is said to be a local antimagic labeling if for any two adjacent vertices, their vertex weights must be distinct. Furthermore  a coloring of a graph is a proper coloring of the vertices of  such that in each color class there exists a vertex having neighbors in all other  color classes. If we assign color on each vertex by the vertex weight  such that it induces a graph coloring satisfying coloring property, then this concept falls into a local antimagic coloring of graph. A local antimagic chromatic number, denoted by , is the maximum number of colors chosen for any colorings generated by local antimagic coloring of . In this paper we initiate to explore some new lemmas or theorems regarding to . Furthermore, to see the robust application of local antimagic coloring, at the end of this paper we will analyse the implementation of local antimagic coloring on Graph Neural Networks (GNN) multi-step time series forecasting on for NPK (Nitrogen, Phosphorus, and Potassium) concentration of companion plantations.
The Reflexive H-Strength on Some Graphs Sullystiawati, Lusia Herni; Marsidi, Marsidi; Putra, Eric Dwi; Agustin, Ika Hesti
CAUCHY: Jurnal Matematika Murni dan Aplikasi Vol 9, No 1 (2024): CAUCHY: JURNAL MATEMATIKA MURNI DAN APLIKASI
Publisher : Mathematics Department, Universitas Islam Negeri Maulana Malik Ibrahim Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/ca.v9i1.23172

Abstract

Let G be a connected, simple, and undirected graph with a vertex set V(G) and an edge set E(G).  The irregular reflexive -labeling is defined by the function  and  such that  if  and  if , where  max . The irregular reflexive  labeling is called an -irregular reflexive -labeling of the graph  if every two different sub graphs  and  isomorphic to  it holds , where  for the sub graph . The minimum  for graph  which has an -irregular reflexive -labelling is called the reflexive  strength of the graph  and denoted by . In this paper we determine the lower bound of the reflexive  strength of some subgraphs,  on , the sub graph  on  the sub graph  on  and the sub graph  on .