Claim Missing Document
Check
Articles

Found 22 Documents
Search
Journal : Jurnal Mandiri IT

Application of the Dijkstra method in finding the shortest route for hospitals in Kabupaten Tegal Gunawan Gunawan; Wresti Andriani; Khadziqul Humam Munfi
Jurnal Mandiri IT Vol. 12 No. 2 (2023): October: Computer Science and Field.
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v12i2.238

Abstract

Health services are one of the most critical aspects of human life. Getting medical care quickly and efficiently can be a determining factor in saving a person's life in an emergency. In this article, we will review the application of the Dijkstra Method in finding the shortest route to Mitra Siaga hospitals in Kabupaten Tegal. This article is expected to contribute to understanding and developing a more efficient transportation system in Kabupaten Tegal, focusing on health services. Dijkstra algorithm for determining the shortest route. Dijkstra's algorithm is an algorithm that intends to find the shortest path on a graph. The principle of the Dijkstra Algorithm is searching for two passes with the most negligible weight. Based on the results of testing 10 times, the accuracy of this application is 100%. In this study, limited to the initial location tested, this application has not used the current location at its initial location. For the development of this application, you can use the current location at the initial location so that this application runs optimally
Application of the Dijkstra method in finding the shortest route for hospitals in Kabupaten Tegal Gunawan Gunawan; Wresti Andriani; Khadziqul Humam Munfi
Jurnal Mandiri IT Vol. 12 No. 2 (2023): October: Computer Science and Field.
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v12i2.238

Abstract

Health services are one of the most critical aspects of human life. Getting medical care quickly and efficiently can be a determining factor in saving a person's life in an emergency. In this article, we will review the application of the Dijkstra Method in finding the shortest route to Mitra Siaga hospitals in Kabupaten Tegal. This article is expected to contribute to understanding and developing a more efficient transportation system in Kabupaten Tegal, focusing on health services. Dijkstra algorithm for determining the shortest route. Dijkstra's algorithm is an algorithm that intends to find the shortest path on a graph. The principle of the Dijkstra Algorithm is searching for two passes with the most negligible weight. Based on the results of testing 10 times, the accuracy of this application is 100%. In this study, limited to the initial location tested, this application has not used the current location at its initial location. For the development of this application, you can use the current location at the initial location so that this application runs optimally
Application of association rule for prediction of menu ordered at café minapadi Zain Hidayatullah, Fikri; Surorejo, Sarif; Andriani, Wresty; Gunawan, Gunawan
Jurnal Mandiri IT Vol. 12 No. 4 (2024): April: Computer Science and Field.
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v12i4.279

Abstract

This research aims to develop a predictive model that helps prepare menus based on customer preferences at Café Minapadi, hoping to improve operational efficiency and customer satisfaction. Using rule-association data mining techniques, the study uncovered hidden patterns in extensive transaction data, applying a priori algorithms in datasets to explore menu ordering frequencies and trends. Data analysis includes cleansing, transforming, and selecting features to generate relevant insights. The results found that items such as coffee and chocolate cake were often purchased together, providing an opportunity for menu optimization and special promotions. Evaluation of predictive models shows the possibility of increased accuracy in stock preparation and adjustment of menu offerings, providing significant benefits in business decision-making in the culinary sector.
Application of expert system using certainty factor method to identify diseases in rice plants Azmi, Isni; Gunawan, Gunawan; Anandianskha, Sawaviyya
Jurnal Mandiri IT Vol. 12 No. 4 (2024): April: Computer Science and Field.
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v12i4.280

Abstract

This article explores the application of expert systems using certainty factor methods for disease identification in rice crops, highlighting the importance of information technology integration in agriculture. The study aims to develop a system that allows quick and accurate identification of rice disease, using certainty factor methods that are effective in dealing with data uncertainty. This study used a quantitative approach with a quasi-experimental design. The results indicate an effective system for identifying diseases, with significant implications for supporting farmers and improving food security. Suggestions for future research include system integration with mobile applications and real-time data analysis to improve system accessibility and applicability in modern agricultural practices.
Application of apriori algorithm to find relationships between courses based on student grades STMIK YMI Tegal Hassan, Muhamad Nur; Gunawan, Gunawan; Arif, Zaenul
Jurnal Mandiri IT Vol. 12 No. 4 (2024): April: Computer Science and Field.
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v12i4.281

Abstract

This research explores the application of the Apriori algorithm to investigate the relationship between courses based on student grades at STMIK YMI Tegal. This research focuses on analyzing the relationship between courses to support curriculum development that is responsive and relevant to industry needs and improves the quality of learning. The main objective of this research is to identify and understand relationship patterns between various courses based on student analysis scores using the Apriori algorithm, an effective data mining methodology for uncovering association rules between items in large datasets. By using a quantitative approach and quasi-experimental design, this research succeeded in analyzing grade data from various semesters, identifying combinations of courses that often appear together with high grades, indicating a positive correlation between related courses. The results of the analysis reveal that several basic courses play a significant role in forming a strong foundation for advanced courses, highlighting the importance of a capable curriculum structure. Although the lift scores show a neutral relationship, these findings provide important initial insights for further understanding of interactions between courses. The implication for curriculum development is the need to emphasize the integration of courses that have positive relationships to support a coherent learning process and increase student success.
Application of dijkstra algorithm to optimize waste transportation distribution routes in Tegal Regency Santoso, Bayu Aji; Surur, Misbahu; Syefudin, Syefudin; Gunawan, Gunawan
Jurnal Mandiri IT Vol. 13 No. 1 (2024): July: Computer Science and Field
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v13i1.290

Abstract

Efficient waste management is essential for sustainable urban development, especially in densely populated areas such as Tegal Regency. The study addresses inefficiencies in current waste hauling routes that contribute to increased operational costs and environmental impacts due to long transit times and increased emissions. By applying the Dijkstra Algorithm, this study aims to optimize waste transportation routes to reduce these inefficiencies. This approach involves collecting primary and secondary data on the waste management system in Tegal, which is then analyzed using the dijkstra algorithm to determine the most efficient transport route. The findings show that route optimization can significantly reduce operational costs and carbon emissions, contributing to more sustainable waste management practices in the Tegal District. This study not only improves theoretical understanding of route optimization but also provides practical solutions to real problems in waste management systems.
Application of the haversine formula method to determine the closest distance to a minimarket Muttaqin, Anik; Murtopo, Aang Alim; Syefudin, Syefudin; Gunawan, Gunawan
Jurnal Mandiri IT Vol. 13 No. 1 (2024): July: Computer Science and Field
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v13i1.293

Abstract

In a digital era that demands speed and efficiency, determining the closest distance to minimarkets is crucial for consumers and the logistics industry. This study proposes the use of the haversine method to improve the accuracy of distance calculations. Through quantitative and quasiexperimental approaches, this study describes the steps of data collection, pre-processing, and application of haversine formulas. The results demonstrate the reliability of the haversine method in estimating distances accurately, allowing users to make more informed decisions in planning trips or logistics strategies. These findings contribute to the academic literature and field practice by providing a more robust and applicable methodology for determining the closest distance. Keywords: haversine, closest distance, minimarket.
Prediction of Bank Central Asia stock prices after dividend distribution using ARIMA method Surorejo, Sarif; Sulthon, Muhammad; Anandianskha, Sawaviyya; Gunawan, Gunawan
Jurnal Mandiri IT Vol. 13 No. 1 (2024): July: Computer Science and Field
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v13i1.294

Abstract

This study explores the prediction of Bank Central Asia (BBCA) stock prices following the annual dividend distribution using the Autoregressive Integrated Moving Average (ARIMA) method. The primary goal is to provide a robust forecasting tool to aid investors and financial analysts in making informed decisions. The research employs a quantitative approach with a quasi-experimental design, analyzing weekly BBCA stock price data from January 2019 to February 2024. The findings demonstrate that the ARIMA (2, 1, 2) model provides stable and reliable predictions of BBCA stock prices, showing slight weekly variations but overall stability. Practically, these predictive models can be integrated into a web-based platform, allowing real-time stock price forecasting and broader accessibility for users. This study contributes to the financial literature by validating the ARIMA model's applicability in the Indonesian stock market and suggesting the exploration of hybrid models and external economic factors for future research.
Application of weighted aggregated sum product assessment method in determining the best flour to produce vermicelli Surorejo, Sarif; Rivaldiansyah, Rafik; Dwi Kurniawan, Rifki; Gunawan, Gunawan
Jurnal Mandiri IT Vol. 13 No. 1 (2024): July: Computer Science and Field
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v13i1.296

Abstract

This study explores the application of the Weighted Aggregated Sum Product Assessment (WASPAS) method's selection of the best wheat flour for vermicelli production, which aims to improve product quality and production efficiency. The study aimed to integrate experimental data with sophisticated decision-making models to identify the most suitable type of flour based on a comprehensive set of criteria. Using a quantitative approach, this study combines experimental methods, quantitative analysis, and model validation, using the WASPAS method to evaluate and rank various flours. The results showed significant differences among flour types, with selected flours showing superior performance across multiple parameters, including chemical composition and functional properties. The study's findings underscore the potential of advanced decision-making tools such as WASPAS in improving food production processes, demonstrating broader applicability across the food industry to optimise raw material selection.
Comparison of naïve bayes and KNN for herbal leaf classification Nugroho, Bangkit Indarmawan; Khusni, Muhammad Wazid; Ananda, Pingky Septiana; Gunawan, Gunawan
Jurnal Mandiri IT Vol. 13 No. 1 (2024): July: Computer Science and Field
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v13i1.297

Abstract

This study aims to compare the effectiveness of two classification algorithms, namely Naïve Bayes Classifier and K-Nearest Neighbor (KNN), in classifying herbal leaves. This research design uses a quantitative approach with experimental analysis and model validation. The dataset consisted of images of papaya leaves, pandanus, cat's whiskers, and betel nut taken in different lighting conditions. The methodology includes pre-processing of data by converting images into grayscale, feature extraction using Gray Level Co-occurrence Matrix (GLCM), and application of Naïve Bayes and KNN algorithms. The main results showed that KNN achieved 90.00% accuracy with precision, recall, and F1-score of 88.33% respectively, higher than Naïve Bayes which had 82.50% accuracy, 81.46% precision, 85.83% recall, and 82.27% F1-score. In conclusion, KNN is superior in the classification of herbal leaves to Naïve Bayes, although it requires a longer computational time. Further research is recommended to optimize algorithm parameters and explore the integration of deep learning techniques to improve classification accuracy and efficiency.
Co-Authors Aang Alim Murtopo Aditdya, Maulana Ahmad Zulfikri Aimar Akbar, Aminnur Aisyach Aminarti Santoso Al Fattah, Muhammad Raikhan Alan Eka Prayoga Albana, Muhammad Syifa Ali Murtopo, Aang Amalani, Mukhamad Zulfa Bakhtiar Ananda, Pingky Septiana Anandaianskha, Sawaviyya Anandianshka, Sawaviyya Anandianska, Sawaviyya Anandianskha, Sawaviyya Andriani, Wresti Andriani, Wresty Anshori, Abu Hasan Al Arianti, Tezya Sekar Arif, Zaenul Arifiyah, Nur Latifatul Arrohman, Zidni Dlia Aslam, Muhammad Nur Aziz, Taufiq Azmi, Isni Azmi, Muchamad Nauval Bangkit Indarmawan Nugroho Budiono, Wahyu Cahyo, Septian Dwi Catur Supriyanto Dari, Mayang Melan Dewi, Errika Mutiara Didiek Trisatya Dodi Setiawan Dodi Setiawan Dwi Fina Fahirah Dwi Kurniawan, Rifki Fadila, Nurul Fahirah, Dwi Fina Fanti, Azizah Permata Farkhan, Muhammad Fatkhurrohman Fatkhurrohman, Fatkhurrohman Firmansyah, Akhmad Lutfi Firmansyah, Hasbi Firmansyah, Muchamad Aries Gunawan Gunawan Hafid Subechi, Fadlan Handayani, Sri Harefa, Reyvan Sinatria Haris Fadillah Hassan, Muhamad Nur Hidayatullah, Bryan Adam Intan Mayla Faiza Intan Mayla Faiza Januarto, Sigit Khadziqul Humam Munfi Khasanah, Apriliani Maulidya Khusni, Muhammad Wazid Kurniawan, Rifki Dwi Lestari, Nindy Putri Limaknun, Lulu Lutfayza, Rezi Marzuqi, Maezun Nafis Maulana, M Taufik Fajar Miftakhuddin, Ahmad Miftakhudin, Muhammad Milkhatunisya, Milkhatunisya Moonap, Dinar Auranisa Muchamad Nauval Azmi Muh Ridwan Muhammad Sulthon Mutaqin, Ahadan Fauzan Muttaqin, Anik Naja, Naella Nabila Putri Wahyuning Ningrum, Isna Lidia Nughroho, Bangkit Indarmawan Nugroho Adhi Santoso Nugroho, Bangkit Indramawan Nur Aisyah Nur Tulus Ujianto Nurokhman, Akhmad Nursahid, Wahyu Nursidik, Maulia Nurul Fadhilah Nurul Fadilah, Nurul Prayoga, Alan Eka Priyo Haryoko Purwanto Purwanto Putra, Alif Sya’Bani Qurrotu Aini, Atikah Rafhina, Ana Ramadhan, Ilham Gema Rifki Dwi Kurniawan Rivaldiansyah, Rafik Riyadi, Fajar Sugeng Santoso, Aisyach Aminarti Santoso, Bayu Aji Santoso, Nughroho Adhi Santoso, Nugroho Adh Santoso, Nugroho Adhi Santoso, Nugroho Adi Saputra, Aryan Dandi Sarif Surorejo Sawaviyya Anandianskha Sawaviyya Anandianskha Sawaviyya Anandianskha Sawavyya Anandianskha Septian Ari Wibowo Septiana Ananda, Pingky Septiana, Pingky Setiawati, Windi Surur, Misbahu Sya’bani, Adhita Zulfa Syefudin, Syefudin Triwinanto, Mohammad Amin Triwinanto Ubaidillah, Muhamad Rizal Ujianto, Nur Tulus W.N, Naella Nabila Putri Wahyu Pratama, Raka Wahyuning Naja, Naella Nabila Putri Wilda Shabrina Wresti Andriani Wresti Andriani Wresti Andriani Yan Kurniawan Yan Kurniawan, Yan Yulison Herry Chrisnanto Zaenul Arif Zain Hidayatullah, Fikri Zain, Ahmad Muzakky