cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
jurnal@if.uinsgd.ac.id
Editorial Address
Gedung Fakultas Sains dan Teknologi Lt. 4 Jurusan Teknik Informatika Jl. A.H. Nasution No. 105 Cibiru Bandung 40614 Telp. (022) 7800525 / Fax (022) 7803936 Email : jurnal@if.uinsgd.ac.id
Location
Kota bandung,
Jawa barat
INDONESIA
JOIN (Jurnal Online Informatika)
Published by Universitas Islam Negeri Sunan Gunung Djati Bandung
ISSN : 25281682     EISSN : 25279165     DOI : 10.15575/join
Core Subject : Science,
Computer Science & IT
JOIN (Jurnal Online Informatika) is a scientific journal published by the Department of Informatics UIN Sunan Gunung Djati Bandung. This journal contains scientific papers from Academics, Researchers, and Practitioners about research on informatics. JOIN (Jurnal Online Informatika) is published twice a year in June and December. The paper is an original script and has a research base on Informatics.
Arjuna Subject : -
Articles 30 Documents
 1   2   3 
Search results for , issue "Vol 6 No 1 (2021)" : 30 Documents clear
Location Selection Query in Google Maps using Voronoi-based Spatial Skyline (VS2) Algorithm Annisa, Annisa; Angraeni, Leni
JOIN (Jurnal Online Informatika) Vol 6 No 1 (2021)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v6i1.667

Abstract

Google Maps is one of the popular location selection systems. One of the popular features of Google Maps is nearby search. For example, someone who wants to find the closest restaurants to his location can use the nearby search feature. This feature only considers one specific location in providing the desired place choice. In a real-world situation, there may be a need to consider more than one location in selecting the desired place. Assume someone would like to choose a hotel close to the conference hall, the museum, beach, and souvenir store. In this situation, nearby search feature in Google Maps may not be able to suggest a list of hotels that are interesting for him based on the distance from each destination places. In this paper, we have successfully developed a web-based application of Google Maps search using Voronoi-based Spatial Skyline (VS2) algorithm to choose some Point Of Interest (POI) from Google Maps as their considered locations to select desired place. We used Google Maps API to provide POI information for our web-based application. The experiment result showed that the execution time increases while the number of considered location increases.
Sentiment Analysis about Large-Scale Social Restrictions in Social Media Twitter Using Algoritm K-Nearest Neighbor Romli, Ikhsan; Prameswari R, Shanti; Kamalia, Antika Zahrotul
JOIN (Jurnal Online Informatika) Vol 6 No 1 (2021)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v6i1.670

Abstract

Sentiment analysis is a data processing to recognize topics that people talk about and their sentiments toward the topics, one of which in this study is about large-scale social restrictions (PSBB). This study aims to classify negative and positive sentiments by applying the K-Nearest Neighbor algorithm to see the accuracy value of 3 types of distance calculation which are cosine similarity, euclidean, and manhattan distance for Indonesian language tweets about large-scale social restrictions (PSBB) from social media twitter. With the results obtained, the K-Nearest Neighbor accuracy by the Cosine Similarity distance 82% at k = 3, K-Nearest Neighbor by the Euclidean Distance with an accuracy of 81% at k = 11 and K-Nearest Neighbor by Manhattan Distance with an accuracy 80% at k = 5, 7, 9, 11, and 13. So, in this study the K-Nearest Neighbor algorithm with the Cosine Similarity Distance calculation gets the highest point.
Computer Networks Optimization using Load Balancing Algorithms on the Citrix ADC Virtual Server Ramadhan, Hardiyan Kesuma; Wardhana, Sukma
JOIN (Jurnal Online Informatika) Vol 6 No 1 (2021)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v6i1.672

Abstract

In the digital era and the outbreak of the COVID-19 pandemic, all activities are online. If the number of users accessing the server exceeds IT infrastructure, server down occurs. A load balancer device is required to share the traffic request load. This study compares four algorithms on Citrix ADC VPX load balancer: round-robin, least connection, least response time and least packet using GNS3. The results of testing response time and throughput parameters show that the least connection algorithm is superior. There were a 33% reduction in response time and a 53% increase in throughput. In the service hits parameter, the round-robin algorithm has the evenest traffic distribution. While least packet superior in CPU utilization with 76% reduction. So algorithm with the best response time and throughput is the least connection. The algorithm with the best service hits is round-robin. Large scale implementation is recommended using the least connection algorithm regarding response time and throughput. When emphasizing evenest distribution, use a round-robin algorithm.
The Importance of Computational Thinking to Train Structured Thinking in Problem Solving Andrian, Rian; Hikmawan, Rizki
JOIN (Jurnal Online Informatika) Vol 6 No 1 (2021)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v6i1.677

Abstract

Ability to do problem solving will be greatly influenced by how the flow of thinking in decomposing a problem until it finds the root of the problem so that it can determine the best solution. There is currently a growing recognition around the world that all fields require a prerequisite ability, namely to think logically, in a structured manner, and use computational tools to rapidly model and visualize data. This ability is known as Computational Thinking (CT). In this study, the author applied the computational thinking key concept in a case study to train structured thinking in problem solving. Computational thinking key concept includes Decomposition, Pattern recognition, Abstraction, and lastly use algorithms when they design simple steps to solve problems. Based on our case study that has been model, the result shows us that Computational Thinking can be used to train structured thinking in problem solving in everyday life
Organization Cybernetics for Railway Supplier Selection Jayakrishnan, Mailasan; Mohamad, Abdul Karim; Mohd Yusof, Mokhtar
JOIN (Jurnal Online Informatika) Vol 6 No 1 (2021)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v6i1.689

Abstract

The comprehensive stimulation for this research arises from the necessity to continually understand and investigate the Information System (IS) discipline body of knowledge from organizational practice. Specifically, in this study, we focus on comparing a few available excellence frameworks, data analytics, and cybernetics approaches. Such knowledge and skill practice in the IS field is predominant for both IS research and teaching. On the other hand, to propose a relevant performance reporting model using data analytics and cybernetics that entail a body of knowledge and skill is crucial for the development and transformation of organizational excellence. Yet, it helps to design an online real-time organizational dashboard that produces knowledge for its application and decision-making within an organizational practice. IS discipline in an organization is comparatively young and its specification in academia as well as in practice is rapidly changing, we focus on the practical design, and IS structure for organizational excellence through employing information technologies.
A Fast Dynamic Assignment Algorithm for Solving Resource Allocation Problems Amalia, Ivanda Zevi; Saikhu, Ahmad; Soelaiman, Rully
JOIN (Jurnal Online Informatika) Vol 6 No 1 (2021)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v6i1.692

Abstract

The assignment problem is one of the fundamental problems in the field of combinatorial optimization. The Hungarian algorithm can be developed to solve various assignment problems according to each criterion. The assignment problem that is solved in this paper is a dynamic assignment to find the maximum weight on the resource allocation problems. The dynamic characteristic lies in the weight change that can occur after the optimal solution is obtained. The Hungarian algorithm can be used directly, but the initialization process must be done from the beginning every time a change occurs. The solution becomes ineffective because it takes up a lot of time and memory. This paper proposed a fast dynamic assignment algorithm based on the Hungarian algorithm. The proposed algorithm is able to obtain an optimal solution without performing the initialization process from the beginning. Based on the test results, the proposed algorithm has an average time of 0.146 s and an average memory of 4.62 M. While the Hungarian algorithm has an average time of 2.806 s and an average memory of 4.65 M. The fast dynamic assignment algorithm is influenced linearly by the number of change operations and quadratically by the number of vertices.
Usability of Jawara Sains Mobile Learning Application Using System Usability Scale (SUS) Suharsih, Ririn; Febriani, Rinanda; Triputra, Sutadi
JOIN (Jurnal Online Informatika) Vol 6 No 1 (2021)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v6i1.700

Abstract

The application of interactive learning multimedia is one of the factors that impact the learning process for achieving learning outcomes. In developing a mobile application, the main principle is usability. This research goal is to presents a usability evaluation of the Jawara Sains, which is a mobile application to learn science subjects. This research used a System Usability Scale (SUS) questionnaire to measure the level of users’ perceived usability. This score can indicate the usability performance of effectiveness, efficiency, and ease of use. Jawara Sains's SUS score achieved 75.45, which indicates a B grade, acceptable, and categorized in the good range. This score can also indicate whether a user is a promoter or not. The analysis showed that the Jawara Sains is categorized into the passive Net Promoter Score (NPS), which means users will not influence other people. Therefore, recommendations are needed for its usability improvements.
Prediction System for Problem Students using k-Nearest Neighbor and Strength and Difficulties Questionnaire Kurniadi, Dede; Mulyani, Asri; Muliana, Inda
JOIN (Jurnal Online Informatika) Vol 6 No 1 (2021)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v6i1.701

Abstract

The student counseling process is the spearhead of character development proclaimed by the government through education regulation number 20 of 2018 concerning strengthening character education. Counseling at the secondary school level carries out to attend to these problems that might resolve with a decision support system. So that makes research challenging to measure completion on target because it is not doing based on data. The counseling teacher does not know about student's mental and emotional health conditions, so it is often wrong to handle them. Therefore, we need a system that can recognize conditions and provide recommendations for managing problems and predicting students who have potential issues. The Algorithm used to predict problem students is K-Nearest Neighbor with a dataset of 100 students. The stages of predictive calculation are data collection, data cleaning, simulation, and accuracy evaluation. Meanwhile, building the system is done using the rapid application development methodology where the instrument used to map the student's condition is the Strenght and Difficulties Questionaire instrument. This research is a system to predict problem students with an accuracy rate of 83%. The level of user experience based on the User Experience Questionnaire (UEQ) results in the conclusion that the system reaches "Above Average.". This system is expecting to help counseling teachers implement an early warning system, help students know learning modalities, and help parents recognize the child's personality better.
Identification of White Blood Cells Using Machine Learning Classification Based on Feature Extraction Musliman, Anwar Siswanto; Fadlil, Abdul; Yudhana, Anton
JOIN (Jurnal Online Informatika) Vol 6 No 1 (2021)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v6i1.704

Abstract

In various disease diagnoses, one of the parameters is white blood cells, consisting of eosinophils, basophils, neutrophils, lymphocytes, and monocytes. Manual identification takes a long time and tends to be subjective depending on the staff's experience, so the automatic identification of white blood cells will be faster and more accurate. White blood cells are identified by examining a colored blood smear (SADT) and examined under a digital microscope to obtain a cell image. Image identification of white blood cells is determined through HSV color space segmentation (Hue, Saturation Value) and feature extraction of the Gray Level Cooccurrence Matrix (GLCM) method using the Angular Second Moment (ASM), Contrast, Entropy, and Inverse Different Moment (IDM) features. The purpose of this study was to identify white blood cells by comparing the classification accuracy of the K-nearest neighbor (KNN), Naïve Bayes Classification (NBC), and Multilayer Perceptron (MLP) methods. The classification results of 100 training data and 50 white blood cell image testing data. Tests on the KNN, NBC, and MLP methods yielded an accuracy of 82%, 80%, and 94%, respectively. Therefore, MLP was chosen as the best classification model in the identification of white blood cells.
Comparison of Machine Learning Classification Methods in Hepatitis C Virus Syafa’ah, Lailis; Zulfatman, Zulfatman; Pakaya, Ilham; Lestandy, Merinda
JOIN (Jurnal Online Informatika) Vol 6 No 1 (2021)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v6i1.719

Abstract

The hepatitis C virus (HCV) is considered a problem to the health of societies are the main. There are around 120-130 million or 3% of the world's total population infected with HCV. Without treatment, most major infectious acute evolve into chronic, followed by diseases liver, such as cirrhosis and cancer liver. The data parameters used in this study included albumin (ALB), bilirubin (BIL), choline esterase (CHE), -glutamyl-transferase (GGT), aspartate amino-transferase (AST), alanine amino-transferase (ALT), cholesterol (CHOL), creatinine (CREA), protein (PROT), and Alkaline phosphatase (ALP). This research proposes a methodology based on machine learning classification methods including k-nearest neighbors, naïve Bayes, neural network, and random forest. The aim of this study is to assess and evaluate the level of accuracy using the algorithm classification machine learning to detect the disease HCV. The result show that the accuracy of the method NN has a value of accuracy are high, namely at 95.12% compared to the method KNN, naïve Bayes and RF in a row amounted to 89.43%, 90.24%, and 94.31%.

Page 3 of 3 | Total Record : 30

 1   2   3 

Filter by Year

2021 2021


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