Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : INFORMAL: Informatics Journal

Implementasi Metode Fuzzy Sebagai Sistem Kontrol Kepekatan Nutrisi Otomatis Tanaman Hidroponik Berbasis Mikrokontroler Pasa Rangkaian Nutrient Film Technique (NFT) Kurniawan Dwi Yulianto; Achmad Maududie; Nova El Maidah
INFORMAL: Informatics Journal Vol 7 No 1 (2022): Informatics Journal (INFORMAL)
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v7i1.29386

Abstract

Hydroponics is a method of cultivating plants by utilizing water as a growth medium by emphasizing on meeting the nutritional needs of hydroponic plants. Hydroponics requires special treatment such as maintaining nutrient levels within the range so that the use of a control system is used. The implementation of the automatic nutrition control system aims to make it easier for farmers to regulate the mixing of AB mix + POC nutrients with water at the PPM value of lettuce plants automatically based on the age of plant growth, so that farmers can produce plants with optimal growth and maximum yields. The hydroponic nutrition control system uses the Fuzzy method. The system will also be integrated with the Arduino Uno microcontroller which is equipped with a Total Dissolved Solids (TDS) sensor. The results of this study can be seen that the success of the system can work well in detecting nutrients in the reservoir and can control pumps and water pumps in low, normal, and high conditions. The sensor used can also work well, where the TDS sensor has an error value of 4.81% and then calibration is carried out so that it gets the equation for the TDS value
The Implementation of Minimum Forest Graph for Centroid Updating Process on K-Means Algorithm Achmad Maududie; Wahyu Catur Wibowo
INFORMAL: Informatics Journal Vol 3 No 3 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v3i3.10239

Abstract

K-Means is a well known algorithms of clusteing. It generates some groups based on degree of similarity. Simplicity of implementation, ease of interpretation, adaptability to sparse data, linear complexity, speed of convergence, and versatile in almost every aspect are noble characteristics of this algorithm. However, this algorithm is very sensitive on defining initial centroids process. Giving a bad initial centroid always produces a bad quality output. Due to this weakness, it is recommended to make some runs with different initial centroids and select the initial centroid that produces cluster with minimum error. However, this procedure is hard to achieve a satisfying result. This paper introduces a new approach to minimize the initial centroid problem of K-Means algorithm. This approach focus on centroid updating stage in K-Means algorithm by applying minimum forest graph to produce better new centroids. Based on gain information and Dunn index values, this approach provided a better result than Forgy method when this approach tested on both well distributed and noisy dataset. Moreover, from the experiments with two dimentional data, the proposed approach produced consisten members of each cluster in every run, where it could not be found in Forgy method.
The Implementation of Minimum Forest Graph for Centroid Updating Process on K-Means Algorithm Achmad Maududie
INFORMAL: Informatics Journal Vol 3 No 3 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

K-Means is one of algorithms based on partitioning clustering method, particularly on sum-of-squared error criterion. It generates a single partition data for a single group of data that has high degree in similarity. This method has some advantages such as linear complexity, ease of interpretation, simplicity of implementation, speed of convergence, adaptability to sparse data, and versatile in almost every aspect. However, this method also has some weaknesses, such as very sensitive to initial centroids (center) that drives the quality of clustering output. Although there is a recommendation to make some runs with different initial centroids and select the initial centroid that produces cluster with minimum error, frequently, this procedure does not achieve a satisfying result. This paper introduces a new method to overcome this problem through enhancing the refinement mechanism in K-Means algorithm. This method focuses on rebuilding new centroids using minimum forest graphs to reproduce better models in the refinement mechanism. Based on the conducted experiments, the proposed method yielded better value of gain information and Dunn index than Forgy method in both relatively well distributed and relatively noisy dataset. Furthermore, the members of each cluster in every run of the conducted experiments were consistent for the proposed method, while it was not happen for Forgy method.