Jika berbicara organisasi atau perusahaan, terdapat beberapa faktor penting yang dapat menentukan maju atau mundurnya organisasi atau perusahaan tersebut, di antaranya adalah peran karyawan. karyawan yang mempunyai kualitas tinggi akan sangat membantu perusahaan dalam mencapai tujuannya. Perusahaan dapat memberikan penghargaan kepada karyawan yang dianggap berprestasi berupa kenaikan jabatan. Penelitian ini mengangkat studi kasus sistem pendukung keputusan kenaikan jabatan menggunakan metode profile matching di PT. Metsuma Anugrah Graha. Saat ini proses kenaikan jabatan karyawan yang terdapat pada PT. Metsuma Anugrah Graha belum dapat memenuhi kebutuhan yang diinginkan karena masih dilakukan secara manual. Pengumpulan data penelitian menggunakan teknik observasi, wawancara, dan studi pustaka. Metodologi pengembangan sistem yang digunakan adalah metodologi terstruktur dengan perancangan model yang digunakan adalah model Pencocokan Profil (profile matching) dengan metode perhitungan Pemetaan Gap Kompetensi serta PHP dan MySQL sebagai alat pengkodean komputer. Sistem Pendukung Keputusan ini dapat menjadi solusi dalam pengambil keputusan untuk menentukan perhitungan nilai kenaikan jabatan.
Imbalanced dataset can cause obstacles to classification and result in a decrease in classification performance. There are several methods that can be used to deal the data imbalances, such as methods based on SMOTE and Generative Adversarial Networks (GAN). These methods are used for overcoming data oversampling so that the amount of minority data can increase and it can reach a balance with the majority data. In this research, the selected dataset is classified as a small imbalanced dataset of less than 200 records. The proposed method is the Gradually Generative Adversarial Network (GradGAN) model which aims to handle data imbalances gradually. The stages of the GradGAN model are adding the original minority dataset gradually so that it will create new minority datasets until a balance of data is created. Based on the algorithm flow described, the minority data is multiplied by the value of the variable that has been determined repeatedly to produce new balanced minority data. The test results on the classification of datasets from the GradGAN model produce an accuracy value of 8.3% when compare to that without GradGAN.
Penentuan Peringkat Bank Perkreditan Rakyat dipandang penting untuk mempermudah masyarakat dalam memilih. Penentuan peringkat Bank Perkreditan Rakyat biasanya dilakukan sesuai dengan ketentuan Bank Indonesia peraturan Bank Indonesia (BI) No. 30/12/KEP/DIR Tanggal 30 April 1997 tentang Tata Cara Penilaian Kesehatan BPR. Banyak studi yang telah dilakukan untuk menentukan metode penentuan peringkat dengan pendekatan metode Fuzzy MCDM, BSC, F-AHP, F-TOPSIS, VIKOR, DANP pada bidang perbankan. Pada penelitian ini diusulkan sebuah model pendekatan evaluasi penilaian kinerja dengan kombinasi metode F-AHP dan F-TOPSIS dengan rasio keuangan sebagai kriteria penilaian (Capital, Assets, Equity dan Liquidity) untuk menentukan peringkat BPR di Kota Malang. Data yang digunakan adalah data laporan keuangan perbankan selama tiga tahun (2014-2016). Hasil penelitian menunjukkan bahwa kombinasi metode F-AHP dan F-TOPSIS dengan rasio keuangan dapat digunakan sebagai metode alternatif untuk menyusun peringkat Bank Perkreditan Rakyat di Kota Malang.
Optical Distribution Cabinet (ODC) is one of the production tools owned by PT. Telkom to distribute the internet to each area for customers to enjoy the internet network. Almost in every city and even in remote corners of the interior there are equipment belonging to PT. Telecommunication Indonesia. In this study, the authors implemented the Dijkstra method which is used to find the shortest route. Quite a popular algorithm invented by EdsgerWybeDijkstra. Dijkstra will play a role in determining the shortest route to the device whose location has been obtained from PT Telkom Pasuruan. Djikstra is a variant of a popular algorithm form in solving problems related to the optimization problem of finding the shortest path, a path that has a minimum length from vertex a to j in a weighted graph, the weight is a positive number so it cannot be traversed by negative nodes. However, if this happens, the solution given is infinite (Infinite). In Dijkstra's algorithm, nodes are used because Dijkstra's algorithm uses directed graphs for determining the shortest list route.From the results of the research that has been done, the writer can draw conclusions about applying the Dijkstra method at point (A), namely the starting location with the aim of point (J). then obtained several route options totaling 4 routes in Kilometer units. for the first route get the results (0.67), second (0.7), third (0.9), fourth (0.69). The route taken is based on the route that has the smallest value, namely the first route (0.67). Then it can be concluded that the first route is the shortest route to the destination (J).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.