Article Per Year (5 Year)
p-Index From 2020 - 2025
0.817
P-Index
This Author published in this journals
All Journal JISKa (Jurnal Informatika Sunan Kalijaga) Sisfo: Jurnal Ilmiah Sistem Informasi Journal of Advanced Computer Knowledge and Algorithms
Yafis, Balqis
Unknown Affiliation
Computer Science & IT Decision Sciences, Operations Research & Management Education Electrical & Electronics Engineering Engineering Library & Information Science Mechanical Engineering

Published : 4 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 4 Documents
Search

 1 
ANALISA PENGARUH UKURAN BUFFER UNTUK SISTEM DUPLIKASI FILE BERSKALA BESAR PADA TEMPORARY FILE SYSTEM Rijal, Himmatur; Yafis, Balqis
Sisfo: Jurnal Ilmiah Sistem Informasi Vol. 6 No. 2 (2022): Sisfo: Jurnal Ilmiah Sistem Informasi, Oktober 2022
Publisher : Universitas Malikussaleh

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29103/sisfo.v6i2.10295

Abstract

Dalam penelitian mengidentifikasi pengaruh ukuran buffer dalam proses duplikasi file dengan ukuran file 1 gigabyte (GB) dan menggunakan sistem file tmpfs. Baseline code menggunakan operasi tingkat-rendah (low-level operation) seperti open(), creat(), read(), dan write(). Penelitian ini bertujuan untuk mengoptimasi proses duplikasi file menggunakan tiga metode. Pada tahap awal, penulis mengidenfikasi beberapa isu yang terdapat pada operasi read/write pada sistem file linux. Terdapat tiga metode yang akan diinvestgasi dalam penelitian ini, pertama, meningkatkan ukuran buffer, kedua membandingkan fungsi  creat() dan open(), ketiga menganalisa fungsi O_Direct() pada tmpfs. Untuk duplikasi file, ukuran buffer menjadi hambatan kinerja pada proses sistem file ini. Karena jumlah read() tergantung pada ukuran buffer, sehingga operasi baca-tulis terus beralih antara mode pengguna dan mode kernel.
Implementation of K-NN Algorithm to classify the Scholarship Recipients of Aceh Carong at Universitas Malikussaleh Yanti, Riski; Retno, Sujacka; Yafis, Balqis
Journal of Advanced Computer Knowledge and Algorithms Vol 1, No 1 (2024): Journal of Advanced Computer Knowledge and Algorithms - January 2024
Publisher : Department of Informatics, Universitas Malikussaleh

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29103/jacka.v1i1.14534

Abstract

In an effort to increase the efficiency of the scholarship selection process, this research aims to implement the K-Nearest Neighbors (K-NN) algorithm in the classification of scholarship recipients. The research method involves collecting data on scholarship receipts from several previous years based on predetermined criteria such as father's job, mother's job, parent's income, number of parents working, father's last education, and mother's last education. Next, the K-NN algorithm is applied to classify prospective scholarship recipients based on the similarity of their profiles to students who have received previous scholarships. The results of this research indicate that the implementation of the K-NN algorithm in the classification of scholarship admissions at Malikussaleh Aceh Carong University can increase selection accuracy. The experimental results of the accuracy values obtained show that using the K-Nearest Neighbors algorithm with the Euclidean Distance approach and a value of K = 3 produces an algorithm accuracy level of 87.55%. Thus, the K-NN algorithm can be a useful method for scholarship selectors to support more precise and objective decision making.
K-NN with Purity Algorithm to Enhance the Classification of the Air Quality Dataset Retno, Sujacka; Hasdyna, Novia; Yafis, Balqis
Journal of Advanced Computer Knowledge and Algorithms Vol 1, No 2 (2024): Journal of Advanced Computer Knowledge and Algorithms - April 2024
Publisher : Department of Informatics, Universitas Malikussaleh

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29103/jacka.v1i2.15890

Abstract

The large number of attributes in a large dataset can cause a decrease in the level of classification accuracy. Attribute reduction can be a solution to improve classification performance, especially in the K-NN algorithm. This research discusses the classification results of K-NN with attribute reduction using Purity. Based on the results of testing carried out on the Air Quality Dataset, the level of accuracy obtained after attribute reduction was 70.71%, while the level of accuracy obtained before attribute reduction was 56.44%, the increase in accuracy obtained from testing this dataset was equal to 14.27%. The proposed Purity method for attribute reduction can increase the accuracy level of the K-NN classification process.
Optimizing K-Means Algorithm Using the Purity Method for Clustering Oil Palm Producing Regions Hasdyna, Novia; Dinata, Rozzi Kesuma; Yafis, Balqis
JISKA (Jurnal Informatika Sunan Kalijaga) Vol. 10 No. 1 (2025): January 2025
Publisher : UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14421/jiska.2025.10.1.1-15

Abstract

The K-Means algorithm is a fundamental tool in machine learning, widely utilized for data clustering tasks. This research aims to enhance the performance of the K-Means algorithm by integrating the Purity method, with a specific focus on clustering regions renowned for oil palm production in North Aceh. Oil palm cultivation is a vital agricultural sector in North Aceh, contributing significantly to the local economy and employment. This study examines two clustering techniques: the conventional K-Means algorithm and an optimized version, Purity K-Means. Integrating the Purity method enhances the efficiency of K-Means by reducing the number of required convergence iterations. The data used for clustering analysis is sourced from the Department of Agriculture and Food in North Aceh Regency and pertains to oil palm production in 2023. The findings indicate that the Purity K-Means approach notably reduces the iteration count and improves cluster quality. The average Davies-Bouldin Index (DBI) for standard K-Means is 0.45, whereas the Purity K-Means method lowers it to 0.30. Furthermore, applying the Purity method reduced the number of K-Means iterations from 15 to just 3. These results highlight an enhancement in clustering performance and overall efficiency.
Co-Authors Rijal, Himmatur Rozzi Kesuma Dinata Sujacka Retno Yanti, Riski