Article Per Year (5 Year)
p-Index From 2020 - 2025
0.61
P-Index
This Author published in this journals
All Journal Jurnal Nasional Komputasi dan Teknologi Informasi MEANS (Media Informasi Analisa dan Sistem) Kesatria : Jurnal Penerapan Sistem Informasi (Komputer dan Manajemen)
Perdana, Rika Widya
Unknown Affiliation
Aerospace Engineering Automotive Engineering Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Engineering Neuroscience Transportation

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

Found 3 Documents
Search

 1 
Penerapan Algoritma Naïve Bayes Dalam Pengelompokkan Air Layak Minum Sari, Dian Permata; Buana, Wira; Meri, Rozi; Perdana, Rika Widya
Kesatria : Jurnal Penerapan Sistem Informasi (Komputer dan Manajemen) Vol 5, No 3 (2024): Edisi Juli
Publisher : LPPM STIKOM Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/kesatria.v5i3.406

Abstract

Water is a basic human need, without water humans cannot carry out activities. However, not all types of water can be consumed and are healthy for humans. So it is important to check water quality regularly. Because the influence of weather can make the water quality unfit      consumption. To determine water quality, laboratory testing is required. This test requires complex analysis results so the time used in testing is relatively longer. In data mining there are classification techniques that can be used to group drinking water samples based on several variables that have been determined from water data. The aim of this research is to classify the types of drinking water that are suitable for consumption and the characteristics of healthy water. To process the data using the Naïve Bayes algorithm and produce an accuracy value of 75%.
Penerapana Artificial Intelegence dalam Pencarian Alternatif Rute Terkecil Jalur Kota Menggunakan Metode Travelling Salesman Problem (TSP) Perdana, Rika Widya
Jurnal Nasional Komputasi dan Teknologi Informasi (JNKTI) Vol 7, No 6 (2024): Desember 2024
Publisher : Program Studi Teknik Komputer, Fakultas Teknik. Universitas Serambi Mekkah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32672/jnkti.v7i6.8331

Abstract

Abstrak – Ilmu kecerdasan buatan saat ini sangat berkembang dilihat banyak nya teknologi yang bisa digunakan dalam berbagai bidang. Searching termasuk kedalam ilmu Kecerdasan Buatan dengan menggunakan teknik pencarian heuristic yang sering digunakan dalam mencari solusi terbaik yaitu metode Travelling Salesman Problem (TSP).  Metode Travelling Salesman Problem (TSP) digunakan dalam pencarian rute terpendek dalam menemukan rute terkecil yang sering digunakan dalam kehidupan sehari hari. Tujuan penelitian yaitu mengimplementasikan pencarian heuristic dengan algoritma Travelling Salesman Problem (TSP) pada rute terpendek dalam mencari titik Kota yang akan dituju. Nilai parameter yang digunakan yaitu jarak dan waktu. Hasil akhir yang diperoleh dalam penelitian ini diperoleh sebuah system pencarian yang mampu menemukan solusi rute terpendek atau mencari alternatif dan saran yang digunakan untuk menganalisis rute yang akan pilih. Hasil akhir pencarian rute yang ditemukan dengan titik 4 Rute sebanyak 24 rute Jalur. Kota terdiri dari 4 kota 1,2,3,4, Titik kota yang mampu menghasilkan rute terpendek yaitu Kota 1342 = 100+145+160 Jumlah 405 KM dan Kota 2431= 160+145+100 = Jumlah 405 KM. Berdasarkan nilai yang diperoleh dari 24 alternatif terdapat  Dua alternatif jalur yang digunakan untuk menghemat jarak dan waktu. Sistem ini mampu menyelesaikan permasalahan sehingga menghasilkan nilai jarak tempuh yang lebih efesienKata Kunci; Generate and test;TSP; Jarak; Waktu; alternative Abstract - Artificial intelligence science is currently very developed as seen by the many technologies that can be used in various fields. Searching is included in the science of Artificial Intelligence using heuristic search techniques which are often used in finding the best solution, namely the Generate and test method. The Generate and test method and the Traveling Salesman Problem (TSP) are used to search for the shortest route to find the smallest route that is often used in daily life. The aim of the research is to implement a heuristic search with the Generate and Test algorithm on the shortest route to find the city point you want to go to. The parameter values used are distance and time. The final result obtained in this research is a system that is able to find the shortest route solution or look for alternatives and suggestions that are used to analyze the route that will be found. The final result of the route search found with point 4 Routes 1,2,3,4 is City 1342 = 100+145+160 Total 405 KM and City 2431= 160+145+100 = 405KM. Based on the values obtained from 24 alternatives, there are two alternative routes that can be used to save distance and time.Keywords; Generate and test;TSP; Distance; Time; alternative
Kepuasan Pelanggan Terhadap Produk Toko H. MANTI menggunakan Konsep Sistem Pendukung Keputusan dengan Metode Smart Perdana, Rika Widya; Meri, Rozi
MEANS (Media Informasi Analisa dan Sistem) Volume 8 Nomor 2
Publisher : LPPM UNIKA Santo Thomas Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.54367/means.v8i2.3053

Abstract

The purpose of this research was to see how high customer satisfaction was with the products offered by Toko H. Manti. The sample used for research data processing is badcover sales data on sales from September 2022 to September 2023. Decision support system data processing using the SMART (Simple Multi. Attribute Rating Technique) method. The data processed is bedcover data by comparing several bedcover products, namely, raline, illusion, my love, diva linen, california, and d'luxe kintakun bedcover. Through this method, data is processed through several stages, namely determining criteria and weight values, determining weight values, normalizing weight values, and determining utility values, as well as determining the final value. By carrying out these steps, the result was that the raline bedcover got the highest weighted score with a score of 99 and the becover that got the lowest score was the illusion bedcover with a score of 53.
Co-Authors Dian Permata Sari Meri, Rozi Wira Buana, Wira