Claim Missing Document
Check
Articles

Found 5 Documents
Search

Penerapan Metode Clustering Dalam Pengelompokan Kasus Perceraian Pada Pengadilan Agama di Kota Pekanbaru Menggunakan Algoritma K-Medoids Satria Bumartaduri; Siska Kurnia Gusti; Fadhilah Syafria; Elin Haerani; Siti Ramadhani
JURIKOM (Jurnal Riset Komputer) Vol 10, No 1 (2023): Februari 2023
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/jurikom.v10i1.5560

Abstract

Divorce is the breaking of a husband and wife relationship from a marriage. When a couple does not want to continue their marriage relationship, one of the factors causing divorce is that the husband and wife do not carry out their duties properly. Divorce cases also occur in the city of Pekanbaru and have increased from 2020 to 2022. In connection with this problem, researchers conducted research with the aim of classifying districts in Pekanbaru that have the most divorces. The method used in this study is K-Medoids Clustering, because this method can divide a dataset into several groups. The advantage of this method is that it can overcome the weaknesses of the K-Means algorithm which are sensitive to outliers. The tests used in this study use the RapidMiner tools and the Davies Bouldin Index to ensure cluster accuracy. Attributes used in this research are region/regency, age difference between spouses, plaintiff's and defendant's education, and reasons for divorce. The results of this study can be used as information for the government to reduce the divorce rate in the city of Pekanbaru so that appropriate programs can be developed for each sub-district in overcoming the divorce rate in Pekanbaru. From testing using the K-Medoids algorithm, the cluster results obtained showed that the highest divorce rate was in cluster 1 with 565 items, while cluster 2 had 395 items and cluster 3 had 288 items. The results of the study show that the use of 3 clusters is the best cluster with a DBI value of 0.884.
Implementasi Triple Exponential Smoothing dan Double Moving Average Untuk Peramalan Produksi Kernel Kelapa Sawit Risfi Ayu Sandika; Siska Kurnia Gusti; Lestari Handayani; Siti Ramadhani
Journal of Information System Research (JOSH) Vol 4 No 3 (2023): April 2023
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/josh.v4i3.3359

Abstract

The production of palm kernel is a significant product for the company and plays a crucial role. Nevertheless, the stability of kernel production is not always consistent, and the quality of the kernel can be detrimental to the company. As consumer demands change over time, companies must anticipate every fluctuation in palm kernel production. Hence it is vital to figure the long run with a settlement prepare utilizing information mining utilizing information within the past. The Triple Exponential Smoothing and Double Moving Average methods, which are data mining methods for future forecasting, were used in this study. The aim of this research is to predict the yield of future oil palm kernel production using the Triple Exponential Smoothing and Double Moving Average methods and to determine the level of forecasting errors using the Mean Absolute Percentage Error (MAPE) method. The data for the last ten years, from January 2013 to December 2022, were used in this study. After testing the Triple Exponential Smoothing method with parameters α=0.2,β=0.γ=0.2, the error rate using MAPE was 9.48%, and the Double Moving Average method had an error rate of 11.2%. The MAPE results of the Triple Exponential Smoothing method are considered very good, while the MAPE results of the Double Moving Average method are categorized as good based on the range of MAPE values. This research is expected to provide information to related companies as a supporting reference in anticipating palm oil kernel production. The conclusion of the research is that the Triple Exponential Smoothing method with the test parameters is the best method for forecasting.
Perbandingan Klasifikasi Citra CT-Scan Kanker Paru-Paru Menggunakan Contrast Stretching Pada CNN dengan EfficientNet-B0 Alfitra Salam; Febi Yanto; Surya Agustian; Siti Ramadhani
KLIK: Kajian Ilmiah Informatika dan Komputer Vol. 4 No. 3 (2023): Desember 2023
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/klik.v4i3.1448

Abstract

Data from the World Health Organization (WHO) indicates that in 2020, approximately 10 million people died from cancer. Smoking has been identified as a primary factor causing lung cancer, as cigarettes contain over 60 toxic substances that can trigger the development of the disease. The rate of lung cancer has rapidly increased due to excessive cigarette consumption. Detecting nodules in the lungs typically takes about 10-30 minutes. In this study, a Convolutional Neural Network (CNN) algorithm with EfficientNet-B0 architecture is employed to classify lung cancer. The preprocessing process involves contrast stretching, and various hyperparameter optimization techniques such as Adam, Adagrad, and SGD are used to enhance the CNN's performance. Average pooling with output dense layers of 64, 32, 16, 1 is utilized. Performance analysis is conducted using a confusion matrix. The highest classification results are achieved using the ADAM optimizer with a learning rate of 0.01, where accuracy reaches 72.48%, precision is 71.52%, recall is 64.2%, and the F1 score is 64.76%. Meanwhile, results obtained from the original dataset show differences. The highest classification result is obtained using the ADAM optimizer with a learning rate of 0.01, achieving an accuracy of 64.22%, precision of 52.69%, recall of 50.52%, and an F1 score of 43.51%. These results indicate that the use of contrast stretching in lung cancer classification preprocessing is highly effective in improving accuracy
Klasifikasi Data Penerimaan Zakat dengan Algoritma K-Nearest Neighbor Alfin Hernandes; Siska Kurnia Gusti; Fadhilah Syafria; Lestari Handayani; Siti Ramadhani
KLIK: Kajian Ilmiah Informatika dan Komputer Vol. 4 No. 3 (2023): Desember 2023
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/klik.v4i3.1528

Abstract

National Amil Zakat Agency (BAZNAS) is an institution responsible for managing zakat established by the government. BAZNAS has a presence in every district or city, and one of them is the BAZNAS in the city of Pekanbaru. BAZNAS in Pekanbaru city is responsible for distributing zakat to various empowerment programs, one of which is the Pekanbaru Cares program. Currently, BAZNAS in Pekanbaru city is facing issues related to the method of distributing zakat, where the process of determining the criteria for zakat recipients is still being done manually by the committee of BAZNAS in the city of Pekanbaru. This condition is considered inefficient and poses one of the challenges that need to be addressed. To overcome the mentioned constraints, steps are needed to improve the effectiveness and efficiency of data collection for potential zakat recipients. One of the solutions is to implement a classification system to facilitate the data collection process, using the K-Nearest Neighbor (KNN) method. This approach functions as a tool to classify data for potential beneficiaries. This research aims to classify data and measure the accuracy in assessing the eligibility of zakat recipients based on predetermined criteria, utilizing the K-Nearest Neighbor (K-NN) algorithm. A total of 602 data from BAZNAS in the city of Pekanbaru were used in this study, by dividing the training and test data, namely divided 90:10, 80:20, and 70:30 splits. The evaluation results from the confusion matrix of k=3, k=5, k=7, k=9, and k=11 show that the highest accuracy is achieved at k=5 with an 80:20 split, with an accuracy rate of 89.3%. Furthermore, a precision of 87.3% and a recall of 91.4% can also be attained through this approach.
Perbandingan Triple Exponential Smoothing dan Fuzzy Time Series untuk Memprediksi Netto TBS Kelapa Sawit Raja Indra Ramoza; Siska Kurnia Gusti; Lestari Handayani; Siti Ramadhani
Journal of Computer System and Informatics (JoSYC) Vol 4 No 3 (2023): May 2023
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/josyc.v4i3.3433

Abstract

Oil palm plays a crucial role in agriculture and plantations in Indonesia as a commodity with high economic potential. Net Fresh Fruit Bunches (FFB) production is an essential desired outcome in an oil palm plantation. Net FFB is utilized as the primary raw material for the production of Crude Palm Oil (CPO) and Palm Kernel Oil (PKO). The existing challenge is that companies seek to achieve precise quantities and timing for net FFB production in oil palm. One proactive measure to address this is by predicting the net FFB production. Therefore, the objective of this research is to forecast net FFB production by comparing triple exponential smoothing and fuzzy time series methods. Data processing results demonstrate that both forecasting methods yield excellent quality predictions for net FFB production. In the conducted testing, both methods achieved low forecast error values, with MAPE of 11.14670196% and 10.44596891% respectively. However, fuzzy time series exhibited a lower error value compared to the triple exponential smoothing method. Based on these findings, it can be concluded that fuzzy time series is the most reliable model for accurately predicting net FFB production. The advantage of fuzzy time series in forecasting net FFB production can provide significant benefits for companies in determining appropriate strategies for future planning.