cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Aji Prasetya Wibawa
Contact Email
aji.prasetya.ft@um.ac.id
Phone
+62818539333
Journal Mail Official
keds.journal@um.ac.id
Editorial Address
Gedung G4. Lantai 1 Jl. Semarang No.5, Malang
Location
Kota malang,
Jawa timur
INDONESIA
Knowledge Engineering and Data Science
Published by Universitas Negeri Malang
ISSN : -     EISSN : 25974637     DOI : http://dx.doi.org/10.17977
Core Subject : Science, Engineering,
Computer Science & IT Engineering
Knowledge Engineering and Data Science (2597-4637), KEDS, brings together researchers, industry practitioners, and potential users, to promote collaborations, exchange ideas and practices, discuss new opportunities, and investigate analytics frameworks on data-driven and knowledge base systems.
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 9 Documents
 1 
Search results for , issue "Vol 6, No 1 (2023)" : 9 Documents clear
Ant Colony Optimization for Resistor Color Code Detection Slamet Wibawanto; Kartika Candra Kirana; Hani Ramadhan
Knowledge Engineering and Data Science Vol 6, No 1 (2023)
Publisher : Universitas Negeri Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um018v6i12023p15-23

Abstract

In the early stages of learning resistors, introducing color-based values is needed. Moreover, some combinations require a resistor trip analysis to identify. Unfortunately, a resistor body color is considered a local solution, which often confuses resistor coloration. Ant Colony Optimization (ACO) is a heuristic algorithm that can recognize problems with traveling a group of ants. ACO is proposed to select commercial matrix values to be computed without preventing local solutions. In this study, each explores the matrix based on pheromones and heuristic information to generate local solutions. Global solutions are selected based on their high degree of similarity with other local solutions. The first stage of testing focuses on exploring variations of parameter values. Applying the best parameters resulted in 85% accuracy and 43 seconds for 20 resistor images. This method is expected to prevent local solutions without wasteful computation of the matrix.
Inter-Frame Video Compression based on Adaptive Fuzzy Inference System Compression of Multiple Frame Characteristics Arief Bramanto Wicaksono Putra; Rheo Malani; Bedi Suprapty; Achmad Fanany Onnilita Gaffar; Roman Voliansky
Knowledge Engineering and Data Science Vol 6, No 1 (2023)
Publisher : Universitas Negeri Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um018v6i12023p1-14

Abstract

Video compression is used for storage or bandwidth efficiency in clip video information. Video compression involves encoders and decoders. Video compression uses intra-frame, inter-frame, and block-based methods.  Video compression compresses nearby frame pairs into one compressed frame using inter-frame compression. This study defines odd and even neighboring frame pairings. Motion estimation, compensation, and frame difference underpin video compression methods. In this study, adaptive FIS (Fuzzy Inference System) compresses and decompresses each odd-even frame pair. First, adaptive FIS trained on all feature pairings of each odd-even frame pair. Video compression-decompression uses the taught adaptive FIS as a codec. The features utilized are "mean", "std (standard deviation)", "mad (mean absolute deviation)", and "mean (std)". This study uses all video frames' average DCT (Discrete Cosine Transform) components as a quality parameter. The adaptive FIS training feature and amount of odd-even frame pairings affect compression ratio variation. The proposed approach achieves CR=25.39% and P=80.13%. "Mean" performs best overall (P=87.15%). "Mean (mad)" has the best compression ratio (CR=24.68%) for storage efficiency. The "std" feature compresses the video without decompression since it has the lowest quality change (Q_dct=10.39%).
Exploring the Impact of Students Demographic Attributes on Performance Prediction through Binary Classification in the KDP Model Issah Iddrisu; Peter Appiahene; Obed Appiah; Inusah Fuseini
Knowledge Engineering and Data Science Vol 6, No 1 (2023)
Publisher : Universitas Negeri Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um018v6i12023p24-40

Abstract

During the course of this research, binary classification and the Knowledge Discovery Process (KDP) were used. The experimental and analytical capabilities of Rapid Miner's 9.10.010 instructional environment are supported by five different classifiers. Included in the analysis were 2334 entries, 17 characteristics, and one class variable containing the students' average score for the semester. There were twenty experiments carried out. During the studies, 10-fold cross-validation and ratio split validation, together with bootstrap sampling, were used. It was determined whether or not to use the Random Forest (RF), Rule Induction (RI), Naive Bayes (NB), Logistic Regression (LR), or Deep Learning (DL) methods. RF outperformed the other four methods in all six selection measures, with an accuracy of 93.96%. According to the RF classifier model, the level of education that a child's parents have is a major factor in that child's academic performance before entering higher education.
Long-Term Traffic Prediction Based on Stacked GCN Model Atkia Akila Karim; Naushin Nower
Knowledge Engineering and Data Science Vol 6, No 1 (2023)
Publisher : Universitas Negeri Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um018v6i12023p92-102

Abstract

With the recent surge in road traffic within major cities, the need for both short and long-term traffic flow forecasting has become paramount for city authorities. Previous research efforts have predominantly focused on short-term traffic flow estimations for specific road segments and paths. However, applications of paramount importance, such as traffic management and schedule routing planning, demand a deep understanding of long-term traffic flow predictions. However, due to the intricate interplay of underlying factors, there exists a scarcity of studies dedicated to long-term traffic prediction. Previous research has also highlighted the challenge of lower accuracy in long-term predictions owing to error propagation within the model. This model effectively combines Graph Convolutional Network (GCN) capacity to extract spatial characteristics from the road network with the stacked GCN aptitude for capturing temporal context. Our developed model is subsequently employed for traffic flow forecasting within urban road networks. We rigorously compare our method against baseline techniques using two real-world datasets. Our approach significantly reduces prediction errors by 40% to 60% compared to other methods. The experimental results underscore our model's ability to uncover spatiotemporal dependencies within traffic data and its superior predictive performance over baseline models using real-world traffic datasets.
Deep Learning for Multi-Structured Javanese Gamelan Note Generator Arik Kurniawati; Eko Mulyanto Yuniarno; Yoyon Kusnendar Suprapto
Knowledge Engineering and Data Science Vol 6, No 1 (2023)
Publisher : Universitas Negeri Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um018v6i12023p41-56

Abstract

Javanese gamelan, a traditional Indonesian musical style, has several song structures called gendhing. Gendhing (songs) are written in conventional notation and require gamelan musicians to recognize patterns in the structure of each song. Usually, previous research on gendhing focuses on artistic and ethnomusicological perspectives, but this study is to explore the correlation between gendhing as traditional music in Indonesia and deep learning technology that replaces the task of gamelan composers. This research proposes CNN-LSTM to generate notation of ricikan struktural instruments as an accompaniment to Javanese gamelan music compositions based on balungan notation, rhythm, song structure, and gatra information. This proposed method (CNN-LSTM) is compared with LSTM and CNN. The musical data in this study is represented using numerical notation for the main melody in balungan notation. The experimental results showed that the CNN-LSTM model showed better performance compared to the LSTM and CNN models, with accuracy values of 91.9%, 91.5%, and 91.2% for CNN-LSTM, LSTM, and CNN, respectively. And the value of note distance for the Sampak song structure is 4 for the CNN-LSTM model, 8 for the LSTM model, and 12 for the CNN model. The smaller the note distance, the closer it is to the original notation provided by the gamelan composer. This study provides relevance for novice gamelan musicians who are interested in learning karawitan, especially in understanding ricikan struktural music notation and gamelan art in composing musical compositions of a song.
Optimizing Random Forest Algorithm to Classify Player's Memorisation via In-game Data Akmal Vrisna Alzuhdi; Harits Ar Rosyid; Mohammad Yasser Chuttur; Shah Nazir
Knowledge Engineering and Data Science Vol 6, No 1 (2023)
Publisher : Universitas Negeri Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um018v6i12023p103-113

Abstract

Assessment of a player's knowledge in game education has been around for some time. Traditional evaluation in and around a gaming session may disrupt the players' immersion. This research uses an optimized Random Forest to construct a non-invasive prediction of a game education player's Memorization via in-game data. Firstly, we obtained the dataset from a 3-month survey to record in-game data of 50 players who play 4-15 game stages of the Chem Fight (a test case game). Next, we generated three variants of datasets via the preprocessing stages: resampling method (SMOTE), normalization (min-max), and a combination of resampling and normalization. Then, we trained and optimized three Random Forest (RF) classifiers to predict the player's Memorization. We chose RF because it can generalize well given the high-dimensional dataset. We used RF as the classifier, subject to optimization using its hyperparameter: n_estimators. We implemented a Grid Search Cross Validation (GSCV) method to identify the best value of  n_estimators. We utilized the statistics of GSCV results to reduce the weight of  n_estimators by observing the region of interest shown by the graphs of performances of the classifiers. Overall, the classifiers fitted using the BEST n_estimators (i.e., 89, 31, 89, and 196 trees) from GSCV performed well with around 80% accuracy. Moreover, we successfully identified the smaller number of n_estimators (OPTIMAL), at least halved the BEST  n_estimators. All classifiers were retrained using the OPTIMAL  n_estimators (37, 12, 37, and 41 trees). We found out that the performances of the classifiers were relatively steady at ~80%. This means that we successfully optimized the Random Forest in predicting a player's Memorization when playing the Chem Fight game. An automated technique presented in this paper can monitor student interactions and evaluate their abilities based on in-game data. As such, it can offer objective data about the skills used.
Maximum Marginal Relevance and Vector Space Model for Summarizing Students' Final Project Abstracts Gunawan Gunawan; Fitria Fitria; Esther Irawati Setiawan; Kimiya Fujisawa
Knowledge Engineering and Data Science Vol 6, No 1 (2023)
Publisher : Universitas Negeri Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um018v6i12023p57-68

Abstract

Automatic summarization is reducing a text document with a computer program to create a summary that retains the essential parts of the original document. Automatic summarization is necessary to deal with information overload, and the amount of data is increasing. A summary is needed to get the contents of the article briefly. A summary is an effective way to present extended information in a concise form of the main contents of an article, and the aim is to tell the reader the essence of a central idea. The simple concept of a summary is to take an essential part of the entire contents of the article. Which then presents it back in summary form. The steps in this research will start with the user selecting or searching for text documents that will be summarized with keywords in the abstract as a query. The proposed approach performs text preprocessing for documents: sentence breaking, case folding, word tokenizing, filtering, and stemming. The results of the preprocessed text are weighted by term frequency-inverse document frequency (tf-idf), then weighted for query relevance using the vector space model and sentence similarity using cosine similarity. The next stage is maximum marginal relevance for sentence extraction. The proposed approach provides comprehensive summarization compared with another approach. The test results are compared with manual summaries, which produce an average precision of 88%, recall of 61%, and f-measure of 70%.
K-Means Clustering and Multilayer Perceptron for Categorizing Student Business Groups Miftahul Walid; Norfiah Lailatin Nispi Sahbaniya; Hozairi Hozairi; Fajar Baskoro; Arya Yudhi Wijaya
Knowledge Engineering and Data Science Vol 6, No 1 (2023)
Publisher : Universitas Negeri Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um018v6i12023p69-78

Abstract

The research conducted in this study was driven by the East Java provincial government's requirement to assess the transaction levels of the Student Business Group (KUS) in the SMA Double Track program. These transaction levels are a basis for allocating supplementary financial aid to each business group. The system's primary objective is to assist the provincial government of East Java in making well-informed choices pertaining to the distribution of supplementary capital to the KUS. The classification technique employed in this study is the multilayer perceptron. However, the K-Means Clustering method is utilised to generate target data due to the limited availability during the classification process, which involves dividing the transaction level attributes into three distinct groups: (0) low transactions, (1) medium transactions, and (2) high transactions. The clustering process encompasses three distinct features: (1) income, (2) spending, and (3) profit. These three traits will be utilized as input data throughout the categorization procedure. The classification procedure employing the Multilayer Perceptron technique involved processing a dataset including 1383 data points. The training data constituted 80% of the dataset, while the remaining 20% was allocated for testing. In order to evaluate the efficacy of the constructed model, the training error was assessed using K-Fold cross-validation, yielding an average accuracy score of 0.92. In the present study, the categorization technique yielded an accuracy of 0.96. This model aims to classify scenarios when the dataset lacks prior target data.
Round-Robin Algorithm in Load Balancing for National Data Centers I Kadek Wahyu Sudiatmika; Gede Indrawan; Sariyasa Sariyasa
Knowledge Engineering and Data Science Vol 6, No 1 (2023)
Publisher : Universitas Negeri Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um018v6i12023p79-91

Abstract

The Provincial Government of Bali assumes a crucial role in administering various public service applications to meet the requirements of its community, traditional villages, and regional apparatus. Nevertheless, the escalating magnitude of traffic and uneven distribution of requests have resulted in substantial server burdens, which may jeopardize the operation of applications and heighten the likelihood of downtime. Ensuring efficient load distribution is of utmost importance in tackling these difficulties, and the Round Robin algorithm is often utilized for this purpose. However, the current body of research has not extensively examined the distinct circumstances surrounding on-premise servers in the Bali Provincial Government. The primary objective of this study is to address the significant gap in knowledge by conducting a comprehensive evaluation of the Round Robin algorithm's effectiveness in load-balancing on-premise servers inside the Bali Provincial Government. The primary objective of our study is to assess the appropriateness of the algorithm within the given context, with the ultimate goal of providing practical and implementable suggestions. The observations above can optimize system efficiency and minimize periods of inactivity, thereby enhancing the provision of vital public services across Bali. This study provides essential insights for enhancing server infrastructure and load-balancing strategies through empirical evaluation and comprehensive analysis. Its findings are valuable for the Bali Provincial Government and serve as a reference for other organizations facing challenges managing server loads. This study signifies a notable advancement in establishing reliable and practical public service applications within Bali.

Page 1 of 1 | Total Record : 9

 1 

Filter by Year

2023 2023


Reset
Filter By Issues
All Issue Vol 6, No 2 (2023) Vol 6, No 1 (2023) Vol 5, No 2 (2022) Vol 5, No 1 (2022) Vol 4, No 2 (2021) Vol 4, No 1 (2021) Vol 3, No 2 (2020) Vol 3, No 1 (2020) Vol 2, No 2 (2019) Vol 2, No 1 (2019) Vol 1, No 2 (2018) Vol 1, No 1 (2018) More Issue