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 65 Documents
Search results for , issue "Vol 38, No 2: May 2025" : 65 Documents clear
Investigation on TiO2/graphene as resistance-based gas sensor for volatile organic compound gases detection Mohd Chachuli, Siti Amaniah; Nor Azmi, Muhammad Haziq; Coban, Omer; Shamsudin, Nur Hazahsha
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 2: May 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i2.pp774-782

Abstract

Volatile organic compound (VOC) gases are usually produced from industrial activities. Short-term exposure to VOC gases can cause dizziness, headaches, nausea, and throat irritation. Years to a long time exposure to VOC gases can cause cancer and system damage in the human body. With the growth of gas sensor technology, a resistance-based gas sensor based on various structures of resistance-based gas sensors using Titanium dioxide/graphene (TiO2/graphene) were investigated as a sensing material for detecting volatile organic compound gases, which are acetone and ethanol. The TiO2/graphene gas sensor was deposited on a Kapton film using a screen printing technique. All TiO2/graphene gas sensors were exposed to acetone and ethanol at room operating temperature. The results revealed that the highest response values to acetone and ethanol were produced by T99_G1_2 and T98_G2_1, respectively. It can be concluded that design 1 generated the most consistent response to acetone, while design 2 generated the most consistent response to ethanol.
Exploring parents’ perceptions of sex education pedagogy in Moroccan schools using an association rules mining-based algorithm Ben Azza, Chaymae; El Hamdani, Sara; Bennani, Mohamed Taj; El Fahssi, Khalid; Lamrini, Mohamed; Elfar, Mohamed
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 2: May 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i2.pp1124-1136

Abstract

Sex education is vital for promoting healthy relationships and preventing sexual exploitation by teaching boundaries, consent and abuse recognition. Customized strategies are needed for children, balancing age-appropriate content with parental and community perspectives. Our study assessed Moroccan parents’ views on sex education’s adoption in schools. Conducted in Taza city, the survey targeted 1946 parents of students over 7 years old. Using association rule mining (ARM), we analyzed their responses. Therefore, Apriori algorithm was implemented to discover strong association rules within parents’ selected responses. Results showed that 74.53% of parents aged 19-30 support sexual education, citing its absence as a factor in child abuse. Meanwhile, 60.48% of those aged 31-59 with university education believe psychological disorders contribute to assaults. While some fathers (32.48%) and some mothers (67.52%) support sexual education, others don’t, but all agree on restricting children’s internet use until age 16 to avoid harmful content. These findings can inform comparative studies, aid decision-makers and enhance AI-based EdTech systems by offering insights into sex education perceptions.
Empowering Malaysian micro agri-entrepreneurs: the role of key success factors in e-agribusiness adoption Tariq, Sehrish; Vaiappuri, Selvakkumar K N; Mahmood, Haider; Houaneb, Amira
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 2: May 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i2.pp1033-1041

Abstract

Progress in the agricultural sector is one of the most imperative tools to enhance the productivity of agribusiness. This study identified the key success factors required for the adoption of e-agribusiness platforms in the Malaysian agriculture sector. The study analyzed potential key factors from the prior studies and contextually adjusted using a pilot study. These factors are categorized in various categories such as financial imperative, technological imperative, knowledge imperative, risk and trust factors, governance and public policy, and challenging business environment. The study has collected data from 302 micro agri-entrepreneurs within Malaysia through a questionnaire for quantitative analysis. The exploratory factor analysis (EFA) is used to see the impact of critical success factors (CSFs) that help to increase technological adoption thereby enhancing communication, advertisement, and overall sales of agri-products on the e-business platform. The study has a significant impact on key success factors (financial imperative, technological imperative, knowledge imperative, risk and trust factors, governance and public policy, and challenging business environment) on the adoption of e-agribusiness platforms. The findings provide guidelines to micro agri-entrepreneurs and policymakers that how to use key success factors to improve business performance by utilizing e-agribusiness platforms.
Chebyshev distance-embedded twin support vector machine for skewed classification problems Balasubramanian, Sai Lakshmi; Ganesan, Gajendran
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 2: May 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i2.pp1383-1391

Abstract

Support vector machine (SVM) is a pivotal classification algorithm, and its evolutionary counterpart, the twin SVM (TWSVM), has gained acclaim for its advanced generalization capabilities, particularly in handling imbalanced data. TWSVMs achieve swift training by explicitly exploring a pair of non-parallel hyperplanes, yet selecting numerical values for hyperparameters poses a challenge due to the uncertainty introduced by random preferences. This paper presents a novel approach, the Chebyshev distance-based TWSVM, specifically designed for hyperparameter tuning in imbalanced binary classification. This innovative model mitigates the uncertainty of hyperparameter selection by leveraging Chebyshev distance, thereby enhancing the generalization capabilities of the TWSVM. To evaluate its efficacy, computational tests were conducted on publicly accessible real-world benchmark datasets across various domains, including non-linear cases. The results demonstrate that the Chebyshev distance-based TWSVM outperforms several existing methods, achieving superior performance with reduced computational time and setting a new benchmark in the field.
Fuzzy based energy efficient cluster head selection with balanced clusters formation in wireless sensor networks Chandrappa, Maruthi Hanumanthappa; Govindaswamy, Poornima
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 2: May 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i2.pp928-939

Abstract

The importance of energy conservation presents a considerable challenge in wireless sensor networks (WSNs), where the sensor nodes (SNs) that constitute the network depend on battery power. Recharging the batteries of SNs in the field is challenging. The clustering technique is a commonly employed method for attaining energy efficiency. In this article, we are proposing a fuzzy-based energy efficient cluster head (CH) selection with the balanced cluster formation (FEECH-BCF) technique. It is a hybrid of the k-means algorithm, low energy adaptive clustering hierarchy- uniform size cluster (LEACH-USC) technique, and fuzzy logic technique. To create the clusters, the k-means approach is employed. The idea of LEACH-USC is used for load balancing to produce clusters with uniform size by assigning member nodes (MNs) from larger clusters to smaller clusters. Optimized CHs are selected using fuzzy based CH selection technique. The k-means algorithm is simple and quick to set up, assigning the membership of SNs to the next best cluster based on centroid locations of clusters reduces intra-cluster distance among clusters, and with the help of fuzzy logic, optimized CHs will be selected. The proposed algorithm performs exceptionally well in attaining uniform energy consumption amongst clusters and extends the network’s lifetime to a greater extent.
Face recognition based on landmark and support vector machine Afifi, Hassan; Hsaini, Abdallah Marhraoui; Merras, Mostafa; Bouazi, Aziz; Chana, Idriss
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 2: May 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i2.pp1289-1298

Abstract

Nowadays, the fast development of face recognition technologies used in fields such as security and video surveillance, gives us many theories and algorithms, a view of these algorithms provides us with an idea of their performance and limitations. In this paper, we will develop a new face recognition approach using the face estimation landmark algorithm to detect faces in real-time videos. Then, we use a pre-trained neural network to extract the 128 facial features of each face detected in the database images and register each vector of 128 values with the corresponding person’s name. Then, we form the linear support vector machine (SVM) classifier to recognize faces. Extensive experiments on real and generated data are presented to demonstrate the quality of the proposed method in terms of accuracy, reliability, and speed.
Techniques of image segmentation: a review Meinam, Sharmila; Nongmeikapam, Kishorjit; Singh, N. Basanta
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 2: May 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i2.pp830-844

Abstract

Image segmentation is a popular topic of research. Image segmentation divides an image into different parts that can be used for further analysis. By doing so, the image becomes simple and more meaningful information can be extracted. The segmentation techniques divide an image into multiple parts based on certain features of the image namely: color, texture, and intensity value of the pixel. Segmentation is considered as one of the toughest tasks for extracting features from an image, detection of objects and lastly classification of the image. The applications of image segmentation in every aspect of life such as satellite image analysis, object detection and recognition, in agricultural field, self-driving vehicles, and medical imaging. Has become indispensable. Till date, though researchers have developed many segmentation techniques, they are unable to design a generalized methodology for the image segmentation problems. A review of image segmentation techniques has been presented in this study. A summary of the advantages and disadvantages of these techniques has been presented. The focus of this manuscript is to provide a summary of the available research work on segmentation which will benefit the enthusiastic researchers in gaining better understanding about segmentation models in various application domains.
A review of the impacts of linked open data on cross-domain recommender systems for individual and groups Xuan, Yui Chee; Mat Nawi, Rosmamalmi; Mohd Noah, Shahrul Azman
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 2: May 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i2.pp1181-1194

Abstract

As users' viewpoints on information searching change from information seeking to information receiving, new search paradigms are continuously emerging. Utilizing a recommender system (RS) is one of the modern ways to get information. The RS has succeeded in various traditional domains, including tourism, health, and books. However, some scenarios are more suitable to recommend to a group of users than an individual, such as listening to music at the same place and group traveling. The limited and incomplete number of user-item ratings triggers the challenges of the group and individual RSs. The data sparsity problem emerges because of this incompleteness. The quality of recommendations offered to individuals and groups suffers when there is data sparsity. Using knowledge gained from a source domain, cross-domain RSs can enhance recommendations in target domain. Cross-domain and linked open data approaches are two ways to increase recommendation systems' performance. The impacts of the two aforementioned approaches on individual and group RSs have been discussed. Furthermore, we highlighted various domains employed in cross-domain RSs for individuals and groups, examined diverse methodologies and algorithms, outlined current issues, and suggested future directions for cross-domain RSs research for groups leveraging linked open data technology.
An efficient hardware implementation of number theoretic transform for CRYSTALS-Kyber post-quantum cryptography Hoang, Trang; Anh Duong, Tu Dinh; Do, Thinh Quang
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 2: May 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i2.pp732-743

Abstract

CRYSTALS-Kyber was chosen to be the standardized key encapsulation mechanisms (KEMs) out of the finalists in the third round of the National Institute of Standards and Technology (NIST) post-quantum cryptography (PQC) standardization program. Since the number theoretic transform (NTT) was used to reduce the computational complexity of polynomial multiplication, it has always been a crucial arithmetic component in CRYSTALS-Kyber design. In this paper, a simple and efficient architecture for NTT is presented where we easily archived the functionality of polynomial multiplication with efficient computation time. Only 857 Look-Up Tables and 744 flip-flops were utilized in our NTT design, which consisted of two processing elements (PEs) and two butterfly cores within each PE.
A hybrid learning model to detect cardiovascular disease from electrocardiogram Lakshmi, G. V. Rajya; Rao, S. Krishna; Rao, K. Venkata
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 2: May 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i2.pp1086-1097

Abstract

Cardiovascular diseases (CVDs) continue to be the world’s most significant cause of morbidity and mortality. This paper introduces a unique hybrid learning model for CVD detection using advanced deep learning (DL) methods. The proposed method combines the potent feature extraction powers of the EfficientNet pre-trained model with attention mechanisms and graph convolutional networks (GCNs) for improved performance. First, rich representations from cardiovascular electrocardiogram (ECG) data extract using the EfficientNet architecture as a feature extractor. Using a large dataset of cardiovascular ECG images, you can fine-tune the pre-trained EfficientNet model with Pipeline to make it more suitable for disease identification. Including attention techniques that allow the network to focus on informative regions within the input, ECG images enhanced the model’s discriminative capacity. The model can attend to the salient areas selectively linked with CVD path physiology through dynamic attention processes. More accurate predictions result from this attention-based refining, strengthening the model’s ability to identify significant patterns suggestive of cardiovascular problems. GCN aims to link the natural structure in cardiovascular data. It can efficiently capture complex interactions and dependencies among various data pieces by expressing medical data as graphs, where nodes correspond to image regions, and edges imply spatial connections. Combining GCN into the proposed hybrid learning architecture facilitates extracting contextual information from local and global sources, augmenting the model’s accuracy.

Filter by Year

2025 2025


Filter By Issues
All Issue Vol 41, No 2: February 2026 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