Pub Date : 2024-04-21DOI: 10.57152/predatecs.v2i1.1119
Windy Junita Sari, Nasya Amirah Melyani, Fadlan Arrazak, Muhammad Asyraf Bin Anahar, Ezza Addini, Zaid Husham Al-Sawaff, Selvakumar Manickam
Stroke is the second most common cause of death globally, making up about 11% of all deaths from health-related deaths each year, the condition varies from mild to severe, with the potential for permanent or temporary damage, caused by non-traumatic cerebral circulatory disorders. This research began with data understanding through the acquisition of a stroke patient health dataset from Kaggle, consisting of 5110 records. The pre-processing stage involved transforming the data to optimize processing, converting numeric attributes to nominal, and preparing training and test data. The focus then shifted to stroke disease classification using Random Forest, Support Vector Machines, and Neural Networks algorithms. Data processing results from the Kaggle dataset showed high performance, with Random Forest achieving 98.58% accuracy, SVM 94.11%, and Neural Network 95.72%. Although SVM has the highest recall (99.41%), while Random Forest and ANN have high but slightly lower recall rates, 98.58% and 95.72% respectively. Model selection depends on the needs of the application, either focusing on precision, recall, or a balance of both. This research contributes to further understanding of stroke diagnosis and introduces new potential for classifying the disease.
{"title":"Performance Comparison of Random Forest, Support Vector Machine and Neural Network in Health Classification of Stroke Patients","authors":"Windy Junita Sari, Nasya Amirah Melyani, Fadlan Arrazak, Muhammad Asyraf Bin Anahar, Ezza Addini, Zaid Husham Al-Sawaff, Selvakumar Manickam","doi":"10.57152/predatecs.v2i1.1119","DOIUrl":"https://doi.org/10.57152/predatecs.v2i1.1119","url":null,"abstract":"Stroke is the second most common cause of death globally, making up about 11% of all deaths from health-related deaths each year, the condition varies from mild to severe, with the potential for permanent or temporary damage, caused by non-traumatic cerebral circulatory disorders. This research began with data understanding through the acquisition of a stroke patient health dataset from Kaggle, consisting of 5110 records. The pre-processing stage involved transforming the data to optimize processing, converting numeric attributes to nominal, and preparing training and test data. The focus then shifted to stroke disease classification using Random Forest, Support Vector Machines, and Neural Networks algorithms. Data processing results from the Kaggle dataset showed high performance, with Random Forest achieving 98.58% accuracy, SVM 94.11%, and Neural Network 95.72%. Although SVM has the highest recall (99.41%), while Random Forest and ANN have high but slightly lower recall rates, 98.58% and 95.72% respectively. Model selection depends on the needs of the application, either focusing on precision, recall, or a balance of both. This research contributes to further understanding of stroke diagnosis and introduces new potential for classifying the disease.","PeriodicalId":516904,"journal":{"name":"Public Research Journal of Engineering, Data Technology and Computer Science","volume":"122 43","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140679209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-21DOI: 10.57152/predatecs.v2i1.1103
Ayuni Fachrunisa Lubis, Hilmi Zalnel Haq, Indah Lestari, Muhammad Iltizam, Nitasnim Samae, Muhammad Aufi Rofiqi, Sakhi Hasan Abdurrahman, Balqis Hamasatiy Tambusai, Puja Khalwa Salsilah
The study investigates three classification algorithms, namely K-Nearest Neighbor (K-NN), Naïve Bayes, and Decision Tree, for the classification of Diabetes Mellitus using a dataset from Kaggle. K-NN relies on distance calculations between test and training data, using the Euclidean distance formula. The choice of k, representing the nearest neighbor, significantly influences K-NN's effectiveness. Naïve Bayes, a probabilistic method, predicts class probabilities based on past events, and it employs the Gaussian distribution method for continuous data. Decision Trees, form prediction models with easily implementable rules. Data collection involves obtaining a Diabetes Mellitus dataset with eight attributes. Data preprocessing includes cleaning and normalization to minimize inconsistencies and incomplete data. The classification algorithms are applied using the Rapidminer tool, and the results are compared for accuracy. Naïve Bayes yields 77.34% accuracy, K-NN performance depends on the chosen k value, and Decision Trees generate rules for classification. The study provides insights into the strengths and weaknesses of each algorithm for diabetes classification
{"title":"Classification of Diabetes Mellitus Sufferers Eating Patterns Using K-Nearest Neighbors, Naïve Bayes and Decission Tree","authors":"Ayuni Fachrunisa Lubis, Hilmi Zalnel Haq, Indah Lestari, Muhammad Iltizam, Nitasnim Samae, Muhammad Aufi Rofiqi, Sakhi Hasan Abdurrahman, Balqis Hamasatiy Tambusai, Puja Khalwa Salsilah","doi":"10.57152/predatecs.v2i1.1103","DOIUrl":"https://doi.org/10.57152/predatecs.v2i1.1103","url":null,"abstract":"The study investigates three classification algorithms, namely K-Nearest Neighbor (K-NN), Naïve Bayes, and Decision Tree, for the classification of Diabetes Mellitus using a dataset from Kaggle. K-NN relies on distance calculations between test and training data, using the Euclidean distance formula. The choice of k, representing the nearest neighbor, significantly influences K-NN's effectiveness. Naïve Bayes, a probabilistic method, predicts class probabilities based on past events, and it employs the Gaussian distribution method for continuous data. Decision Trees, form prediction models with easily implementable rules. Data collection involves obtaining a Diabetes Mellitus dataset with eight attributes. Data preprocessing includes cleaning and normalization to minimize inconsistencies and incomplete data. The classification algorithms are applied using the Rapidminer tool, and the results are compared for accuracy. Naïve Bayes yields 77.34% accuracy, K-NN performance depends on the chosen k value, and Decision Trees generate rules for classification. The study provides insights into the strengths and weaknesses of each algorithm for diabetes classification","PeriodicalId":516904,"journal":{"name":"Public Research Journal of Engineering, Data Technology and Computer Science","volume":"119 38","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140678467","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-21DOI: 10.57152/predatecs.v2i1.1094
Muhammad Fauzi Fayyad, Viki Kurniawan, Muhammad Ridho Anugrah, Baıhaqı Hılmı Estanto, Tasnim Bilal
Foreign exchange rates have a crucial role in a country's economic development, influencing long-term investment decisions. This research aims to forecast the exchange rate of Rupiah to the United States Dollar (USD) by using deep learning models of Recurrent Neural Network (RNN) architecture, especially Bi-Long Short-Term Memory (Bi-LSTM), Gated Recurrent Unit (GRU), and Bi-Gated Recurrent Unit (Bi-GRU). Historical daily exchange rate data from January 1, 2013 to November 3, 2023, obtained from Yahoo Finance, was used as the dataset. The model training and evaluation process was performed based on various parameters such as optimizer, batch size, and time step. The best model was identified by minimizing the Mean Square Error (MSE), Root Mean Square Error (RMSE), Mean Absolute Error (MAE), and Mean Absolute Percentage Error (MAPE). Among the models tested, the GRU model with Nadam optimizer, batch size 16, and timestep 30 showed the best performance, with MSE 3741.6999, RMSE 61.1694, MAE 45.6246, and MAPE 0.3054%. The forecast results indicate a strengthening trend of the Rupiah exchange rate against the USD in the next 30 days, which has the potential to be taken into consideration in making investment decisions and shows promising economic growth prospects for Indonesia.
{"title":"Application of Recurrent Neural Network Bi-Long Short-Term Memory, Gated Recurrent Unit and Bi-Gated Recurrent Unit for Forecasting Rupiah Against Dollar (USD) Exchange Rate","authors":"Muhammad Fauzi Fayyad, Viki Kurniawan, Muhammad Ridho Anugrah, Baıhaqı Hılmı Estanto, Tasnim Bilal","doi":"10.57152/predatecs.v2i1.1094","DOIUrl":"https://doi.org/10.57152/predatecs.v2i1.1094","url":null,"abstract":"Foreign exchange rates have a crucial role in a country's economic development, influencing long-term investment decisions. This research aims to forecast the exchange rate of Rupiah to the United States Dollar (USD) by using deep learning models of Recurrent Neural Network (RNN) architecture, especially Bi-Long Short-Term Memory (Bi-LSTM), Gated Recurrent Unit (GRU), and Bi-Gated Recurrent Unit (Bi-GRU). Historical daily exchange rate data from January 1, 2013 to November 3, 2023, obtained from Yahoo Finance, was used as the dataset. The model training and evaluation process was performed based on various parameters such as optimizer, batch size, and time step. The best model was identified by minimizing the Mean Square Error (MSE), Root Mean Square Error (RMSE), Mean Absolute Error (MAE), and Mean Absolute Percentage Error (MAPE). Among the models tested, the GRU model with Nadam optimizer, batch size 16, and timestep 30 showed the best performance, with MSE 3741.6999, RMSE 61.1694, MAE 45.6246, and MAPE 0.3054%. The forecast results indicate a strengthening trend of the Rupiah exchange rate against the USD in the next 30 days, which has the potential to be taken into consideration in making investment decisions and shows promising economic growth prospects for Indonesia.","PeriodicalId":516904,"journal":{"name":"Public Research Journal of Engineering, Data Technology and Computer Science","volume":"118 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140678260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-21DOI: 10.57152/predatecs.v2i1.1100
Kana Karunia, Aprilya Eka Putri, May Dila Fachriani, Muhammad Hilman Rois
According to the 2019 report, Tokopedia is the most visited marketplace with 140,000,000 visitors per month, making it one of the most popular marketplaces in Indonesia. Customers have the opportunity to write reviews about the products they purchase at the end of the transaction process on Tokopedia. The aim of this research is to conduct sentiment analysis on product reviews on Tokopedia. Three neural networks that will be used for text classification are Bi-GRU, GRU, and LSTM. The data processing technique is divided into training and testing samples, split into 80%:20% using the holdout technique. The BI-GRU algorithm has an accuracy of 0.93% and precision of 0.96, better than the other two methods LSTM and GRU, which each have an accuracy of 0.92 and recall of 0.91.
{"title":"Evaluation of the Effectiveness of Neural Network Models for Analyzing Customer Review Sentiments on Marketplace","authors":"Kana Karunia, Aprilya Eka Putri, May Dila Fachriani, Muhammad Hilman Rois","doi":"10.57152/predatecs.v2i1.1100","DOIUrl":"https://doi.org/10.57152/predatecs.v2i1.1100","url":null,"abstract":"According to the 2019 report, Tokopedia is the most visited marketplace with 140,000,000 visitors per month, making it one of the most popular marketplaces in Indonesia. Customers have the opportunity to write reviews about the products they purchase at the end of the transaction process on Tokopedia. The aim of this research is to conduct sentiment analysis on product reviews on Tokopedia. Three neural networks that will be used for text classification are Bi-GRU, GRU, and LSTM. The data processing technique is divided into training and testing samples, split into 80%:20% using the holdout technique. The BI-GRU algorithm has an accuracy of 0.93% and precision of 0.96, better than the other two methods LSTM and GRU, which each have an accuracy of 0.92 and recall of 0.91.","PeriodicalId":516904,"journal":{"name":"Public Research Journal of Engineering, Data Technology and Computer Science","volume":"119 35","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140678470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-21DOI: 10.57152/predatecs.v2i1.1087
Yoga Ardiansah, Nanda Try Luchia, Delvi Hastari, T. M. F. Rifat, Rendhy Rachfaizi, Nanda Aulia Putri, Ella Silvana Ginting
Lectures are the last level of education passed. However, the opportunity to obtain further education cannot be owned just like that by everyone because of the economic factors they experience. Therefore, an assessment method is needed to support the decision of KIP-Kuliah recipients at the lecture level for new students within the Faculty of Science and Technology, Sultan Syarif Kasim Riau State Islamic University. This research applies the Fuzzy Mamdani algorithm with Fuzzy Logic and is expected to be able to provide recommendations for worthy scholarship recipients so that the assistance provided is right on target. The results showed that 26,7% of students received the rejected status. Several experiments conducted, illustrate the performance of Fuzzy Logic in this research is very powerful in determining policies and as decision support. The implementation of the research results recommends the best selection from a series of decisions making.
{"title":"Application of The Fuzzy Mamdani Method in Determining KIP-Kuliah Recipients for New Students","authors":"Yoga Ardiansah, Nanda Try Luchia, Delvi Hastari, T. M. F. Rifat, Rendhy Rachfaizi, Nanda Aulia Putri, Ella Silvana Ginting","doi":"10.57152/predatecs.v2i1.1087","DOIUrl":"https://doi.org/10.57152/predatecs.v2i1.1087","url":null,"abstract":"Lectures are the last level of education passed. However, the opportunity to obtain further education cannot be owned just like that by everyone because of the economic factors they experience. Therefore, an assessment method is needed to support the decision of KIP-Kuliah recipients at the lecture level for new students within the Faculty of Science and Technology, Sultan Syarif Kasim Riau State Islamic University. This research applies the Fuzzy Mamdani algorithm with Fuzzy Logic and is expected to be able to provide recommendations for worthy scholarship recipients so that the assistance provided is right on target. The results showed that 26,7% of students received the rejected status. Several experiments conducted, illustrate the performance of Fuzzy Logic in this research is very powerful in determining policies and as decision support. The implementation of the research results recommends the best selection from a series of decisions making.","PeriodicalId":516904,"journal":{"name":"Public Research Journal of Engineering, Data Technology and Computer Science","volume":"112 33","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140678341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
An abnormal or excessive build-up of fat that can negatively impact one's health as a result of an imbalance in energy between calories consumed and burnt is known as obesity. The majority of ailments, such as diabetes, heart disease, cancer, osteoarthritis, chronic renal disease, stroke, hypertension, and other fatal conditions, are linked to obesity. Information technology has therefore been the subject of several studies aimed at diagnosing and treating obesity. Because there is a wealth of information on obesity, data mining techniques such as the K-Nearest Neighbors (K-NN) algorithm, Naïve Bayes Classifier, Support Vector Machine (SVM), and Decision Tree can be used to classify the data. The 2111 records and 17 characteristics of obesity data that were received from Kaggle will be used in this study. The four algorithms are to be compared in this study. In other words, using the dataset used in this study, the Decision Tree algorithm's accuracy outperforms that of the other three algorithms K-NN, Naïve Bayes, and SVM. Using the Decision Tree algorithm, the accuracy was 84.98%; the K-NN algorithm came in second with an accuracy value of 83.55%; the Naïve Bayes algorithm came in third with an accuracy rate of 77.48%; and the SVM algorithm came in last with the lowest accuracy value in this study, at 77.32%.
{"title":"Implementation of K-Nearest Neighbors, Naïve Bayes Classifier, Support Vector Machine and Decision Tree Algorithms for Obesity Risk Prediction","authors":"Amanda Iksanul Putri, Nur Alfa Husna, Neha Mella Cia, Muhammad Abdillah Arba, Nasywa Rihadatul Aisyi, Chintya Harum Pramesthi, Abidaharbya Salsa Irdayusman","doi":"10.57152/predatecs.v2i1.1110","DOIUrl":"https://doi.org/10.57152/predatecs.v2i1.1110","url":null,"abstract":"An abnormal or excessive build-up of fat that can negatively impact one's health as a result of an imbalance in energy between calories consumed and burnt is known as obesity. The majority of ailments, such as diabetes, heart disease, cancer, osteoarthritis, chronic renal disease, stroke, hypertension, and other fatal conditions, are linked to obesity. Information technology has therefore been the subject of several studies aimed at diagnosing and treating obesity. Because there is a wealth of information on obesity, data mining techniques such as the K-Nearest Neighbors (K-NN) algorithm, Naïve Bayes Classifier, Support Vector Machine (SVM), and Decision Tree can be used to classify the data. The 2111 records and 17 characteristics of obesity data that were received from Kaggle will be used in this study. The four algorithms are to be compared in this study. In other words, using the dataset used in this study, the Decision Tree algorithm's accuracy outperforms that of the other three algorithms K-NN, Naïve Bayes, and SVM. Using the Decision Tree algorithm, the accuracy was 84.98%; the K-NN algorithm came in second with an accuracy value of 83.55%; the Naïve Bayes algorithm came in third with an accuracy rate of 77.48%; and the SVM algorithm came in last with the lowest accuracy value in this study, at 77.32%.","PeriodicalId":516904,"journal":{"name":"Public Research Journal of Engineering, Data Technology and Computer Science","volume":"104 30","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140679008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Advancements in technology have made online shopping popular among many. However, the use of offline marketing models is still considered a profitable and important way of business development. This can be seen in the 2022 Association of Retail Entrepreneurs of Indonesia (APRINDO), which states that 60% of Indonesians shop offline, and in 2023, more than 75% of continental European consumers will prefer to shop offline. This is because many benefits can be achieved through offline marketing that cannot be obtained from online marketing. Therefore, classification of patterns and trends is performed to compare the results of the algorithms under study. Furthermore, this research was conducted to help offline retailers understand consumption patterns and trends that affect purchases. The algorithms analyzed in this study are K-Nearest Neighbor (K-NN), Naive Bayes, and Artificial Neural Network (ANN). As a result, the ANN algorithm obtained the highest confusion matrix results with an Accuracy value of 96.38%, Precision of 100.00%, and Recall of 100.00%. Meanwhile, when the Naive Bayes algorithm was used, the lowest Accuracy value was 57.39%, the Precision value was 57.86%, and when the K-NN algorithm was used, the Recall value was as low as 92.00%. These results indicate that the ANN algorithm is better at classifying offline shopping image data than the K-NN and Naive Bayes algorithms
{"title":"Classifications of Offline Shopping Trends and Patterns with Machine Learning Algorithms","authors":"Muta'alimah Muta'alimah, Cindy Kirana Zarry, Atha Kurniawan, Hauriya Hasysya, Muhammad Farhan Firas, Nurin Nadhirah","doi":"10.57152/predatecs.v2i1.1099","DOIUrl":"https://doi.org/10.57152/predatecs.v2i1.1099","url":null,"abstract":"Advancements in technology have made online shopping popular among many. However, the use of offline marketing models is still considered a profitable and important way of business development. This can be seen in the 2022 Association of Retail Entrepreneurs of Indonesia (APRINDO), which states that 60% of Indonesians shop offline, and in 2023, more than 75% of continental European consumers will prefer to shop offline. This is because many benefits can be achieved through offline marketing that cannot be obtained from online marketing. Therefore, classification of patterns and trends is performed to compare the results of the algorithms under study. Furthermore, this research was conducted to help offline retailers understand consumption patterns and trends that affect purchases. The algorithms analyzed in this study are K-Nearest Neighbor (K-NN), Naive Bayes, and Artificial Neural Network (ANN). As a result, the ANN algorithm obtained the highest confusion matrix results with an Accuracy value of 96.38%, Precision of 100.00%, and Recall of 100.00%. Meanwhile, when the Naive Bayes algorithm was used, the lowest Accuracy value was 57.39%, the Precision value was 57.86%, and when the K-NN algorithm was used, the Recall value was as low as 92.00%. These results indicate that the ANN algorithm is better at classifying offline shopping image data than the K-NN and Naive Bayes algorithms","PeriodicalId":516904,"journal":{"name":"Public Research Journal of Engineering, Data Technology and Computer Science","volume":"115 30","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140678420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Association rule is a data mining technique to find associative rules between a combination of items. This research aims to apply association rules algorithm in identifying popular topping combinations in food orders. This application aims to help restaurant owners or food businesses understand their customers' preferences and optimize their menu offerings. Data obtained from kaggle, the association rules algorithm is applied to this dataset to identify patterns or combinations of toppings that often appear together in orders. The results of this study show toppings with chocolate as a popular item in orders. These findings can provide valuable insights for food business owners in structuring their menus and determining attractive offers for customers. This study also applied a comparison between the apriori, fp- growth and eclat algorithms, with the result that the best item transaction rule was found: a combination of dill & unicorn toppings with chocolate with 60% confidence. Overall, the application of eclat algorithm in this study provides the best performance with higher execution speed, thus providing insight into customer preferences regarding topping combinations in food orders. Despite the shortcomings of the data form from this study, it is expected to help business owners in optimizing their offerings, increasing customer satisfaction, and improving their business performance.
{"title":"Implementation of Association Rules Algorithm to Identify Popular Topping Combinations in Orders","authors":"Rizki Aulia Putra, Margareta Amalia Miranti Putri, Sri Maharani Sinaga, Sania Fitri Octavia, Raihan Catur Rachman","doi":"10.57152/predatecs.v1i2.863","DOIUrl":"https://doi.org/10.57152/predatecs.v1i2.863","url":null,"abstract":"Association rule is a data mining technique to find associative rules between a combination of items. This research aims to apply association rules algorithm in identifying popular topping combinations in food orders. This application aims to help restaurant owners or food businesses understand their customers' preferences and optimize their menu offerings. Data obtained from kaggle, the association rules algorithm is applied to this dataset to identify patterns or combinations of toppings that often appear together in orders. The results of this study show toppings with chocolate as a popular item in orders. These findings can provide valuable insights for food business owners in structuring their menus and determining attractive offers for customers. This study also applied a comparison between the apriori, fp- growth and eclat algorithms, with the result that the best item transaction rule was found: a combination of dill & unicorn toppings with chocolate with 60% confidence. Overall, the application of eclat algorithm in this study provides the best performance with higher execution speed, thus providing insight into customer preferences regarding topping combinations in food orders. Despite the shortcomings of the data form from this study, it is expected to help business owners in optimizing their offerings, increasing customer satisfaction, and improving their business performance.","PeriodicalId":516904,"journal":{"name":"Public Research Journal of Engineering, Data Technology and Computer Science","volume":"113 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139897088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Quran, comprising Allah's absolute divine messages, serves as guidance. Although reading the Quran with tafsir proves beneficial, it may not offer a comprehensive understanding of the entire message conveyed by the Al-Quran. This is due to the Quran addressing diverse topics within each surah, necessitating readers to reference interconnected verses throughout the entire chapter for a holistic interpretation. However, given the extensive and varied verses, obtaining accurate translations for each verse can be a complex and time-consuming endeavor. Therefore, it becomes imperative to categorize the translated text of Quranic verses into distinct classes based on their primary content, utilizing Fuzzy C-Means, Random Forest, and Support Vector Machine. The analysis, considering the obtained Davies-Bouldin Index (DBI) value, reveals that cluster 9 emerges as the optimal cluster for classifying QS An-Nisa data, exhibiting the lowest DBI value of 4.30. Notably, the Random Forest algorithm demonstrates higher accuracy compared to the SVM algorithm, achieving an accuracy rate of 66.37%, while the SVM algorithm attains an accuracy of 50.56%.
{"title":"Text Classification of Translated Qur'anic Verses Using Supervised Learning Algorithm","authors":"Dhea Ananda, Syahida Nurhidayarnis, Tiara Afrah Afifah, Muhammad Anang Ramadhan, Ilvan Mahendra","doi":"10.57152/predatecs.v1i2.870","DOIUrl":"https://doi.org/10.57152/predatecs.v1i2.870","url":null,"abstract":"The Quran, comprising Allah's absolute divine messages, serves as guidance. Although reading the Quran with tafsir proves beneficial, it may not offer a comprehensive understanding of the entire message conveyed by the Al-Quran. This is due to the Quran addressing diverse topics within each surah, necessitating readers to reference interconnected verses throughout the entire chapter for a holistic interpretation. However, given the extensive and varied verses, obtaining accurate translations for each verse can be a complex and time-consuming endeavor. Therefore, it becomes imperative to categorize the translated text of Quranic verses into distinct classes based on their primary content, utilizing Fuzzy C-Means, Random Forest, and Support Vector Machine. The analysis, considering the obtained Davies-Bouldin Index (DBI) value, reveals that cluster 9 emerges as the optimal cluster for classifying QS An-Nisa data, exhibiting the lowest DBI value of 4.30. Notably, the Random Forest algorithm demonstrates higher accuracy compared to the SVM algorithm, achieving an accuracy rate of 66.37%, while the SVM algorithm attains an accuracy of 50.56%.","PeriodicalId":516904,"journal":{"name":"Public Research Journal of Engineering, Data Technology and Computer Science","volume":"20 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139897265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Association rule is a data mining technique to find associative rules between a combination of items. This research aims to apply association rules algorithm in identifying popular topping combinations in food orders. This application aims to help restaurant owners or food businesses understand their customers' preferences and optimize their menu offerings. Data obtained from kaggle, the association rules algorithm is applied to this dataset to identify patterns or combinations of toppings that often appear together in orders. The results of this study show toppings with chocolate as a popular item in orders. These findings can provide valuable insights for food business owners in structuring their menus and determining attractive offers for customers. This study also applied a comparison between the apriori, fp- growth and eclat algorithms, with the result that the best item transaction rule was found: a combination of dill & unicorn toppings with chocolate with 60% confidence. Overall, the application of eclat algorithm in this study provides the best performance with higher execution speed, thus providing insight into customer preferences regarding topping combinations in food orders. Despite the shortcomings of the data form from this study, it is expected to help business owners in optimizing their offerings, increasing customer satisfaction, and improving their business performance.
{"title":"Implementation of Association Rules Algorithm to Identify Popular Topping Combinations in Orders","authors":"Rizki Aulia Putra, Margareta Amalia Miranti Putri, Sri Maharani Sinaga, Sania Fitri Octavia, Raihan Catur Rachman","doi":"10.57152/predatecs.v1i2.863","DOIUrl":"https://doi.org/10.57152/predatecs.v1i2.863","url":null,"abstract":"Association rule is a data mining technique to find associative rules between a combination of items. This research aims to apply association rules algorithm in identifying popular topping combinations in food orders. This application aims to help restaurant owners or food businesses understand their customers' preferences and optimize their menu offerings. Data obtained from kaggle, the association rules algorithm is applied to this dataset to identify patterns or combinations of toppings that often appear together in orders. The results of this study show toppings with chocolate as a popular item in orders. These findings can provide valuable insights for food business owners in structuring their menus and determining attractive offers for customers. This study also applied a comparison between the apriori, fp- growth and eclat algorithms, with the result that the best item transaction rule was found: a combination of dill & unicorn toppings with chocolate with 60% confidence. Overall, the application of eclat algorithm in this study provides the best performance with higher execution speed, thus providing insight into customer preferences regarding topping combinations in food orders. Despite the shortcomings of the data form from this study, it is expected to help business owners in optimizing their offerings, increasing customer satisfaction, and improving their business performance.","PeriodicalId":516904,"journal":{"name":"Public Research Journal of Engineering, Data Technology and Computer Science","volume":"28 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139893950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：