Claim Missing Document
Check
Articles

Found 2 Documents
Search

Efektifitas Penggunaan Association Rules Mining dalam Personalisasi Website Edi Priyanto; Arief Hermawan; Rianto Rianto; Donny Avianto
JISKA (Jurnal Informatika Sunan Kalijaga) Vol. 6 No. 1 (2021): Januari 2021
Publisher : UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (360.156 KB) | DOI: 10.14421/jiska.2021.61-07

Abstract

As the usage of the internet grows, more and more information is obtained, thus presenting challenges, especially for users and website owners. Website users often have difficulty finding products or services that are relevant to their needs caused by abundant amounts of products and services delivered on a website. Website owners often find it difficult to convey information about the right products and services to certain target users. Based on the problem given above, we can conclude that a recommendation system approach that can improve personalization on their website is needed. The recommendation system approach must be able to provide navigation on the website to make it more adaptive towards the interests and information needed by the user. This study uses Association Rules formed from Microsoft web access log data by finding visitor patterns based on frequently visited web site pages. From the results of the research conducted, the performance of the method used has a precision value of 0.896, 0.058 recall, and F-measure 0.104. Whereas the measurement of the accuracy value resulted in a performance recommendation of exactly 3%, an acceptable rate of 87%, and 10% incorrect. This research shows that the Association Rules method can increase the effectiveness of website personalization to provide relevant information recommendations for visitors. For further research, it can concentrate on improving existing methods thus website personalization becomes more adaptive.
Decision Tree C4.5 Performance Improvement using Synthetic Minority Oversampling Technique (SMOTE) and K-Nearest Neighbor for Debtor Eligibility Evaluation Edi Priyanto; Enny Itje Sela; Luther Alexander Latumakulita; Noourul Islam
ILKOM Jurnal Ilmiah Vol 15, No 2 (2023)
Publisher : Prodi Teknik Informatika FIK Universitas Muslim Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33096/ilkom.v15i2.1676.373-381

Abstract

Nowadays, information technology especially machine learning has been used to evaluate the feasibility of debtors. One of the challenges in this classification model is the occurrence of imbalanced datasets, especially in the German Credit Dataset. Another challenge is developing an optimal model for evaluating debtor eligibility. Based on these challenges, this study aims to develop an optimal model for evaluating debtor eligibility on the German Credit Dataset, using the decision trees, k-Nearest Neighbor (k-NN) and Synthetic Minority Oversampling Technique (SMOTE). SMOTE and k-NN is used to overcome challenges regarding imbalanced datasets. While the decision tree are applied to produce a debtor classification model. In general, the steps taken are preparing datasets, pre-processing data, dividing datasets, oversampling with SMOTE, and classification models using decision trees, and testing. Model performance evaluation is represented by accuracy values obtained from the confusion matrix and area under curve (AUC) values generated by the Receiver Operating Characteristic (ROC). Based on the tests that have been carried out, the best accuracy value in the test is obtained at 73.00% and the AUC value is 0.708, in parameters k = 3 and Max-Depth = 25. Based on the analysis produced, the proposed model can improve performance compared to if the dataset is not applied SMOTE.