Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Jurnal Kajian Ilmiah Journal of Students‘ Research in Computer Science (JSRCS)
Putra , Tri Dharma
Unknown Affiliation
Humanities Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Social Sciences

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

Found 2 Documents
Search

 1 
Analisis Keranjang Belanja dengan Algoritma Apriori Klasik pada Data Mining Putra , Tri Dharma
Jurnal Kajian Ilmiah Vol. 20 No. 1 (2020): Januari 2020
Publisher : Lembaga Penelitian, Pengabdian Kepada Masyarakat dan Publikasi (LPPMP)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (208.59 KB) | DOI: 10.31599/jki.v20i1.70

Abstract

Association Rule Mining is an area of data mining that focus on pruning candidate keys, to find frequent item set. For example, a set of items, such as milk and bread, that appear frequently together in a transaction data set is a frequent itemset. A subsequence, such as buying first PC, then a digital camera, and then a memory card, if it occurs frequently in a shopping history database, is a (frequent) sequential pattern, also knwon as market basket analysis. This paper describes the step by step classical apriori on market basket analysis. Keywords: apriori algorithm, frequent item set, market basket analysis, association rule Abstrak Penambangan Aturan Asosiasi adalah area data mining yang fokus pada pemangkasan kunci kandidat, untuk menemukan frequent itemset. Sebagai contoh, satu set item, misalnya susu dan roti, yang muncul sering bersama-sama di set data transaksi adalah frequent itemset. Berikutnya, pelanggan, misalnya membeli PC dahulu, lalu kamera digital, lalu kartu memori, jika ini sering terjadi dalam riwayat basisdata belanja, adalah pola sekuensial berurutan (sering), juga dikenal sebagai analisis keranjang belanja. Tulisan ini menjelaskan langkah demi langkah algoritma apriori klasik pada analisis keranjang belanja. Kata kunci: algoritma apriori, frequent itemset, analisis keranjang belanja, aturan asosiasi
Sistem Informasi Geografis Mencari Rute Terpendek Pada Pemetaan SMP di Kecamatan Mustikajaya Dengan Algoritma A-Star A(*) Berbasis Web Novandra , Deka Darma; Putra , Tri Dharma; Mayadi , Mayadi
Journal of Students‘ Research in Computer Science Vol. 4 No. 1 (2023): Mei 2023
Publisher : Program Studi Informatika Fakultas Ilmu Komputer Universitas Bhayangkara Jakarta Raya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31599/755m7j40

Abstract

Many parents have few references to send their children to school, and are only based on suggestions or invitations from those closest to them. Lack of information can be one of the reasons for the lack of references for parents to choose a junior high school for their child. The lack of information regarding the location of junior high schools is the reason for the lack of references for parents to send their children to school. Based on the existing problems, the authors propose a web-based geographic information system that uses the A-Star Algorithm (A*) to be used as a means of information and also to add references for parents/guardians. The A-Star (A*) algorithm is a method for searching for information about the distance to reach a destination by selecting the closest route.
Co-Authors Mayadi , Mayadi Novandra , Deka Darma