Claim Missing Document
Check
Articles

Found 26 Documents
Search

Pengelompokan Tingkat Stres Akademik Pada Mahasiswa Menggunakan Algoritma K-Medoids Nurfadilah, Nova Siska; Budianita, Elvia; Nazir, Alwis; Insani, Fitri; Susanti, Reni
Building of Informatics, Technology and Science (BITS) Vol 7 No 1 (2025): June (2025)
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v7i1.7409

Abstract

Academic stress is one of the common problems issues by university students due to heavy with heavy workloads, grade pressure, and various academic This condition can have a negatively impact on mental health, productivity and overall academic performance. In the long term, unmaged stress may lead serious psychological disorders. Therefore, it is important to accurately identify and classify the levels of academic stress. This study aims to cluster students’ academic stress levels by utilizing the K-Medoids algorithm. The data analyzed in the research were collected through questionnaires that were filled out by 507 students from the 2021-2023 cohorts, based on a modified version of the Perception of Academic Stress Scale (PASS). The results show that the K-medoids algorithm successfully clustered the data in 2 groups: cluster 0, which represents a moderate stress level with 212 students, and cluster 1, which indicates a high stress level with 295 students. This high-stress cluster exhibited higher average cores on questions 12 and 13 (score 3-5), which fall under the favorable category and are suspected to be the main triggers of academic stress among students in this group. Based on two evalutation metrics-Silhouette Coeficient and Davies-Bouldin Index (DBI)-it can be concluded that the optimal number of clusters for this data set is K=2. However, the clustering separation was not optimal due to he variation in study programs and the uneven distribution of respondets across academic years. This research is expected to provide direction the development intervation policies and strategies to support student welfare.
Penerapan Algoritma K-Means Untuk Mengelompokkan Tingkat Stres Akademik Pada Mahasiswa Wiranti, Lusi Diah; Budianita, Elvia; Nazir, Alwis; Insani, Fitri; Susanti, Reni
Building of Informatics, Technology and Science (BITS) Vol 7 No 1 (2025): June (2025)
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v7i1.7410

Abstract

Academic stress is a prevalent concern among university students, often arising from various challenges within the academic environment. These challenges may include tight assignment deadlines, elevated expectations from both lecturers and parents, ineffective time management, and negative self-assessment. If left unaddressed, such stress can negatively impact students’ academic performance and mental well-being. This study focuses on categorizing student academic stress levels using the K-Means clustering algorithm. Data were collected from 507 participants through a customized version of the Perception of Academic Stress Scale (PASS) questionnaire, adapted to suit the study context. Prior to analysis, the data were preprocessed and converted into a numerical format. Clustering was performed using Python on the Google Colab platform. To assess the clustering performance, two evaluation metrics were used: the Davies-Bouldin Index (DBI) and the Silhouette Coefficient. Lower DBI values suggest that the clusters formed are more compact and distinct from each other, while higher Silhouette values indicate better clustering performance. From the evaluation, the best clustering result was found when the number of clusters was 2, with a DBI score of 1.43 and a Silhouette score of 0.27. Nonetheless, these values still fall short of the ideal range, likely due to the heterogeneous nature of the data, as participants came from five different departments within the Faculty of Science and Technology. Moreover, the number of responses varied across academic years (2021–2023). Cluster 1 comprised 229 students identified as having low levels of academic stress, as shown by their lower questionnaire scores. In contrast, Cluster 2 consisted of 278 students with higher levels of stress, as reflected in their higher scores (ranging from 3 to 5) on positively worded items.
Klasifikasi Tingkat Keberhasilan Produksi Ayam Broiler di Riau Menggunakan Algoritma Naïve Bayes Hamwar, Syahbudin; Nazir, Alwis; Gusti, Siska Kurnia; Iskandar, Iwan; Insani, Fitri
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 5 No. 2 (2023): Desember 2023
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v5i2.7038

Abstract

Livestock is becoming one of the important animal protein source providers, along with the fisheries sector, to meet the protein needs of the community at large. One type of livestock business that is popular is the maintenance of broiler chickens because of the potential for meat yield. Today, many breeders run a partnership pattern with large companies where breeders play the role of the main supplier and the company as the core. This step helps maintain the stability of production and income of farmers. The success of farmers in broiler chicken production can be measured by looking at the performance index (IP), if the performance is not good then coaching from the core company is needed. The large amount of data obtained from farmers makes it difficult for core companies to model the success rate of farmer production, this can make it difficult for core companies to choose farmers who need coaching. The application of data mining methods using the Naïve Bayes algorithm classification model has the potential to provide solutions to this problem. The purpose of this study was to predict how much success rate of broiler chicken production in Riau region by utilizing the Naïve Bayes Classifier algorithm. This study utilizes a production data set involving 952 broiler chicken farmers in Riau, with 3 scenarios dividing the data ratio of 90:10, 80:20, and 70:30. The results of the analysis showed that through the evaluation of the confusion matrix, it was best found in a data ratio of 90:10 with accuracy results reaching 89,58%, precision reaching 89,89%, and recall reaching 90,16%.
Analisis Perbandingan Algoritma C4.5 dan Modified K-Nearest Neighbor (MKNN) untuk Klasifikasi Jamur Rahmadhani, R.; Nazir, Alwis; Syafria, Fadhilah; Afriyanti, Liza
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 5 No. 2 (2023): Desember 2023
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v5i2.7052

Abstract

Mushrooms are organisms that consist of several cells, contain spores, are eukaryotic (have a cell nucleus membrane), and do not have chlorophyll, so fungi depend on other organisms to get food. Mushrooms have very identical shapes, starting with size, shape, smell, and color. So it is difficult for ordinary people to differentiate between poisonous mushrooms and non-poisonous mushrooms. Mistakes in identifying mushrooms can have fatal consequences because they can cause poisoning when consuming mushrooms. Therefore, there is a need for education in classifying poisonous and non-poisonous mushrooms. By applying various classification algorithms, it can be determined which algorithm performs better. In previous research conducted by several researchers on classifying mushrooms, there were differences in the accuracy results for each algorithm. Therefore, this research will raise the question of how to measure or comparion algorithm performance in classification using the C4.5 algorithm and the Modified K-Nearest Neighbor (MKNN) algorithm. The results obtained by comparion the performance of the C4.5 algorithm and the Modified K-Nearest Neighbor (MKNN) algorithm in this research show that the C4.5 algorithm managed to obtain an accuracy level of 98.52%, precision of 98.55%, recall of 98.52%, and f1-score of 98.51%. In contrast, the Modified K-Nearest Neighbor (MKNN) algorithm using the value K=10 achieved an accuracy level of 96.62%, precision of 96.69%, recall of 96.62%, and f1-score value of 96.57%.
Clustering Data Persediaan Barang Menggunakan Metode Elbow dan DBSCAN Berliana, Trisia Intan; Budianita, Elvia; Nazir, Alwis; Insani, Fitri
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 5 No. 2 (2023): Desember 2023
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v5i2.7089

Abstract

In the world of business and inventory management, efficient inventory management is very important. If a company does not have inventory, it is impossible to fulfill consumer desires. Managing inventory requires careful inventory management and good data analysis. Challenges in inventory involve unpredictable fluctuations in demand, making it difficult to determine optimal inventory levels. Product diversification with various characteristics is also an obstacle, hindering grouping and formulating inventory management strategies. The lack of clear product segmentation adds to the inhibiting factor, making it difficult to identify groups of similar goods. Inefficient stockpiling can be detrimental to the business as a whole, so implementing clustering is necessary to optimize inventory strategies based on product characteristics. By analyzing product groups, companies can develop more efficient and effective inventory management strategies. This research uses a clustering method using the elbow method and DBSCAN (Density-Based Spatial Clustering of Applications with Noise). The elbow method is used to determine the most optimal EPS and Minpts values. The aim of this research is to group goods inventory data using the attributes Initial quantity (initial stock), quantity sold (stock sold), and quantity available (available product stock). So that grouped data can make it easier for companies to optimize the inventory of the most sold goods. and fans. Based on the elbow and DBSCAN test results, 144 clusters and 0 noise data were obtained, with cluster 2 being the product with the largest number of sales and inventory. The DBSCAN method which was tested without using elbows obtained cluster 3 results and 959 noise data.
Klasifikasi Sentimen Presepsi Masyarakat di Instagram Terhadap Paslon Pilpres 2024 Menggunakan Naïve Bayes Classifier (NBC) Akbar, Lionita Asa; Haerani, Elin; Syafria, Fadhilah; Nazir, Alwis; Budianita, Elvia
Jurnal Komtika (Komputasi dan Informatika) Vol 8 No 1 (2024)
Publisher : Universitas Muhammadiyah Magelang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31603/komtika.v8i1.11293

Abstract

The 2024 presidential election has attracted considerable attention as it has become a controversial issue among the public. Various positive and negative opinions generated can potentially turn into rumors. One of the means used by the public to express their opinions is the social media platform Instagram. Data on public opinions on Instagram can be processed into valuable information through sentiment classification. This research conducted sentiment classification on public perceptions towards the 2024 presidential candidates using a naïve Bayes classifier. The study utilized a dataset consisting of 1000 comments. These comments were collected from several posts on the social media platform Instagram discussing the presidential and vice-presidential candidates. The comments were manually labeled by an expert who is a lecturer in the Indonesian language. Classification was carried out after preprocessing and weighting TF-IDF stages. Based on the research findings, the naïve Bayes classifier method showed an accuracy of 82% and an F1-Score of 83.93% obtained from a 90%:10% split of training and testing data. These results indicate that the naïve Bayes classifier method is effective in classifying the sentiments of the public on Instagram towards the 2024 presidential candidates.