Article Per Year (5 Year)
p-Index From 2021 - 2026
4.72
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering Techno.Com: Jurnal Teknologi Informasi Jurnal Ilmiah Teknik Elektro Komputer dan Informatika (JITEKI) Prosiding SNATIF Jurnal Edukasi dan Penelitian Informatika (JEPIN) International Journal of Advances in Intelligent Informatics Scientific Journal of Informatics Journal of Information Systems Engineering and Business Intelligence JAIS (Journal of Applied Intelligent System) Register: Jurnal Ilmiah Teknologi Sistem Informasi Jurnal Teknologi dan Sistem Komputer Jurnal ELTIKOM : Jurnal Teknik Elektro, Teknologi Informasi dan Komputer Kinetik: Game Technology, Information System, Computer Network, Computing, Electronics, and Control Prosiding SAKTI (Seminar Ilmu Komputer dan Teknologi Informasi) JISKa (Jurnal Informatika Sunan Kalijaga) APTIKOM Journal on Computer Science and Information Technologies (CSIT) Innovation in Research of Informatics (INNOVATICS) Journal of Soft Computing Exploration Unnes Journal of Mathematics Journal of Student Research Exploration Journal of Information System Exploration and Research Nusantara Journal of Computers and its Applications Jurnal Informatika: Jurnal Pengembangan IT Scientific Journal of Informatics
Much Aziz Muslim
Unknown Affiliation
Aerospace Engineering Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Education Electrical & Electronics Engineering Energy Engineering Library & Information Science Materials Science & Nanotechnology Mathematics Other

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

Found 85 Documents
Search

 5   6   7   8   9 
Mix histogram and gray level co-occurrence matrix to improve glaucoma prediction machine learning Jumanto, Jumanto; Nugraha, Faizal Widya; Harjoko, Agus; Muslim, Much Aziz; Alabid, Noralhuda N.
Journal of Soft Computing Exploration Vol. 4 No. 1 (2023): March 2023
Publisher : SHM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52465/joscex.v4i1.99

Abstract

Glaucoma is an eye disease that is the second leading cause of blindness. Examination of glaucoma by an ophthalmologist is usually done by observing the retinal image directly. Observations from one doctor to another may differ, depending on their educational background, experience, and psychological condition. Therefore, a glaucoma detection system based on digital image processing is needed. The detection or classification of glaucoma with digital image processing is strongly influenced by the feature extraction method, feature selection, and the type of features used. Many researchers have carried out various kinds of feature extraction for glaucoma detection systems whose accuracy needs to be improved. In general, there are two groups of features, namely morphological features and non-morphological features (image-based features). In this study, it is proposed to detect glaucoma using texture features, namely the GLCM feature extraction method, histograms, and the combined GLCM-histogram extraction method. The GLCM method uses 5 features and the Histogram uses 6 features. To distinguish between glaucoma and non-glaucoma eyes, the multi-layer perceptron (MLP) artificial neural network model serves as a classifier. The data used in this study consisted of 136 fundus images (66 normal images and 70 images affected by glaucoma). The performance obtained with this approach is an accuracy of 93.4%, a sensitivity of 86.6%, and a specificity of 100%.
Optimization of support vector machine using information gain and adaboost to improve accuracy of chronic kidney disease diagnosis Listiana, Eka; Muzayanah, Rini; Muslim, Much Aziz; Sugiharti, Endang
Journal of Soft Computing Exploration Vol. 4 No. 3 (2023): September 2023
Publisher : SHM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52465/joscex.v4i3.218

Abstract

Today's database is growing very rapidly, especially in the field of health. The data if not processed properly then it will be a pile of data that is not useful, so the need for data mining process to process the data. One method of data mining used to predict a decision in any case is classification, where in the classification method there is a support vector machine algorithm that can be used to diagnose chronic kidney disease. The purpose of this study is to determine the level of accuracy of the application of information gain and AdaBoost on the support vector machine algorithm in diagnosing chronic kidney disease. The use of information gain is to select the attributes that are not relevant while AdaBoost is used as an ensemble method commonly known as the method of classifier combination. In this study the data used are chronic kidney disease (CKD) dataset obtained from UCI repository of machine learning. The result of experiment using MATLAB applying information gain and AdaBoost on vector machine support algorithm with k-fold cross validation default k = 10 shows an accuracy increase of 0.50% with the exposure of the result as follows, the support vector machine algorithm has accuracy of 99.25 %, if by applying AdaBoost on the support vector machine has an accuracy of 99.50%, whereas if applying AdaBoost and information gain on the support vector machine has an accuracy of 99.75%.
Comparison of the suitability of the otsu method thresholding and multilevel thresholding for flower image segmentation Hadiq, Hadiq; Solehatin, Solehatin; Djuniharto, Djuniharto; Muslim, Much Aziz; Salahudin, Shahrul Nizam
Journal of Soft Computing Exploration Vol. 4 No. 4 (2023): December 2023
Publisher : SHM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52465/joscex.v4i4.266

Abstract

The digital representation of flowers, characterized by their vivid chromatic attributes, establishes them as viable candidates for deployment as input imagery within the object recognition paradigm. Within the context of object recognition, the imperative of a proficient image segmentation process is underscored, serving to effectively discern the object from its background and, consequently, optimizing the efficacy of the object recognition process. This research unfolds through a methodologically structured tripartite framework, encompassing the initial stage involving input imagery, the subsequent intermediate phase dedicated to image segmentation, and a conclusive stage centered on the quantitative evaluation of methodological outcomes. The second stage, focusing on image segmentation, employs the Otsu thresholding and multilevel thresholding methods. The subsequent third stage involves a thorough assessment of segmentation outcomes through the application of quantitative metrics, including Peak signal-to-oise ratio (PSNR) and Root Mean Square Error (RMSE). Empirical investigations, incorporating a diverse array of floral input images, reveal a conspicuous inclination towards a specific segmentation methodology. Specifically, the Otsu Thresholding method emerges as the more judicious choice relative to multilevel Thresholding, demonstrating superior performance with a diminished RMSE value and an augmented PSNR value, substantiated by an average RMSE value. This research is propelled by the overarching objective of discerning the most optimal method for the segmentation of flower images, particularly in the face of diverse input images. Its significant contribution lies in providing nuanced insights into the discerning selection of segmentation methodologies, attuned to the variability inherent in diverse forms of input imagery, thereby culminating in optimized outcomes within the domain of flower image recognition. Where did these results come from? please show it in the sub-discussion.
Measuring the usability effectiveness of using card menus and tree menus in school web applications Hadiq, Hadiq; Solehatin, Solehatin; Djuniharto, Djuniharto; Muslim, Much Aziz
Journal of Soft Computing Exploration Vol. 5 No. 1 (2024): March 2024
Publisher : SHM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52465/joscex.v5i1.299

Abstract

The aim of this research is to measure the usability effectiveness of a web application by using card menus and tree menus using user-friendly criteria and access speed as indicated by the number of clicks made by the user. The method used in this research is the Task-centered User Interface method, where this method allows for planning and evaluating the arrangement of the interface according to user needs. There are four stages in this method, including user identification by conducting needs analysis, the second phase is user interface design. The third phase is the implementation of the card menu and tree menu design, and the fourth face is testing the usability and effectiveness requirements. From the research that has been carried out regarding measuring the effectiveness of using card menus, it is more effective to use than tree menus because you can directly lift the menu and access it. Meanwhile, for usability, the card menus have a higher usability index than the tree menus. Meanwhile, for usability measurements carried out by direct observation and distributing questionnaires, the resulting percentage of user understanding, ease, and speed for the card menu display was 87% and for the tree menu was 60% so that the card menu display was more accepted by users than the tree menu. The new thing provided by the results of this research is in the form of suggestions that can be used by web application developers to use the right type of menu in building web-based applications with the same specifications as in the case of school finance applications.
Using genetic algorithm feature selection to optimize XGBoost performance in Australian credit Pertiwi, Dwika Ananda Agustina; Ahmad, Kamilah; Salahudin, Shahrul Nizam; Annegrat, Ahmed Mohamed; Muslim, Much Aziz
Journal of Soft Computing Exploration Vol. 5 No. 1 (2024): March 2024
Publisher : SHM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52465/joscex.v5i1.302

Abstract

To reduce credit risk in credit institutions, credit risk management practices need to be implemented so that lending institutions can survive in the long term. Data mining is one of the techniques used for credit risk management. Where data mining can find information patterns from big data using classification techniques with the resulting level of accuracy. This research aims to increase the accuracy of classification algorithms in predicting credit risk by applying genetic algorithms as the best feature selection method. Thus, the most important feature will be used to search for credit risk information. This research applies a classification method using the XGBoost classifier on the Australian credit dataset, then carries out an evaluation by measuring the level of accuracy and AUC. The results show an increase in accuracy of 2.24%, with an accuracy value of 89.93% after optimization using a genetic algorithm. So, through research on genetic algorithm feature selection, we can improve the accuracy performance of the XGBoost algorithm on the Australian credit dataset.
A new CNN model integrated in onion and garlic sorting robot to improve classification accuracy Lestari, Apri Dwi; Khan, Atta Ullah; Pertiwi, Dwika Ananda Agustina; Muslim, Much Aziz
Journal of Soft Computing Exploration Vol. 5 No. 1 (2024): March 2024
Publisher : SHM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52465/joscex.v5i1.304

Abstract

The profit share of the vegetable market, which is quite large in the agricultural industry, needs to be equipped with the ability to classify types of vegetables quickly and accurately. Some vegetables have a similar shape, such as onions and garlic, which can lead to misidentification of these types of vegetables. Through the use of computer vision and machine learning, vegetables, especially onions, can be classified based on the characteristics of shape, size, and color. In classifying shallot and garlic images, the CNN model was developed using 4 convolutional layers, with each layer having a kernel matrix of 2x2 and a total of 914,242 train parameters. The activation function on the convolutional layer uses ReLu and the activation function on the output layer is softmax. Model accuracy on training data is 0.9833 with a loss value of 0.762.
Comparison of gridsearchcv and bayesian hyperparameter optimization in random forest algorithm for diabetes prediction Muzayanah, Rini; Pertiwi, Dwika Ananda Agustina; Ali, Muazam; Muslim, Much Aziz
Journal of Soft Computing Exploration Vol. 5 No. 1 (2024): March 2024
Publisher : SHM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52465/joscex.v5i1.308

Abstract

Diabetes Mellitus (DM) is a chronic disease whose complications have a significant impact on patients and the wider community. In its early stages, diabetes mellitus usually does not cause significant symptoms, but if it is detected too late and not handled properly, it can cause serious health problems. To overcome these problems, diabetes detection is one of the solutions used. In this research, diabetes detection was carried out using Random Forest with gridsearchcv and bayesian hyperparameter optimization. The research was carried out through the stages of study literature, model development using Kaggle Notebook, model testing, and results analysis. This study aims to compare GridSearchCV and Bayesian hyperparameter optimizations, then analyze the advantages and disadvantages of each optimization when applied to diabetes prediction using the Random Forest algorithm. From the research conducted, it was found that GridSearchCV and Bayesian hyperparameter optimization have their own advantages and disadvantages. The GridSearchCV hyperparameter excels in terms of accuracy of 0.74, although it takes longer for 338,416 seconds. On the other hand, Bayesian hyperparameter optimization has a lower accuracy rate than GridSearchCV optimization with a difference of 0.01, which is 0.73 and takes less time than GridSearchCV for 177,085 seconds.
Optimizing the implementation of the BFS and DFS algorithms using the web crawler method on the kumparan site Mustaqim, Amirul; Dinova, Dony Benaya; Fadhilah, Muhammad Syafiq; Seivany, Ravenia; Prasetiyo, Budi; Muslim, Much Aziz
Journal of Soft Computing Exploration Vol. 5 No. 2 (2024): June 2024
Publisher : SHM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52465/joscex.v5i2.309

Abstract

Efficient access to timely information is critical in today's digital era. Web crawlers, automated programs that navigate the Internet, play an important role in collecting data from websites such as Kumparan, a leading news site in Indonesia. This research shows the effectiveness of the Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms in indexing Kumparan content. The results of the research show that BFS consistently indexes more files comprehensively but with longer execution times compared to DFS, which provides faster initial results but with fewer files. For example, at depth 4 BFS indexed 949 files in 886.94 seconds, while DFS indexed 470 files in 233.02 seconds. These findings highlight the balance between precision and speed when selecting a crawling algorithm tailored to the needs of a particular website. This research provides insights into optimizing web crawler technology for complex websites such as Coil and suggests avenues for further research to improve permission efficiency and adaptability across a variety of crawling scenarios.
Predicting Olympic Medal Trends for Southeast Asian Countries Using the Facebook Prophet Model Qohar, Bagus Al; Tanga , Yulizchia Malica Pinkan; Utami, Putri; Ningsih, Maylinna Rahayu; Muslim, Much Aziz
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.16-32

Abstract

The Olympics are a world-class sporting event held every four years, serving as a meeting place for all athletes worldwide. The Olympics are held alternately in different countries. The Olympics were first held in Athens in 1896 and have now reached the 33rd Olympics, which will be held in Paris in 2024. Significant work has been conducted to develop prediction models, with a primary focus on enhancing the accuracy of predicting Olympic outcomes. However, low-performance regression algorithms are the main problem with prediction. By integrating custom seasonality with the Facebook Prophet prediction model, this study aims to enhance the accuracy of Olympic predictions. The proposed new model involves several steps, including preparing the data and initializing and fitting the Facebook-Prophet model with several parameters such as seasonal mode, annual seasonality, and prior scale. The model is tested using the Olympic dataset (1994–2024). The evaluation results indicate that this prediction model provides a reliable estimate of the total medals earned. On the Olympic Games (1994-2024) dataset, the model exhibits a very low error, as indicated by its MAE, MSE, and RMSE, and achieves an R² score of 0.99, which is close to perfect. This research shows that the model is effective in improving prediction accuracy.
Soft voting ensemble model to improve Parkinson’s disease prediction with SMOTE Unjung, Jumanto; Rofik, Rofik; Sugiharti, Endang; Alamsyah, Alamsyah; Arifudin, Riza; Prasetiyo, Budi; Muslim, Much Aziz
International Journal of Advances in Intelligent Informatics Vol 11, No 1 (2025): February 2025
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v11i1.1627

Abstract

Parkinson's disease is one of the major neurodegenerative diseases that affect the central nervous system, often leading to motor and cognitive impairments in affected individuals. A precise diagnosis is currently unreliable, plus there are no specific tests such as electroencephalography or blood tests to diagnose the disease. Several studies have focused on the voice-based classification of Parkinson's disease. These studies attempt to enhance the accuracy of classification models. However, a major issue in predictive analysis is the imbalance in data distribution and the low performance of classification algorithms. This research aims to improve the accuracy of speech-based Parkinson's disease prediction by addressing class imbalance in the data and building an appropriate model. The proposed new model is to perform class balancing using SMOTE and build an ensemble voting model. The research process is systematically structured into multiple phases: data preprocessing, sampling, model development utilizing a voting ensemble approach, and performance evaluation. The model was tested using voice recording data from 31 people, where the data was taken from OpenML. The evaluation results were carried out using stratified cross-validation and showed good model performance. From the measurements taken, this study obtained an accuracy of 97.44%, with a precision of 97.95%, recall of 97.44%, and F1-Score of 97.56%. This study demonstrates that implementing the soft-voting ensemble-SMOTE method can enhance the model's predictive accuracy.
Co-Authors Afifah Ratna Safitri Agus Harjoko Ahmad, Kamilah Alabid, Noralhuda N. Alamsyah - Aldi Nurzahputra Aldi Nurzahputra, Aldi Alfatah, Abdul Muis Alfatah, Abdul Muis Ali, Muazam Amanah Febrian Indriani Aminuyati Anggyi Trisnawan Putra Annegrat, Ahmed Mohamed Astuti, Winda Try Astuti, Winda Try Atikah Ari Pramesti, Atikah Ari Budi Prasetiyo Budi Prasetiyo, Budi Darmawan, Aditya Yoga Dewi Handayani Untari Ningsih Dinova, Dony Benaya Djuniharto Djun Doni Aprilianto Dullah, Ahmad Ubai Eka Listiana Endang Sugiharti, Endang Fadhilah, Muhammad Syafiq Fadli Dony Pradana Falasari, Anisa Farih, Habib al Florentina Yuni Arini, Florentina Yuni Hadiq, Hadiq Hakim, M. Faris Al Hendi Susanto Imam Ahmad Ashari, Imam Ahmad Irfan, Mohammad Syarif Jeffry Nur Rifa’i Jumanto , Jumanto Jumanto Jumanto, Jumanto Jumanto Unjung Khan, Atta Ullah Larasati, Ukhti Ikhsani Larasati, Ukhti Ikhsani Lestari, Apri Dwi Listiana, Eka Listiana, Eka Lodana, Mae Maulana, Muhamad Irvan Miranita Khusniati moh minhajul mubarok Muhamad Anbiya Nur Islam Mustaqim, Amirul Muzayanah, Rini N. Nelis Febriani SM Nikmah, Tiara Lailatul Nina Fitriani, Nina Ningsih, Maylinna Rahayu Nugraha, Faizal Widya Nuk Ghurroh Setyoningrum Nur Astri Retno, Nur Astri Nurdin, Alya Aulia Nurriski, Yopi Julia Perbawawati, Anna Adi Perbawawati, Anna Adi Pertiwi, Dwika Ananda Agustina Priliani, Erlin Mega Priliani, Erlin Mega Purnawan, Dedy Putri Utami, Putri Putri, Salma Aprilia Huda Putriaji Hendikawati Putro, Ari Nugroho Qohar, Bagus Al Raharjo, Bagus Purbo Rahman, Raihan Muhammad Rizki Rahmanda, Primana Oky Rahmanda, Primana Oky Riza Arifudin Rofik Rofik, Rofik Roni Kurniawan Rukmana, Siti Hardiyanti Ryo Pambudi S.Pd. M Kes I Ketut Sudiana . Safri, Yofi Firdan Safri, Yofi Firdan Saiful Arifin Salahudin, Shahrul Nizam Sanjani, Fathimah Az Zahra Seivany, Ravenia Simanjuntak, Robert Panca R. Solehatin, Solehatin Sugiman Sugiman Sulistiana Syarifah, Aulia Tanga , Yulizchia Malica Pinkan Tanga, Yulizchia Malica Pinkan Tanzilal Mustaqim Trihanto, Wandha Budhi Trihanto, Wandha Budhi Triyana Fadila Varindya Ditta Iswari Vedayoko, Lucky Gagah Vedayoko, Lucky Gagah Wargo, Franki Setyo Wibowo, Ceorido Ghalib Wibowo, Kevyn Alifian Hernanda Yosza Dasril Yosza Dasril