Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Sistemasi: Jurnal Sistem Informasi

Speed Bump System Based on Vehicle Speed using Adaptive Background Subtraction with Haar Cascade Classifier Zulfikri, Muhammad; Kusuma, Wirajaya; Hadi, Sirojul; Husain, Husain; Hammad, Rifqi; Mardedi, Lalu Zazuli Azhar
Sistemasi: Jurnal Sistem Informasi Vol 13, No 3 (2024): Sistemasi: Jurnal Sistem Informasi
Publisher : Program Studi Sistem Informasi Fakultas Teknik dan Ilmu Komputer

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32520/stmsi.v13i3.3921

Abstract

Driving at high speed and recklessly is the main cause of traffic accidents. In several places speed bumps are installed as a medium to warn drivers to slow down the speed of the vehicle, but the installation of speed bumps in several places has become a problem in itself with inconvenience for drivers traveling at low speeds, so it is necessary to develop an intelligent system to warn drivers when speeding. vehicles break safety boundaries, making drivers safer and more comfortable. At the vehicle identification stage, a combination of the Adaptive Background Subtraction method with the Haar Cascade Classifier is proposed, and vehicle speed estimation is carried out by calculating the time difference in the detection area or Region of Interest (ROI). Testing was carried out using traffic videos with three conditions, namely day, evening and night, with each condition using the same object data, namely 55 images of car objects. The proposed method produces car detection accuracy with an average of 85% and MSE 0.5 in vehicle speed measurements.
Using a Partition System to Improve the Performance of the Apriori Algorithm in Speeding Up Itemset Frequency Search Process Syahrir, Moch; Hammad, Rifqi; Abd. Latif, Kurniadin; Rosanensi, Melati
Sistemasi: Jurnal Sistem Informasi Vol 13, No 1 (2024): Sistemasi: Jurnal Sistem Informasi
Publisher : Program Studi Sistem Informasi Fakultas Teknik dan Ilmu Komputer

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32520/stmsi.v13i1.3610

Abstract

The apriori algorithm uses minimum support and minimum confidence to determine appropriate itemset rules for decision making. The problem faced in this research is how to improve the performance of the a priori algorithm in the process of searching for itemset frequencies using data partition techniques, and be able to produce optimal and consistent rules. To overcome this problem, the author implemented the a priori method and partition system to improve the performance of the a priori algorithm for the itemset frequency search process by taking public data in the form of supermarket transaction data. In this research, the performance of the a priori algorithm was tested with and without a partition system. The data used in this research consists of 350 transaction data from 1784 records with a 4-itemset pattern, minimum support value of 20% and minimum confidence of 0.5 with the best standard rules for determining minimum confidence of 0.8. Based on this research carried out, the research results obtained are that for comparison of time and memory usage the apriori algorithm with a partition system is much faster than the apriori algorithm without a partition system, while memory usage is relatively less for the apriori algorithm with the system than the apriori algorithm without a partition system.