Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)
Randy Permana
Unknown Affiliation
Computer Science & IT Engineering

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

Found 2 Documents
Search

 1 
Hybrid Data Mining For Member Determination And Financing Prediction In Syariah Financing Saving And Loan Cooperatives Ondra Eka Putra; Randy Permana
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Vol 8 No 2 (2024): April 2024
Publisher : Ikatan Ahli Informatika Indonesia (IAII)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29207/resti.v8i2.5683

Abstract

Syariah Financing Saving And Loan Cooperatives (KSPPS) is an Islamic financial institution aimed at people who are on the lower middle scale to lift the economy of small communities through microfinancing programs. Problems that often occur in member recommendations to get KSPPS financing are often not on target. In addition, The amount of member financing is often problematic due to a lack of analysis, resulting in poor financing instalments. This research aims to present an analysis model for clustering and classification using hybrid data mining algorithms. This research method is using hybrid data mining Algorithms, namely K-Medoids, Naïve Bayes, and k-Nearest Neighbors (k-NN). This study uses the historical dataset of the last two years on KSPPS BMT Dadok Tunggul Hitam as a total of 70 data samples. The analysis parameters consist of income, business, residence Status, financing application, billing history, and balance amount. The best analysis Model will be obtained by comparing the results between Naïve Bayes with K-Medoids, and K-Nearest Neighbor (k-NN) with K-Medoids. The results of this research showed the best performance is using the hybrid Naïve Bayes data mining model with K-Medoids which has an accuracy of 90.91% for data split 70:30, while performance with K-fold cross-validation shows an accuracy of 93.49% using this algorithm. Overall, the results of this study can provide an effective analysis model to determine the status of the loan.
Multi-Process Data Mining with Clustering and Support Vector Machine for Corporate Recruitment Zain, Ruri Hartika; Randy Permana; Sarjon Defit
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Vol 9 No 2 (2025): April 2025
Publisher : Ikatan Ahli Informatika Indonesia (IAII)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29207/resti.v9i2.6197

Abstract

Having an efficient and accurate recruitment process is very important for a company to attract candidates with professionalism, a high level of loyalty, and motivation. However, the current selection method often faces problems due to the subjectivity of assessing prospective employees and the long process of deciding on the best candidate. Therefore, this research aims to optimize the recruitment process by applying data mining techniques to improve efficiency and accuracy in candidate selection. The method used in this research utilizes a multi-process Data Mining approach, which is a combination of clustering and classification algorithms sequentially. In the initial stage, the K-Means algorithm is applied to cluster candidates based on administrative selection data, such as document completeness and reference support. Next, a classification model was built using a Support Vector Machine (SVM) to categorize the best candidates based on the results of psychological tests, medical tests, and interviews. The experimental results show that the SVM model produces high evaluation scores, with an AUC of 87%, Classification Accuracy (CA) of 90%, F1-score of 89%, Precision of 91%, and Recall of 90%. With these results, it can be concluded that this model is able to improve accuracy in the employee selection process and help companies make more measurable and data-based recruitment decisions.
Co-Authors Ondra Eka Putra Ruri Hartika Zain Sarjon Defit