cover
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
Indonesian Journal of Electrical Engineering and Computer Science
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 9,138 Documents
Performance evaluation of adaptive offloading model using hybrid machine learning and statistic prediction Siwoo Byun; Seok-Woo Jang; Joonho Byun
Indonesian Journal of Electrical Engineering and Computer Science Vol 34, No 1: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v34.i1.pp463-471

Abstract

We introduce fast sensor diagnosis and focuses on intelligent offloading skills to enhance the sensor data screening efficiency. This study proposed the adaptive offloading model based on statistics-based prediction feedback and sensor candidate filtering. For the statistics-based filtering, sliding sensor grids and compounded sensor context were devised. This study also proposed hybrid prediction model using support vector machine (SVM) and k-nearest neighbors (KNN) machine training for the adaptive offloading. Therefore, the sensor information that is highly likely to be the cause of the actual device faults can be selected and transmitted, resulting in improved offloading performance. The test results through Google Colab show that the fault prediction accuracy of proposed models is 95%.
Text document clustering using mayfly optimization algorithm with k-means technique Dodda, Ratnam; Babu, Alladi Suresh
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 2: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i2.pp1099-1109

Abstract

Text clustering is a subfield of machine learning (ML) and natural language processing (NLP) that consists of grouping similar sentences or documents based on their content. However, insignificant features in the documents minimize the accuracy of information retrieval which makes it challenging for the clustering approach to efficiently cluster similar documents. In this research, the mayfly optimization algorithm (MOA) with a k-means approach is proposed for text document clustering (TDC) to effectively cluster similar documents. Initially, the data is obtained from Reuters-21678, 20-Newsgroup, and BBC sports datasets, and then pre-processing is established by stemming and stop word removal to remove unwanted phrases or words. The data imbalance approach is established using an adaptive synthetic sampling algorithm (ADASYN), then term frequency-inverse document frequency (TD-IDF) and WordNet features are employed for extracting features. Finally, MOA with the K-means technique is utilized for TDC. The proposed approach achieves better accuracy of 99.75%, 99.54%, and 98.24% when compared to the existing techniques like fuzzy rough set-based robust nearest neighbor-convolutional neural network (FRS-RNN-CNN), TopicStriker, Modsup-based frequent itemset, and rider optimization-based moth search algorithm (Modsup-Rn-MSA), hierarchical dirichlet-multinomial mixture, and multi-view clustering via consistent and specific non-negative matrix (MCCS).
Revolutionization of augmented reality in tourism via deep learning Yasmin Chuupa Essa; Saumya Chaturvedi; Shiraz Khurana
Indonesian Journal of Electrical Engineering and Computer Science Vol 34, No 3: June 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v34.i3.pp2055-2064

Abstract

Tourism has become an integral part of social and economic development across the globe. It does not only serve as a recreational activity but also as a source of revenue for the nation. The paper systematically explores the potential enhancements in the tourist experience through cutting-edge technology. Employing deep learning methods, the study specifically concentrates on refining augmented reality encounters for visitors. The proposed approach utilizes deep learning algorithms to optimize and tailor tourists’ augmented reality experiences, addressing current sectoral challenges like customization and engagement shortcomings. The methodology’s selection is predicated on it is capability to elevate user experience, accurately identify objects, offer visual guided tours, integrate historical context, and ultimately propel augmented reality adoption in tourism. Notably, the investigation culminates in a noteworthy average accuracy of 99% when incorporating deep learning to enhance augmented reality in tourism.
Implementing generative adversarial networks for increasing performance of transmission fault classification Tilottama Goswami; Uponika Barman Roy; Deepthi Kalavala; Mukesh Kumar Tripathi
Indonesian Journal of Electrical Engineering and Computer Science Vol 34, No 2: May 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v34.i2.pp1024-1032

Abstract

An electrical power system is a network that facilitates the sourcing, transfer, and distribution of electrical energy. In the traditional power system, there are eleven types of faults that can occur in the system. This paper focuses on the classification of these faults over a stretch of 100 kilometres. The dataset used is synthetic and generated from a simulated model using MATLAB/Simulink software. Data augmentation is carried out during training to improve the accuracy of the classification. An indirect training approach through generative adversarial network (GAN) is used to classify these overhead transmission line faults. The random forest (RF) classification is used as the base learning model on the original dataset and it achieves accuracy of 84%. However, the base learner RF when used on GAN model generated augmented faulty data, it performs exceptionally well achieving 99% accuracy. One of the recent state-of-art methods is compared with this approach.
Edge-platforms based decision-support approach for solar panels inspection with YOLOv8 deep neural-network El Karch, Hajar; Mezouari, Abdelkader; Natij, Youssef; El Gouri, Rachid
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 2: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i2.pp853-866

Abstract

This paper presents an innovative AI-based method for autonomous inspection, designed to enhance energy production efficiency by optimizing cleaning strategies for soiled photovoltaic panels, using advanced artificial intelligence algorithms to analyze panel conditions and environmental factors in real-time, allowing for targeted cleaning interventions. Based on the advanced YOLOv8 deep learning algorithm and computer vision approach, the proposed method offers distinct advantages in real-time detection and classification of various types of soiling and dust accumulation compared on solar panels to traditional methods, and underwent satisfactory testing across diverse scenarios. The NVIDIA Jetson Nano, the Raspberry Pi4 embedded devices, and the Raspberry Pi4 combined with NCS2 accelerator are used for implementing our approach. A comparison aims to provide a detailed exploration of the most suitable embedded platform for deploying our advanced system was discussed. This comparison considers processing speed and accuracy, energy consumption, and overall performance in executing the computationally intensive tasks. The results demonstrate that our model achieves high accuracy in detecting soiling and enhancing the model's detection speed. With an average precision of 99.5%, this approach ensures accurate fault identification, underscoring the effectiveness of computer vision using deep learning algorithms for detection tasks across a wide range of scenarios.
A hybrid data mining for predicting scholarship recipient students by combining K-means and C4.5 methods Halifia Hendri; Harkamsyah Andrianof; Riska Robianto; Hasri Awal; Okta Andrica Putra; Romi Wijaya; Aggy Pramana Gusman; Muhammad Hafizh; Muhammad Pondrinal
Indonesian Journal of Electrical Engineering and Computer Science Vol 33, No 3: March 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v33.i3.pp1726-1735

Abstract

This scholarly investigation delves into the strong desire for academic scholarships within the student body, especially prominent among socioeconomically disadvantaged individuals. The study aims to formulate a hybrid data mining paradigm by synergizing the K-means and C4.5 methodologies. K-means is applied for clusterization, while C4.5 facilitates prediction and decision tree instantiation. The research unfolds in sequential phases, commencing with data input and progressing through meticulous pre-processing, encompassing data selection, cleaning, and transformation. The novelty lies in successfully integrating the K-means and C4.5 methodologies, culminating in the hybrid data mining method. The dataset comprises 200 students seeking scholarships, revealing effective stratification into three clusters—cluster 0, cluster 1, and cluster 2—with 119, 48, and 33 students, respectively. The K-means method proves highly suitable, especially when combined with C4.5, for predicting scholarship recipients. A subset of 81 students from clusters 1 and 2 undergoes predictive modeling using C4.5, resulting in a commendable 85% accuracy, with 17 accurate forecasts and 3 minor inaccuracies. This research significantly enhances scholarship selection efficiency, particularly benefiting socioeconomically disadvantaged students.
A hybrid model for data visualization using linear algebra methods and machine learning algorithm Mohsin Ali; jitendra Choudhary; Tanmay Kasbe
Indonesian Journal of Electrical Engineering and Computer Science Vol 33, No 1: January 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v33.i1.pp463-475

Abstract

The t-distributed stochastic neighbor embedding (t-SNE) is a powerful technique for visualizing high-dimensional datasets. By reducing the dimensionality of the data, t-SNE transforms it into a format that can be more easily understood and analyzed. The existing approach is to visualize high-dimensional data but not deeply visualize. This paper proposes a model that enhances visualization and improves the accuracy. The proposed model combines the non-linear embedding technique t-SNE, the linear dimensionality reduction method principal component analysis (PCA), and the QR decomposition algorithm for discovering eigenvalues and eigenvectors. In Addition, we quantitatively compare the proposed model QRPCA-t-SNE with PCA-t-SNE using the following criteria: data visualization with different perplexity and different principal components, confusion matrix, model score, mean square error (MSE), training, testing accuracy, receiver operating characteristic curve (ROC) score, and AUC score.
Image classification based on few-shot learning algorithms: a review Qi, Qiao; Ahmad, Azlin; Ke, Wang
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 2: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i2.pp933-943

Abstract

Image classification is a critical task in the field of computer vision, and its importance has significantly increased over the past few years. Machine learning and deep learning techniques have demonstrated immense potential in this field. However, traditional image classification models require a vast amount of training data, which can be challenging and expensive to obtain. To overcome this limitation, researchers are turning to few-shot learning, which aims to classify images with limited training samples. This paper presents a detailed analysis of the field of image classification using few-shot learning. First, it investigates the use of data augmentation, transfer learning, and meta-learning methods in this field. Then, it introduces several commonly used datasets and evaluation metrics in few-shot classification, compares several classical few-shot classification methods, and summarizes the experimental results obtained from public datasets. Finally, this paper analyzes the current challenges in few-shot image classification and suggests potential future directions.
Enhancing learner performance prediction on online platforms using machine learning algorithms Jebbari, Mohammed; Cherradi, Bouchaib; Hamida, Soufiane; Ouassil, Mohamed Amine; El Harrouti, Taoufiq; Raihani, Abdelhadi
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 1: July 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i1.pp343-353

Abstract

E-learning has emerged as a prominent educational method, providing accessible and flexible learning opportunities to students worldwide. This study aims to comprehensively understand and categorize learner performance on e-learning platforms, facilitating timely support and interventions for improved academic outcomes. The proposed model utilizes various classifiers (random forest (RF), neural network (NN), decision tree (DT), support vector machine (SVM), and K-nearest neighbors (KNN)) to predict learner performance and classify students into three groups: fail, pass, and withdrawn. Commencing with an analysis of two distinct learning periods based on days elapsed (≤120 days and another exceeding 220 days), the study evaluates the classifiers’ efficacy in predicting learner performance. NN (82% to 96%) and DT (81%-99.5%) consistently demonstrate robust performance across all metrics. The classifiers exhibit significant performance improvement with increased data size, suggesting the benefits of sustained engagement in the learning platform. The results highlight the importance of selecting suitable algorithms, such as DT, to accurately assess learner performance. This enables educational platforms to proactively identify at-risk students and offer personalized support. Additionally, the study highlights the significance of prolonged platform usage in enhancing learner outcomes. These insights contribute to advancing our understanding of e-learning effectiveness and inform strategies for personalized educational interventions.
Blockchain-based key-value store to support dynamic smart contract interaction in the agricultural sector Irwansyah Saputra; Yandra Arkeman; Indra Jaya; Irman Hermadi; Indrajani Sutedja
Indonesian Journal of Electrical Engineering and Computer Science Vol 33, No 1: January 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v33.i1.pp622-633

Abstract

In the era of supply chain digitalization, adaptability and transparency are key to enhancing efficiency and trust. Although blockchain technology and smart contract offer innovative solutions, the limitations of static smart contract hinder their full potential. This article introduces a new approach using dynamic smart contract capable of managing various commodities in the supply chain with a key-value store. While this advantage provides flexibility, it still poses challenges in managing increasingly complex interactions among various actors, especially when the number of commodities increases. To address these challenges, this study introduces the concept of smart contract interaction that facilitates the automation and management of interactions with high efficiency. The implementation results show that smart contract interaction outperforms conventional approaches in terms of speed, resilience, and ease of management. Through the combination of dynamic smart contract and smart contract interaction, demonstrating how efficiency, transparency, adaptability, and scalability can be achieved in the supply chain, providing new insights into the utilization of blockchain technology for the modern industry.

Filter by Year

2012 2026


Filter By Issues
All Issue Vol 41, No 1: January 2026 Vol 40, No 3: December 2025 Vol 40, No 2: November 2025 Vol 40, No 1: October 2025 Vol 39, No 3: September 2025 Vol 39, No 2: August 2025 Vol 39, No 1: July 2025 Vol 38, No 3: June 2025 Vol 38, No 2: May 2025 Vol 38, No 1: April 2025 Vol 37, No 3: March 2025 Vol 37, No 2: February 2025 Vol 37, No 1: January 2025 Vol 36, No 3: December 2024 Vol 36, No 2: November 2024 Vol 36, No 1: October 2024 Vol 35, No 3: September 2024 Vol 35, No 2: August 2024 Vol 35, No 1: July 2024 Vol 34, No 3: June 2024 Vol 34, No 2: May 2024 Vol 34, No 1: April 2024 Vol 33, No 3: March 2024 Vol 33, No 2: February 2024 Vol 33, No 1: January 2024 Vol 32, No 3: December 2023 Vol 32, No 1: October 2023 Vol 31, No 3: September 2023 Vol 31, No 2: August 2023 Vol 31, No 1: July 2023 Vol 30, No 3: June 2023 Vol 30, No 2: May 2023 Vol 30, No 1: April 2023 Vol 29, No 3: March 2023 Vol 29, No 2: February 2023 Vol 29, No 1: January 2023 Vol 28, No 3: December 2022 Vol 28, No 2: November 2022 Vol 28, No 1: October 2022 Vol 27, No 3: September 2022 Vol 27, No 2: August 2022 Vol 27, No 1: July 2022 Vol 26, No 3: June 2022 Vol 26, No 2: May 2022 Vol 26, No 1: April 2022 Vol 25, No 3: March 2022 Vol 25, No 2: February 2022 Vol 25, No 1: January 2022 Vol 24, No 3: December 2021 Vol 24, No 2: November 2021 Vol 24, No 1: October 2021 Vol 23, No 3: September 2021 Vol 23, No 2: August 2021 Vol 23, No 1: July 2021 Vol 22, No 3: June 2021 Vol 22, No 2: May 2021 Vol 22, No 1: April 2021 Vol 21, No 3: March 2021 Vol 21, No 2: February 2021 Vol 21, No 1: January 2021 Vol 20, No 3: December 2020 Vol 20, No 2: November 2020 Vol 20, No 1: October 2020 Vol 19, No 3: September 2020 Vol 19, No 2: August 2020 Vol 19, No 1: July 2020 Vol 18, No 3: June 2020 Vol 18, No 2: May 2020 Vol 18, No 1: April 2020 Vol 17, No 3: March 2020 Vol 17, No 2: February 2020 Vol 17, No 1: January 2020 Vol 16, No 3: December 2019 Vol 16, No 2: November 2019 Vol 16, No 1: October 2019 Vol 15, No 3: September 2019 Vol 15, No 2: August 2019 Vol 15, No 1: July 2019 Vol 14, No 3: June 2019 Vol 14, No 2: May 2019 Vol 14, No 1: April 2019 Vol 13, No 3: March 2019 Vol 13, No 2: February 2019 Vol 13, No 1: January 2019 Vol 12, No 3: December 2018 Vol 12, No 2: November 2018 Vol 12, No 1: October 2018 Vol 11, No 3: September 2018 Vol 11, No 2: August 2018 Vol 11, No 1: July 2018 Vol 10, No 3: June 2018 Vol 10, No 2: May 2018 Vol 10, No 1: April 2018 Vol 9, No 3: March 2018 Vol 9, No 2: February 2018 Vol 9, No 1: January 2018 Vol 8, No 3: December 2017 Vol 8, No 2: November 2017 Vol 8, No 1: October 2017 Vol 7, No 3: September 2017 Vol 7, No 2: August 2017 Vol 7, No 1: July 2017 Vol 6, No 3: June 2017 Vol 6, No 2: May 2017 Vol 6, No 1: April 2017 Vol 5, No 3: March 2017 Vol 5, No 2: February 2017 Vol 5, No 1: January 2017 Vol 4, No 3: December 2016 Vol 4, No 2: November 2016 Vol 4, No 1: October 2016 Vol 3, No 3: September 2016 Vol 3, No 2: August 2016 Vol 3, No 1: July 2016 Vol 2, No 3: June 2016 Vol 2, No 2: May 2016 Vol 2, No 1: April 2016 Vol 1, No 3: March 2016 Vol 1, No 2: February 2016 Vol 1, No 1: January 2016 Vol 16, No 3: December 2015 Vol 16, No 2: November 2015 Vol 16, No 1: October 2015 Vol 15, No 3: September 2015 Vol 15, No 2: August 2015 Vol 15, No 1: July 2015 Vol 14, No 3: June 2015 Vol 14, No 2: May 2015 Vol 14, No 1: April 2015 Vol 13, No 3: March 2015 Vol 13, No 2: February 2015 Vol 13, No 1: January 2015 Vol 12, No 12: December 2014 Vol 12, No 11: November 2014 Vol 12, No 10: October 2014 Vol 12, No 9: September 2014 Vol 12, No 8: August 2014 Vol 12, No 7: July 2014 Vol 12, No 6: June 2014 Vol 12, No 5: May 2014 Vol 12, No 4: April 2014 Vol 12, No 3: March 2014 Vol 12, No 2: February 2014 Vol 12, No 1: January 2014 Vol 11, No 12: December 2013 Vol 11, No 11: November 2013 Vol 11, No 10: October 2013 Vol 11, No 9: September 2013 Vol 11, No 8: August 2013 Vol 11, No 7: July 2013 Vol 11, No 6: June 2013 Vol 11, No 5: May 2013 Vol 11, No 4: April 2013 Vol 11, No 3: March 2013 Vol 11, No 2: February 2013 Vol 11, No 1: January 2013 Vol 10, No 8: December 2012 Vol 10, No 7: November 2012 Vol 10, No 6: October 2012 Vol 10, No 5: September 2012 Vol 10, No 4: August 2012 Vol 10, No 3: July 2012 More Issue