cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Yuni Wibawanti
Contact Email
stringinformatika@gmail.com
Phone
+6281617239740
Journal Mail Official
stringinformatika@gmail.com
Editorial Address
Prodi Teknik Informatika FTIK Universitas Indraprasta PGRI Jl. Raya Tengah Kelurahan Gedong , Pasar Rebo, Jakarta Timur
Location
Kota adm. jakarta selatan,
Dki jakarta
INDONESIA
STRING (Satuan Tulisan Riset dan Inovasi Teknologi)
Published by Universitas Indraprasta PGRI
ISSN : 25279661     EISSN : 25492837     DOI : http://dx.doi.org/10.30998/string.v4i3.6197
Core Subject : Science, Education,
Computer Science & IT Mathematics
STRING (Satuan Tulisan Riset dan Inovasi Teknologi) focuses on the publication of the results of scientific research related to the science and technology. STRING publishes scholarly articles in Science and Technology Focus and Scope Covering: 1. Computing and Informatics 2. Industrial Engineering 3. Electrical Engineering 3. Mechanical Engineering 4. Applied Mathematical 5. Physics (Classical and modern) 6. Mathematics and Science
Arjuna Subject : Ilmu Komputer (semua kategori) - Teori Komputasi dan Matematika
Articles 14 Documents
 1   2 
Search results for , issue "Vol 8, No 3 (2024)" : 14 Documents clear
Black Box Testing pada Website Sistem Perpustakaan Menggunakan Metode Equivalence Partitioning dan Analisis Boundary Value Restu Langit, Muhammad Shandy; Voutama, Apriade; Ali Ridha, Azhari
STRING (Satuan Tulisan Riset dan Inovasi Teknologi) Vol 8, No 3 (2024)
Publisher : Universitas Indraprasta PGRI Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30998/string.v8i3.19529

Abstract

The most important stage when developing a system is testing. Testing on the system needs to be carried out in order to find out how far the usability of the system is working. This research aims to carry out blackbox testing on the library system website by utilizing the Boundary Value and Equivalence Partitioning analysis methods to understand whether the functions on the website are running properly and to evaluate the suitability of website features with user needs. This test is carried out on the main function of the website, namely the login and sign in menu. This black box test is to test the accuracy of the type of input data and data entered into the system. Based on testing using this method, the results obtained were that no functional errors were found on the input side of the system and no errors were identified on the website system of the Bekasi Regency Archives and Library Service.
Perbandingan Metode Single Exponential Smoothing dan Regresi Linear dalam Menentukan Forecasting Permintaan Produk Suranto, Peny Septiana; Fitriani, Risma
STRING (Satuan Tulisan Riset dan Inovasi Teknologi) Vol 8, No 3 (2024)
Publisher : Universitas Indraprasta PGRI Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30998/string.v8i3.19319

Abstract

Perbandingan Kinerja Algoritma K-Nearest Neighbors (K-NN) Dan Decision Tree dalam Deteksi Paket Malis pada Jaringan Kasmara, Bib Nugraha; Handayani, Endah Tri Esti; Nathasia, Novi Dian
STRING (Satuan Tulisan Riset dan Inovasi Teknologi) Vol 8, No 3 (2024)
Publisher : Universitas Indraprasta PGRI Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30998/string.v8i3.22362

Abstract

This research aims to classify malicious packet data and compare the performance of two algorithms, namely K-Nearest Neighbor (K-NN) and Decision Tree (DT). The UNSW-NB15 dataset used in this study has undergone preprocessing, feature selection, and data split stages. The preprocessing stage includes data transformation and selection of relevant features to detect malicious packets. Subsequently, experiments were conducted to test various values of K in K-NN and measure accuracy, recall, precision, and F1-Score. The results show that K-NN has an accuracy of 91.54%, while DT has 92.41%. The conclusion of this research indicates that the Decision Tree (DT) algorithm performs slightly better than K-Nearest Neighbor (K-NN) in detecting malicious packets. Therefore, in selecting an algorithm for network security detection, it is important to consider the specific needs and goals of the research as well as the characteristics of the data used.
Klasifikasi Tingkat Stress pada Mahasiswa Teknik Informatika dalam Melakukan Perkuliahan Metode Hybrid Menggunakan Algoritma Naive Bayes Susanti, Lia
STRING (Satuan Tulisan Riset dan Inovasi Teknologi) Vol 8, No 3 (2024)
Publisher : Universitas Indraprasta PGRI Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30998/string.v8i3.17096

Abstract

Page 2 of 2 | Total Record : 14

 1   2 

Filter by Year

2024 2024


Reset
Filter By Issues
All Issue Vol 10, No 1 (2025) Vol 9, No 3 (2025) Vol 9, No 2 (2024) Vol 9, No 1 (2024) Vol 8, No 3 (2024) Vol 8, No 2 (2023) Vol 8, No 1 (2023) Vol 7, No 3 (2023) Vol 7, No 2 (2022) Vol 7, No 1 (2022) Vol 6, No 3 (2022) Vol 6, No 2 (2021) Vol 6, No 1 (2021) Vol 5, No 3 (2021) Vol 5, No 2 (2020) Vol 5, No 1 (2020) Vol 4, No 3 (2020) Vol 4, No 2 (2019) Vol 4, No 1 (2019) Vol 3, No 3 (2019) Vol 3, No 2 (2018) Vol 3, No 1 (2018) Vol 2, No 3 (2018) Vol 2, No 2 (2017) Vol 2, No 1 (2017) Vol 1, No 3 (2017) Vol 1, No 2 (2016) Vol 1, No 1 (2016) More Issue