cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Aji Prasetya Wibawa
Contact Email
keds.journal@um.ac.id
Phone
+62818539333
Journal Mail Official
keds.journal@um.ac.id
Editorial Address
Semarang St. No. 5, Malang, East Java, 65145, Indonesia
Location
Kota malang,
Jawa timur
INDONESIA
Knowledge Engineering and Data Science
Published by Universitas Negeri Malang
ISSN : -     EISSN : 25974637     DOI : http://dx.doi.org/2597-4637
Core Subject : Science, Engineering,
Computer Science & IT Engineering
The journal welcomes experimental and theoretical findings on data science and knowledge engineering along with their applications to real-life situations.
Arjuna Subject : Ilmu Komputer (semua kategori) - Sistem Informasi
Articles 117 Documents
 1   2   3   4   5 
Comparison of Indonesian Imports Forecastingby Limited Period using SARIMA Method Ar Rosyid, Harits; Aniendya, Mutyara Whening; Herwanto, Heru Wahyu
Knowledge Engineering and Data Science
Publisher : citeus

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The development of Indonesia's imports fluctuate over years. Inability to anticipate such rapid changes can cause economic slump due to inappropriate policy. For instance, recent years imports in rice led to the extermination of rice reserves. The reason is to maintain the market price of rice in Indonesia. To overcome these changes, forecasting the amount of imports should assist the Government in determining the optimum policy. This can be done by utilizing an algorithm to forecast time series data, in this case the amount of imports in the next few months with a high degree of accuracy. This study uses data obtained from the official website of the Indonesian Ministry of Trade. Then, Seasonal Autoregressive Integrated Moving Average (SARIMA) method is applied to forecast the imports. This method is suitable for the interconnected dependent variables, as well as in forecasting seasonal data patterns. The results of the experiment showed that 6-period forecast is the most accurate results compared to forecasting by 16 and 24 periods. The research resulted in the best model, that is ARIMA (0, 1, 3)(0, 1, 1)12 produces forecasting with a MAPE value of 7.210 % or an accuracy rate of 92.790 %. By applying this imports forecast model, the government can have a forward strategic plans such as selectively imports products and carefully decide the amount of the incoming products to Indonesia. Hence, it could maintain or improve the economic condition where local businesses can grow confidently.
Flood Prediction using Artificial Neural Networks: Empirical Evidence from Mauritius as a Case Study Dhunny, A. Z.; Seebocus, Reena H.; Allam, Z.; Chuttur, Mohammad Yasser
Knowledge Engineering and Data Science
Publisher : citeus

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Artificial Neural Networks (ANN) has been well studied for flood prediction. However, there is not enough empirical evidence to generalize ANN applicability to small countries with microclimates prevailing in a small geographical space. In this paper, we focus on the climatic conditions of Mauritius for which we seek to investigate the accuracy of using ANN to predict flooding using locally collected data from 11 meteorological stations spread across the country. The ANN model for flood prediction presented in this work is trained using 20,000 climate data records, collected over a period of two years for Mauritius. Our input climate features are minimum temperature, maximum temperature, rainfall and humidity and our output decision is „flood‟ or „no flood‟. Using ANN, we achieved an accuracy of 98% for flood prediction and hence, we conclude that ANN is indeed a good predictor for flood occurrence even for regions with predominantly microclimatic conditions.
Parallelization of Partitioning Around Medoids (PAM) in K-Medoids Clustering on GPU Prahara, Adhi; Ismi, Dewi Pramudi; Azhari, Ahmad
Knowledge Engineering and Data Science
Publisher : citeus

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

K-medoids clustering is categorized as partitional clustering. K-medoids offers better result when dealing with outliers and arbitrary distance metric also in the situation when the mean or median does not exist within data. However, k-medoids suffers a high computational complexity. Partitioning Around Medoids (PAM) has been developed to improve k-medoids clustering, consists of build and swap steps and uses the entire dataset to find the best potential medoids. Thus, PAM produces better medoids than other algorithms. This research proposes the parallelization of PAM in k-medoids clustering on GPU to reduce computational time at the swap step of PAM. The parallelization scheme utilizes shared memory, reduction algorithm, and optimization of the thread block configuration to maximize the occupancy. Based on the experiment result, the proposed parallelized PAM k-medoids is faster than CPU and Matlab implementation and efficient for large dataset.
Query Rewriting with Thesaurus-Based for Handling Semantic Heterogeneity in Database Integration Nugroho, I Made Riyan Adi; Sentana, I Wayan Budi
Knowledge Engineering and Data Science
Publisher : citeus

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Nowadays, studies on handling semantic heterogeneity still become a challenge for researcher. Several methods have been used to solve these problems, one of which is query rewriting, implemented by rewriting a query into the latest one by using the selected schema. Semantic query rewriting needs a framework in order to identify the connection through the data schema sources. This line is used as a basis for scheme selection. Also, ontology is a model which often be used in these specific cases. The lack of ontology becomes a significant problem that usually seen. Therefore, this paper will describe an alternative framework in order to identify the link of semantic, which assisted by thesaurus.
Earthquake Magnitude and Grid-Based Location Prediction using Backpropagation Neural Network Priambodo, Bagus; Mahmudy, Wayan Firdaus; Rahman, Muh Arif
Knowledge Engineering and Data Science
Publisher : citeus

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Earthquakes, a type of inevitable natural disaster, is responsible for the highest average death toll per year compared to other types of a natural disaster. Even though it is inevitable, but it can be anticipated to minimize damage and casualties, such as predicting the earthquake‘s magnitude using a neural network. In this study, a backpropagation algorithm is used to train the multilayer neural network to weekly predict the average magnitude of earthquakes in grid-based locations in Indonesia. Based on the findings in this research, the neural network is able to predict the magnitude of earthquakes in grid-based locations across Indonesia with a minimum error rate of 0.094 in 34.475 seconds. This best result is achieved when the neural network is trained for 210 epochs, with 16 neurons used in the input and output layer, one hidden layer consisted of 5 neurons and a learning rate of 0.1. This result showed backpropagation has pretty good generalization capability in order to map the relations between variables when mathematical function is not explicitly available.
Efficient Scheduling of Plantation Company Workers using Genetic Algorithm Mahmudy, Wayan Firdaus; Pardede, Andreas; Widodo, Agus Wahyu; Rahman, Muh Arif
Knowledge Engineering and Data Science
Publisher : citeus

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Workers at large plantation companies have various activities. These activities include caring for plants, regularly applying fertilizers according to schedule, and crop harvesting activities. The density of worker activities must be balanced with efficient and fair work scheduling. A good schedule will minimize worker dissatisfaction while also maintaining their physical health. This study aims to optimize workers' schedules using a genetic algorithm. An efficient chromosome representation is designed to produce a good schedule in a reasonable amount of time. The mutation method is used in combination with reciprocal mutation and exchange mutation, while the type of crossover used is one cut point, and the selection method is elitism selection. A set of computational experiments is carried out to determine the best parameters’ value of the genetic algorithm. The final result is a better 30 days worker schedule compare to the previous schedule that was produced manually.
A Review of Accessing Big Data with Significant Ontologies Sleeman, Jumah Y.J; Hammad, Jehad A.H
Knowledge Engineering and Data Science
Publisher : citeus

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Ontology Based Data Access (OBDA) is a recently proposed approach which is able to provide a conceptual view on relational data sources. It addresses the problem of the direct access to big data through providing end-users with an ontology that goes between users and sources in which the ontology is connected to the data via mappings. We introduced the languages used to represent the ontologies and the mapping assertions technique that derived the query answering from sources. Query answering is divided into two steps: (i) Ontology rewriting, in which the query is rewritten with respect to the ontology into new query; (ii) mapping rewriting the query that obtained from previous step reformulating it over the data sources using mapping assertions. In this survey, we aim to study the earlier works done by other researchers in the fields of ontology, mapping and query answering over data sources.
Simple Modification for an Apriori Algorithm with Combination Reduction and Iteration Limitation Technique Gama, Adie Wahyudi Oktavia; Widnyani, Ni Made
Knowledge Engineering and Data Science
Publisher : citeus

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Apriori algorithm is one of the methods with regard to association rules in data mining. This algorithm uses knowledge from an itemset previously formed with frequent occurrence frequencies to form the next itemset. An a priori algorithm generates a combination by iteration methods that are using repeated database scanning process, pairing one product with another product and then recording the number of occurrences of the combination with the minimum limit of support and confidence values. The a priori algorithm will slow down to an expanding database in the process of finding frequent itemset to form association rules. Modification techniques are needed to optimize the performance of a priori algorithms so as to get frequent itemset and to form association rules in a short time. Modifications in this study are obtained by using techniques combination reduction and iteration limitation. Testing is done by comparing the time and quality of the rules formed from the database scanning using a priori algorithms with and without modification. The results of the test show that the modified a priori algorithm tested with data samples of up to 500 transactions is proven to form rules faster with quality rules that are maintained.
Segmentation Method for Face Modelling in Thermal Images Albar, Albar; Hendrick, Hendrick; Hidayat, Rahmat
Knowledge Engineering and Data Science
Publisher : citeus

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Face detection is mostly applied in RGB images. The object detection usually applied the Deep Learning method for model creation. One method face spoofing is by using a thermal camera. The famous object detection methods are Yolo, Fast Region Based Convolutional Neural Networks (RCNN), Faster RCNN, SSD, and Mask RCNN. We proposed a segmentation Mask RCNN method to create a face model from thermal images. This model was able to locate the face area in images. The dataset was established using 1600 images. The images were created from direct capturing and collecting from the online dataset. The Mask RCNN was configured to train with 5 epochs and 131 iterations. The final model predicted and located the face correctly using the test image.
Convolutional Neural Network on Tanned and Synthetic Leather Textures Faiz, Faadihilah Ahnaf; Azhari, Ahmad
Knowledge Engineering and Data Science
Publisher : citeus

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Tanned leather is an output from complex processes called tanning. Leather tanning is an important step that used to protect the fiber or protein structure of animal’s skin. Another reason of tanning process is to prevent the animal’s skin from any defect or rot. After the tanning is complete, the leather can be applied to produce a wide variety of leather products. Thus, the leather prices usually more expensive because it takes longer time in process. Another way to get cheaper price is make non-animal leather that usually known as synthetic or imitation leather. The purpose of this paper is to classify the tanned leather and synthetic leather by using Convolutional Neural Network (CNN). The tanned leather consist of cow, goat and sheep leathers. The proposed method will classify into four class, they are cow, goat, sheep and synthetic leathers. This research consist of 1280 training data with 448×448 pixels size as the input. With CNN method, this research shows a good result for the accuracy about 92.1%.

Page 3 of 12 | Total Record : 117

 1   2   3   4   5 

Filter by Year

2018 2025


Reset
Filter By Issues
All Issue