Claim Missing Document
Check
Articles

Found 22 Documents
Search

COMPARATIVE ANALYSIS OF MACHINE LEARNING METHODS IN CLASSIFYING THE QUALITY OF PALU SHALLOTS Lusiyanti, Desy; Musdalifah, Selvy; Sahari, Agusman; Fajri, Iman Al
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 19 No 3 (2025): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol19iss3pp1853-1864

Abstract

This study conducts a comparative analysis of various machine learning methods for classifying the quality of Palu shallots based on the Indonesian National Standard (SNI). The dataset consists of 1,500 samples of Palu shallots, each characterized by 10 key features, including size, color, texture, and moisture content. Five machine learning models—Naïve Bayes, Decision Tree, Random Forest, Support Vector Machine (SVM), and Logistic Regression—were evaluated using accuracy, precision, recall, and F1 score as performance metrics. The results indicate that Random Forest achieved the best performance with an accuracy of 95.4%, followed by Decision Tree (90.7%) and SVM (90.2%). Random Forest also excelled in precision (93.6%) and F1 Score (93.5%), making it the most reliable model for shallot quality classification. Meanwhile, SVM demonstrated a good balance between recall and precision, making it a strong alternative. Implementing machine learning models has the potential to enhance the efficiency and accuracy of agricultural product quality assurance. The findings of this study provide valuable insights for farmers, agribusiness practitioners, and researchers adopting artificial intelligence technology for more precise and efficient agricultural quality assessment.
Total Edge Irregularity Strength of Graph L_3⊙N_m Nikita; Sri Nurhayati; Trisha Magdalena A. Jauvani; Selvy Musdalifah; Iman Al Fajri; Andri
Riemann: Research of Mathematics and Mathematics Education Vol. 7 No. 2 (2025): EDISI AGUSTUS
Publisher : Program Studi Pendidikan Matematika Universitas Katolik Santo Agustinus Hippo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.38114/reimann.v7i2.104

Abstract

An edge irregular total k-labeling of a simple graph  is a labeling that assigns positive integers to its vertices and edges such that the weight of every edge, defined as the sum of the labels of the edge and its two incident vertices, is distinct. The smallest integer  that allows such a labeling is called the total edge irregularity strength, denoted by  In this paper, we study the total edge irregularity strength of the corona product of a ladder graph ​ and a null graph ​, denoted by  By applying constructive labeling and analyzing the resulting edge weights, we show that all edges can be assigned distinct weights. From Theorem 1, it is obtained that . This result contributes to the development of graph labeling theory and can be extended to larger ladder graphs for further applications, including cryptography and network security.