Article Per Year (5 Year)
p-Index From 2021 - 2026
13.032
P-Index
This Author published in this journals
All Journal TEKNIK INFORMATIKA Syntax Jurnal Informatika Jurnal Ilmu Komputer dan Agri-Informatika SITEKIN: Jurnal Sains, Teknologi dan Industri CESS (Journal of Computer Engineering, System and Science) Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) RABIT: Jurnal Teknologi dan Sistem Informasi Univrab Jurnal Informatika Jurnal CoreIT JURNAL MEDIA INFORMATIKA BUDIDARMA Indonesian Journal of Artificial Intelligence and Data Mining Seminar Nasional Teknologi Informasi Komunikasi dan Industri INOVTEK Polbeng - Seri Informatika JURNAL INSTEK (Informatika Sains dan Teknologi) Jurnal Informatika Universitas Pamulang Jurnal Nasional Komputasi dan Teknologi Informasi JURIKOM (Jurnal Riset Komputer) JIPI (Jurnal Ilmiah Penelitian dan Pembelajaran Informatika) JOISIE (Journal Of Information Systems And Informatics Engineering) Building of Informatics, Technology and Science Progresif: Jurnal Ilmiah Komputer bit-Tech Zonasi: Jurnal Sistem Informasi Journal of Applied Engineering and Technological Science (JAETS) Jurnal Tekinkom (Teknik Informasi dan Komputer) JOURNAL OF INFORMATION SYSTEM MANAGEMENT (JOISM) Indonesian Journal of Electrical Engineering and Computer Science JOURNAL OF INFORMATION SYSTEM RESEARCH (JOSH) Journal of Computer System and Informatics (JoSYC) Jurnal Sistem Komputer dan Informatika (JSON) JUKI : Jurnal Komputer dan Informatika TIN: TERAPAN INFORMATIKA NUSANTARA Jurnal Teknik Informatika (JUTIF) Jurnal Restikom : Riset Teknik Informatika dan Komputer Information System Journal (INFOS) Jurnal Computer Science and Information Technology (CoSciTech) Jurnal UNITEK Bulletin of Computer Science Research KLIK: Kajian Ilmiah Informatika dan Komputer Jurnal Informatika Teknologi dan Sains (Jinteks) Sisfo: Jurnal Ilmiah Sistem Informasi Malcom: Indonesian Journal of Machine Learning and Computer Science Jurnal Teknik Indonesia Indonesian Journal of Multidisciplinary on Social and Technology Jurnal Informatika: Jurnal Pengembangan IT Jurnal Komtika (Komputasi dan Informatika)
Fadhilah Syafria
Universitas Islam Negeri Sultan Syarif Kasim Riau
Aerospace Engineering Agriculture, Biological Sciences & Forestry Arts Humanities Automotive Engineering Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Dentistry Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Health Professions Immunology & microbiology Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Library & Information Science Materials Science & Nanotechnology Mathematics Mechanical Engineering Medicine & Pharmacology Neuroscience Nursing Physics Social Sciences Transportation Veterinary Other

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

Found 117 Documents
Search

 8   9   10   11   12 
Early Detection of Foetal Pathological Conditions with Neural Network Method: Implementation of Backpropagation Neural Network and SMOTE on Cardiotocography Data Elin Haerani; Fadhilah Syafria; Novriyanto Novriyanto; Ismail Marzuki
Journal of Applied Engineering and Technological Science (JAETS) Vol. 7 No. 2 (2026): Journal of Applied Engineering and Technological Science (JAETS)
Publisher : Yayasan Riset dan Pengembangan Intelektual (YRPI)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37385/3n6z5n26

Abstract

This research focuses on the development of an effective classification model for early detection of foetal pathological conditions using Cardiotocography (CTG) data by utilising the Backpropagation Neural Network (BPNN) method. The high maternal mortality rate (MMR) and infant mortality rate (IMR) in Indonesia, including Riau Province, emphasise the importance of accurate prenatal diagnosis. The main challenge of this research is to address the class imbalance issue in the CTG dataset, which is biased towards the Normal class (77.9%) compared to the Suspect (13.9%) and Pathological (8.2%) classes. This problem was addressed by applying the Synthetic Minority Oversampling Technique (SMOTE). The model's performance was evaluated using K-Fold Cross Validation (5-Fold and 10-Fold). The test results showed that the combination of BPNN and SMOTE significantly improved performance, achieving a highest average accuracy of 92.66% and a maximum accuracy of 94.84% in the 10-Fold Cross Validation scheme. The resulting model is stable, has a high generalisation capability, and has great potential to be integrated into an Artificial Intelligence (AI)-based Clinical Decision Support System (CDSS) to support evidence-based health policies in reducing Maternal Mortality Rate (MMR) and Infant Mortality Rate (IMR).
Application of ADASYN and Bayesian Optimization to Random Forests for Cervical Cancer Classification Restu Kharrisa Andini; Iis Afrianty; Muhammad Fikry; Fadhilah Syafria
Sisfo: Jurnal Ilmiah Sistem Informasi Vol. 10 No. 1 (2026): Sisfo: Jurnal Ilmiah Sistem Informasi, Mei 2026
Publisher : Universitas Malikussaleh

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

Abstract

Accurate early detection is crucial for reducing mortality rates from cervical cancer. However, the application of machine learning to medical data is often hindered by class imbalance, causing prediction results to be biased toward the majority class. On the other hand, the process of parameter search using conventional methods such as GridSearchCV requires significant computational time. Therefore, this study proposes the application of the ADASYN (Adaptive Synthetic Sampling) method and Bayesian optimization to the Random Forest algorithm. In its implementation, ADASYN is used to adaptively synthesize minority data samples to rebalance their distribution. Meanwhile, Bayesian optimization serves to determine the optimal hyperparameter combination through a faster probabilistic approach. Model evaluation was conducted across four testing scenarios with training-to-test data splits of 90:10, 80:20, and 70:30. Findings from this study indicate that the standard Random Forest algorithm still produces biased predictions. However, classification performance improved significantly after the model was combined with ADASYN and Bayesian Optimization. The optimal results were achieved at a 70:30 ratio, recording accuracy of 98.06%, precision of 97.03%, recall of 99.13%, and an F1-score of 98.07%, with a computation time of 32.66 seconds. Overall, the proposed model successfully addresses data imbalance while reducing optimization time, enabling it to predict biopsy diagnoses with high precision.
Penerapan Metode Backpropagation Neural Network untuk Mengidentifikasi Penyakit Cacar Monyet Lola Oktavia Oktavia; Muhammad Farid Audi Rahman Simatupang; Fadhilah Syafria; Elin Haerani; Siti Ramadhani
Indonesian Journal of Multidisciplinary on Social and Technology Vol. 4 No. 2 (2026): Maret - Juni
Publisher : PT Ilmu Data Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.69693/ijmst.v4i2.8777

Abstract

Monkeypox is a zoonotic disease caused by the monkeypox virus of the genus orthopoxvirus, which belongs to the family of poxviridae and is considered one of the dangerous skin diseases. Previously, the disease was detected using a PCR testing of skin lesion samples and analysis of the patients clinical symptoms. However, the increasing global spread of monkeypox in non-endemic regions demands for a rapid and accurate diagnostic method. This research proposes a machine learning approach based on artificial neural networks, employing the Backpropagation Neural Network (BPNN) method for monkeypox classification. The research scenario was conducted with variations in dataset split ratios (70:30, 80:20, and 90:10), one hidden layer, 18 neurons in the hidden layer, a learning rate of 0.1 and 0.01, and the application of ReLU and Binary Sigmoid activation functions, and compare of test results between the data balancing method SMOTE with the original dataset. The best scenario results were obtained from testing on the original dataset with a data split configuration of 80:20, 500 epochs, learning rate 0.1, achieving an accuracy of approximately 70.36%, a precision of 72.33%, a recall of 88.08%, and an F1-score of 79.26%.
Klasifikasi Hate Speech dan Offensive Language Menggunakan Hybrid RoBERTa dan XGBoost dengan Optimasi Hyperparameter: Hate Speech and Offensive Language Classification Using Hybrid RoBERTa and XGBoost with Hyperparameter Optimization Jauhari, Najwa; Agustian, Surya; Syafria, Fadhilah; Affandes, Muhammad
MALCOM: Indonesian Journal of Machine Learning and Computer Science Vol. 6 No. 3 (2026): MALCOM July 2026
Publisher : Institut Riset dan Publikasi Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.57152/malcom.v6i3.2834

Abstract

Ujaran kebencian dan bahasa ofensif di media sosial merupakan masalah serius yang membutuhkan deteksi otomatis yang akurat. Penelitian ini mengusulkan pendekatan hybrid yang menggabungkan model Robustly Optimised BERT Approach (RoBERTa) berbasis Twitter (cardiffnlp/twitter?roberta?base?offensive) sebagai ekstraktor fitur dengan algoritma XGBoost untuk klasifikasi pada dataset Hate Speech and Offensive Content Identification (HASOC) 2021 berbahasa Inggris. Kebaruan penelitian ini terletak pada integrasi optimasi hyperparameter Optuna, Multi?Seed Ensemble, Division Calibration, dan oversampling pada ruang fitur embedding yang belum pernah diterapkan secara bersamaan dalam satu pipeline pada HASOC 2021. Dua tugas diselesaikan : Task 1A adalah klasifikasi biner untuk membedakan konten Hate and Offensive (HOF) dari yang tidak (NOT). Task 1B adalah klasifikasi multi-kelas yang membagi tweet menjadi empat kategori: (ujaran kebencian terhadap kelompok) HATE, bahasa ofensif terhadap individu (OFFN), kata kasar tanpa target spesifik (PRFN), dan konten aman (NONE).  Ketidakseimbangan kelas ditangani dengan oversampling pada ruang fitur, dan optimasi hyperparameter dilakukan untuk meningkatkan performa. Hasil evaluasi pada data uji menunjukkan Macro F1?Score sebesar 0,8083 untuk Task 1A dan 0,6541 untuk Task 1B. Perbandingan dengan papan peringkat HASOC 2021 menunjukkan bahwa skor tersebut sebanding dengan tim peringkat 5 (Task 1A) dan peringkat 3 (Task 1B) yang berbasis BERT murni.
Penerapan Algoritma Fuzzy C-Means untuk Pengelompokan Kepuasan Masyarakat terhadap Layanan Berdasarkan Dimensi SERVQUAL Ramadhani Herfin; Fadhilah Syafria; Elvia Budianita; Iis Afrianty; Salmiyati Salmiyati
TIN: Terapan Informatika Nusantara Vol 7 No 1 (2026): June 2026
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

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

Abstract

Pekanbaru Public Service Mall (MPP) is an integrated service facility that brings together various government agencies in one location. The problem identified is the absence of an in-depth mapping of community satisfaction levels that can realistically represent satisfaction gradations, as the previous approach using K-Means Clustering is crisp in nature and unable to represent the subjective satisfaction of humans who may belong to more than one category simultaneously. Therefore, this study aims to cluster community satisfaction levels toward MPP Pekanbaru services based on five SERVQUAL dimensions using Fuzzy C-Means, and to identify service dimensions that require priority improvement. Unlike K-Means, Fuzzy C-Means allows each respondent to hold membership degrees in multiple clusters simultaneously, making it more suitable for multidimensional satisfaction data. Data were collected through questionnaires distributed to 532 respondents with 23 Likert-scale items (1–5) in accordance with five SERVQUAL dimensions and PermenPANRB Number 14 of 2017. The optimal number of clusters was determined using the Partition Coefficient Index (PCI) by testing four scenarios (c=2, 3, 4, 5). PCI evaluation results showed that c=2 is the optimal configuration with the highest PCI value of 0.799303, achieving convergence at the 12th iteration. Clustering results revealed that 283 respondents (53.2%) belong to Cluster 1 labeled Very Satisfied and 249 respondents (46.8%) belong to Cluster 2 labeled Satisfied. Per-dimension SERVQUAL analysis identified Responsiveness as the primary improvement priority with the largest inter-cluster gap (1.1857 points). The contribution of this research is to produce a Fuzzy C-Means-based community satisfaction clustering model capable of representing satisfaction gradations more realistically than crisp approaches, and to provide a SERVQUAL-based service improvement priority map that can serve as an evaluation reference for MPP Pekanbaru management and other public service institutions.
Analisis Komparatif Jarak Euclidean, Manhattan, Canberra, Chebyshev, Cosine pada K-Means untuk Evaluasi Kepuasan Masyarakat Fakhri Fakhri; Iis afrianty; Elvia Budianita; Fadhilah Syafria; Siska Kurnia Gusti; Salmiyati Salmiyati
TIN: Terapan Informatika Nusantara Vol 7 No 1 (2026): June 2026
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

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

Abstract

The selection of distance metrics in the K-Means Clustering algorithm can affect the quality of clustering results, particularly on public satisfaction data measured using a Likert scale. This study aims to compare the performance of five distance metrics, namely Euclidean Distance, Manhattan Distance, Canberra Distance, Chebyshev Distance, and Cosine Similarity, in clustering the level of public satisfaction toward public services. The research data were obtained from 533 respondents who used the services of the Mal Pelayanan Publik (MPP) Pekanbaru through a questionnaire consisting of 23 questions based on the SERVQUAL dimensions and the Community Satisfaction Survey indicators in accordance with PERMEN PAN-RB Number 14 of 2017. After the data cleaning process, one duplicate record was removed, resulting in 532 respondent records used in the analysis stage. The number of clusters was determined using the Elbow Method, while cluster quality was evaluated using the Davies-Bouldin Index (DBI) and Silhouette Score. The results show that Manhattan Distance with k=2 produced the lowest DBI value of 0.8144, whereas Euclidean Distance with k=3 produced the highest Silhouette Score of 0.5088. The clustering results formed groups of respondents with different satisfaction levels, namely Dissatisfied, Satisfied, and Very Satisfied. This study contributes an evaluative comparison of five distance metrics in the K-Means algorithm using two evaluation approaches simultaneously, namely the Davies-Bouldin Index and Silhouette Score, on public satisfaction data based on a Likert scale. The results indicate that the performance of distance metrics may differ depending on the evaluation method used, therefore the selection of distance metrics should consider the characteristics of the data and the objectives of the analysis.The difference in evaluation results indicates that DBI and Silhouette Score assess clustering quality from different aspects. Based on the findings, Manhattan Distance and Euclidean Distance demonstrated better performance compared to other distance metrics on the dataset used, and can therefore be considered in the analysis of public satisfaction toward public services.
Implementasi Data Mining K-Means Clustering Untuk Pengelompokan Produk Keramik Berdasarkan Frekuensi, Volume, dan Jangkauan Penjualan Ferdian Arya Dinata; Alwis Nazir; Fadhilah Syafria; Teddie Darmizal; Eka Pandu Cynthia
Bulletin of Computer Science Research Vol. 6 No. 4 (2026): June 2026
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletincsr.v6i4.1195

Abstract

Ceramic inventory management at CV. Makmur Bersama has generally relied on intuition or partial sales data, without accounting for purchasing behavior patterns as a whole. This approach simultaneously creates two major risks: overstocking of slow-moving products, which burdens working capital and storage space, and stockouts of high-demand products, which can result in lost sales opportunities. This problem is further compounded by the limitation of stock data, which typically contains only a single quantitative variable such as the number of units sold and is therefore unable to comprehensively capture product demand characteristics, such as how frequently a product is purchased or how broad its customer base is. As a result, restocking decisions and promotional strategies are often poorly targeted. This research applies the K-Means algorithm to cluster ceramic products based on historical sales patterns as a solution to this limitation. Historical sales data from CV. Makmur Bersama for the 2025 period, consisting of 6,328 transactions, was processed into 417 unique products through a feature engineering approach using Frequency, Monetary, and Reach (FMR) namely transaction count, total quantity sold, and unique customer count per product. After outlier detection using the Interquartile Range (IQR) method, 381 products remained for the clustering process. The optimal number of clusters was determined using the Elbow Method, resulting in k=4 as the best cluster count. Evaluation using the Davies-Bouldin Index (DBI) produced a value of 0.8954, categorized as good, and stability testing across five iterations with different random states showed consistent results (DBI standard deviation of 0.0034). The clustering results produced Cluster 1 (190 products, 49.9%) as slow-moving products, Cluster 2 (34 products, 8.9%) as top-performing products with an average transaction frequency of 30.8 times, Cluster 3 (93 products, 24.4%) as potential products, and Cluster 4 (64 products, 16.8%) as products with limited demand. This research provides practical contributions for companies in determining restocking priorities, promotional strategies, and working capital efficiency based on actual sales patterns. This research contributes methodologically through the adaptation of the RFM framework into FMR to better suit real-world data constraints, as well as the integration of the Elbow Method, Davies-Bouldin Index, and stability testing as a comprehensive validation mechanism. Practically, the segmentation results can be directly utilized by the company as a basis for restocking priorities, promotional strategies, and working capital allocation efficiency based on actual sales patterns.
Perbandingan Kinerja Random forest dan SVM Pada Klasifikasi Tingkat Kekumuhan Permukiman Menggunakan SMOTE Nurika Dwi Wahyuni; Fadhilah Syafria; Novi Yanti; Surya Agustian
Building of Informatics, Technology and Science (BITS) Vol 8 No 1 (2026): June 2026
Publisher : Forum Kerjasama Pendidikan Tinggi

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

Abstract

Classifying slum levels is essential for a structured, data-driven analysis of settlement conditions. This study compares the performance of Random forest and Support vector machine (SVM) in classifying slum levels in Pekanbaru City across two scenarios with and without SMOTE using slum indicator scoring data. Its contributions include analyzing SMOTE's impact on model performance and evaluating the top 10 features against the full feature set. The dataset comprises 992 RT-level records from Disperkim Pekanbaru City (2020, 2021, and 2023) featuring 16 slum indicator scores based on PUPR Ministerial Regulation No. 14/2018, categorized into three classes: Non-Slum, Low Slum, and Moderate Slum. Following the KDD process (selection, preprocessing, transformation, data mining, evaluation, and analysis), the data was split 80:20 using stratified sampling and evaluated based on accuracy, precision, recall, F1-score, and confusion matrix. Results show that the Linear SVM without SMOTE achieved perfect evaluation metrics (1.0000); however, this is interpreted cautiously as the class labels derive from strict regulatory scoring rules, making class boundaries inherently linear. Random forest saw its F1-score rise from 0.9660 to 0.9700 after SMOTE, while the most significant improvement occurred in SVM RBF, jumping from 0.9214 to 0.9779. Testing the top 10 features led to a decreased F1-score across models, indicating that utilizing all 16 features remains optimal for this dataset.
IMPLEMENTASI K-MEANS CLUSTERING PADA DATA PENGELOMPOKAN PENDAFTARAN MAHASISWA BARU (STUDI KASUS UNIVERSITAS ABDURRAB Muhammad Hanif Abdurrohman; Elin Haerani; Fadhilah Syafria; Lola Oktavia
Rabit : Jurnal Teknologi dan Sistem Informasi Univrab Vol 9 No 1 (2024): Januari
Publisher : LPPM Universitas Abdurrab

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36341/rabit.v9i1.4255

Abstract

Facing the complex dynamics of freshman enrollment, the k-means clustering method was introduced as the main approach. The focus is on Abdurrab University, where various attributes of prospective students are investigated, including gender, parental education, parental income, hometown, province, age, and choice of study program. With the k-means clustering algorithm, the purpose of the study is to uncover the underlying patterns of preferences and characteristics of new student groups. The results of this study provide in-depth insight into the factors that influence the decision to admit new students in the campus environment of Abdurrab University. In this study Davies-Bouldin Index (DBI) was used as a method to determine the optimal number of clusters, the lowest DBI value was 1.5 which occurred in 8 clusters. This shows that 8 clusters is the optimal number of clusters for data that has been transformed and is ready for k-means clustering. After carrying out the clustering process with the K-Means method which involves the formation of 8 clusters, to show patterns and insights from the clustering results, there are two ways used in this study, first make a heatmap of the correlation of features displayed, information can be obtained about the relationship between variables. The correlation value ranges from -0.4 to 1.0 where positive values indicate a positive correlation and negative values indicate a negative correlation. A positive correlation means that if the value of one variable increases, then the value of the other variable also tends to increase. Conversely, negative correlation means that if the value of one variable increases, then the value of the other variable tends to decrease.
Klasifikasi Kondisi Janin Menggunakan Algoritma K-Nearest Neighbors dan Teknik SMOTE Berdasarkan Data Kardiotogram Dede Fadillah; Elin Haerani; Fitri Wulandari; Fadhilah Syafria
Bulletin of Computer Science Research Vol. 5 No. 4 (2025): June 2025
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletincsr.v5i4.585

Abstract

Fetal health is a crucial aspect in reducing infant mortality rates, where cardiotocography (CTG) is used to monitor fetal condition through recordings of fetal heart rate and uterine contractions. However, manual interpretation of CTG data still faces challenges, particularly due to imbalanced class distribution. This study aims to develop a classification model for fetal conditions using the K-Nearest Neighbors (K-NN) algorithm combined with the Synthetic Minority Over-sampling Technique (SMOTE). The dataset used, sourced from Kaggle, consists of 2,126 CTG examinations categorized into three classes: Normal, Suspect, and Pathological. The data processing follows the Knowledge Discovery in Databases (KDD) process, including data selection, cleaning, normalization, splitting, balancing with SMOTE, and classification using K-NN. The model was evaluated using four training-testing split ratios (70:30, 80:20, 85:15, and 90:10) with accuracy and macro F1-score as metrics. The results indicate that the 85:15 split ratio achieved the highest accuracy of 89.7%, while the 90:10 ratio yielded the highest macro F1-score of 0.83. These findings suggest that the 85:15 ratio offers an optimal balance between model training and evaluation, whereas the highest F1-score at 90:10 reflects greater model sensitivity to minority classes. The combination of K-NN and SMOTE proved effective in addressing data imbalance and supports model stability in the overall classification process of fetal conditions.
Co-Authors Abdul Aziz Abdullah, Said Noor Abdussalam Al Masykur Adrian Maulana Adzhima, Fauzan Agung Syaiful Rahman Agus Buono Agustina, Auliyah Ahmad Paisal Aji Pangestu Adek Akbar, Lionita Asa Alfin Hernandes Alwaliyanto Alwaliyanto Alwis Nazir Alwis Nazir Alwis Nazir Alwis Nazir Alwis Nazir Alwis Nazir Amalia Hanifah Artya Aminuyati Andre Suarisman Aprima, Muhammad Dzaky Ariq At-Thariq Putra Baehaqi Bib Paruhum Silalahi Boni Iqbal Che Hussin, Ab Razak Darmila Dede Fadillah Deny Ardianto Devi Julisca Sari Dina Septiawati Dodi Efendi Eka Pandu Cynthia Eka Pandu Cynthia Elin Haerani Elin Haerani Elin Haerani Elin Haerani Elin Haerani Elin Haerani Elin Haerani Elin Hearani Ellin Haerani Elvia Budianita Fakhri Fakhri Faska, Ridho Mahardika Fatma Hayati Fauzan Adzim Febi Nur Salisah Febi Yanto Felian Nabila Ferdian Arya Dinata Fitra Lestari Fitri Insani Fitri Insani Fitri Wulandari Fitri Wulandari Fratiwi Rahayu Gusrifaris Yuda Alhafis Gusti, Siska Kurnia Guswanti, Widya Habibi Al Rasyid Harpizon Habibi Putra Indrizal Hafez Almirza Hafsyah Hara Novina Putri Harni, Yulia Hertati Ibnu Afdhal Ihda Syurfi Iis Afrianty Iis Afrianty Ikhsan, Tomi Ikhsanul Hamdi Inggih Permana Irfan Jamal Matondang Irma Sanela Ismail Marzuki Ismail Marzuki Ismar Puadi Isnan Mellian Ramadhan Israldi, Tino Iwan Iskandar Iwan Iskandar Iwan Iskandar Iwan Iskandar Iwan Iskandar Jasril Jasril Jasril Jasril Jauhari, Najwa Karina Julita Lestari Handayani Lestari Handayani Lili Rahmawati Liza Afriyanti Lola Oktavia Lola Oktavia Oktavia M Fikry M. Afif Rizky A. Ma'rifah, Laila Alfi Masaugi, Fathan Fanrita Maulana Junihardi Mawadda Warohma Mazdavilaya, T Kaisyarendika Mhd. Kadarman Mori Hovipah Mori Hovipah Morina Lisa Pura Muhammad Affandes Muhammad Alvin Muhammad Badri Muhammad Fahri Muhammad Farid Audi Rahman Simatupang Muhammad Fikry Muhammad Fikry Muhammad Fikry Muhammad Hanif Abdurrohman Muhammad Ichsanul Bukhari Muhammad Irsyad Muhammad Syafriandi, Muhammad Muhammad Taufiq Muhammad Yusril Haffandi Muhammad Yusuf Fadhillah Mulyono, Makmur Muslimin, Al’hadiid Nabyl Alfahrez Ramadhan Amril Nada Tsawaabul Khair Nailatul Fadhilah Nazir, Alwis Nazruddin Safaat H Negara, Benny Sukma Neni Sari Putri Juana Nesdi Evrilyan Rozanda Nining Nur Habibah Novi Yanti Novriyanto Novriyanto Nurainun Nurainun Nurika Dwi Wahyuni Okfalisa Okfalisa Okfalisa Okfalisa Permata, Rizkiya Indah Pizaini Pizaini Puspa Melani Almahmuda Putra, Fiqhri Mulianda Putri Mardatillah Putri, Widya Maulida R. Rahmadhani Rahmad Abdillah Rahmad Abdillah Rahmad Kurniawan Raja Sultan Firsky Ramadhan, Aweldri Ramadhan, Muhammad Ilham Ramadhani Herfin Ramadhani, Siti Reski Mai Candra Reski Mai Candra Reski Mai Candra Reski Mei Candra Restu Kharrisa Andini Riska Yuliana Roni Salambue Said Nanda Saputra Salmiyati Salmiyati Satria Bumartaduri Silfia Silfia Siti Ramadhani Siti Ramadhani Siti Sri Rahayu Surya Agustian Suswantia Andriani Suwanto Sanjaya Syaputra, Muhammad Dwiky Teddie Darmizal Teddie Darmizal Ummy Agustina Putri Wulandari, Fitri Yaskur Bearly Fernandes Yelvi Vitriani Yusra Yusra Yusra, Yusra Yusril Hidayat Zabihullah, Fayat Zulastri, Zulastri