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 35, No 3: September 2024" : 65 Documents clear
Exploring RoBERTa model for cross-domain suggestion detection in online reviews Nandula, Anuradha; Reddy, Panuganti Vijayapal
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i3.pp1637-1644

Abstract

Detecting suggestions in online review requires contextual understanding of review text, which is an important real-world application of natural language processing. Given the disparate text domains found in product reviews, a common strategy involves fine-tuning bidirectional encoder representations from transformers (BERT) models using reviews from various domains. However, there hasn't been an empirical examination of how BERT models behave across different domains in tasks related to detecting suggestion sentences from online reviews. In this study, we explore BERT models for suggestion classification that have been fine-tuned using single-domain and cross-domain Amazon review datasets. Our results indicate that while single-domain models achieved slightly better performance within their respective domains compared to cross-domain models, the latter outperformed single-domain models when evaluated on cross-domain data. This was also observed for single-domain data not used for fine-tuning the single-domain model and on average across all tests. Although fine-tuning single-domain models can lead to minor accuracy improvements, employing multi-domain models that perform well across domains can help in cold start problems and reduce annotation costs.
Credit card fraud detection with advanced graph based machine learning techniques Renganathan, Krishna Kumari; Karuppiah, Janaki; Pathinathan, Mahimairaj; Raghuraman, Sudharani
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i3.pp1963-1975

Abstract

In the realm of credit card fraud detection, the landscape is continually evolving, demanding innovative approaches to stay ahead of increasingly sophisticated fraudulent activities. Our research pioneers a groundbreaking methodology that amalgamates the power of bipartite graph visualization with advanced machine learning techniques. This fusion yields a comprehensive framework capable of effectively evaluating the efficacy of a random forest classifier in uncovering fraudulent credit card transactions. Our study showcases the compelling application of this methodology, offering a paradigm shift in how we analyze and understand credit card fraud detection systems. By seamlessly integrating machine learning algorithms with network analysis, we provide a holistic view of the data, unveiling intricate patterns hidden within. At the heart of our approach lies the innovative use of bipartite graphs, which serve as a dynamic visual bridge between model predictions and real-world outcomes. This visual representation not only enhances interpretability but also facilitates a deeper understanding of the classifier’s performance. By visually mapping the relationships between transactions and their respective classifications, our methodology offers actionable insights into both successful detection and potential areas for improvement. Empowering analysts and stakeholders, our approach facilitates informed decision-making by enabling them to fine-tune model parameters and enhance the overall effectiveness of fraud detection systems. Through this synergy between cutting-edge machine learning and network analysis techniques, we provide a powerful tool to combat the critical challenge of credit card fraud prevention. Step into the future of fraud detection with our innovative methodology, where every transaction is scrutinized with precision, and where security is not just a possibility, but a promise fulfilled.
MLFF-Net: a multi-model late feature fusion network for skin disease classification Gairola, Ajay Krishan; Kumar, Vidit; Sahoo, Ashok Kumar
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i3.pp1906-1914

Abstract

Early diagnosis is paramount to preventing skin diseases and reducing mortality, given their global prevalence. Visual detection by experts using dermoscopy images has become the gold standard for detecting skin cancer. However, a significant challenge in skin cancer detection and classification lies in the similarity of appearance among skin disease lesions and the complexity of dermoscopic images. In response, we developed multi-model late feature fusion network (MLFF-Net), a multi-model late feature fusion network tailored for skin disease detection. Our approach begins with image pre-processing techniques to enhance image quality. We then employ a two-stream network comprising an enhanced densely linked network (DenseNet-121) and a vision transformer (ViTb16). We leverage shallow and deep feature fusion, late fusion, and an attention module to enhance the model’s feature extraction efficiency. The subsequent feature fusion module constructs multi-receptive fields to capture disease information across various scales and uses generalized mean pooling (GeM) pooling to reduce the spatial dimensions of lesion characteristics. Finally, we implement and test our skin lesion categorization model, demonstrating its effectiveness. Despite the combination, convolutional neural network (CNN) outperforms ViT approaches, with our model enhancing the accuracy of the best model by 6.1%.
Minitab 20 and Python based-the forecasting of demand and optimal inventory of liquid aluminum sulfate supplies Dwipurwani, Oki; Puspita, Fitri Maya; Supadi, Siti Suzlin; Yuliza, Evi
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i3.pp1796-1807

Abstract

In a company, inventory management is crucial due to the significant impact on various aspects of the business. Similarly, the Indonesian water supply company (PDAM) requires effective inventory management to ensure the supply of liquid aluminum sulfate chemicals. The probabilistic statistical inventory control (SIC) model is commonly used for inventory management. However, previous research on chemical inventory models in PDAMs often relied on simple linear regression to forecast demand data, which fails to capture the inherent volatility in demand. Therefore, this research aimed to predict demand data using the seasonal autoregressive integrated moving average (SARIMA) method and determine the optimal policy for supplying liquid aluminum sulfate chemicals. The results showed that the best demand forecasting model was SARIMA (2,1,2) (1,1,0)12 with a mean absolute percentage error (MAPE) value of 8.19%. The finding of the optimal inventory policy showed a safety stock value of 11,922.35 kg, a reorder point value of 49,511.20 kg, and an order quantity of 21,526.59 kg, leading to a total cost of IDR 11,132,034,145.45. The sensitivity test also showed that variations in lead time, price, μ, and σ parameters directly influence changes in total cost, reorder point, and safety stock. These calculations were conducted using Minitab and Python software.
HybridCSF model for magnetic resonance image based brain tumor segmentation Kataria, Jyoti; Panda, Supriya P.
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i3.pp1845-1852

Abstract

The human brain comprises a complex interconnection of nerve cells and vital organs, which regulates crucial bodily processes. Although neurons commonly undergo developmental stages, they may occasionally experience abnormalities, leading to abnormal growths known as brain tumors. The objective of brain tumor segmentation is to produce precise boundaries of brain tumor regions. This study extensively analyzes deep learning methods for brain tumor detection, evaluating their effectiveness across diverse datasets. It introduces a hybrid model, which is proposed by the name HybriCSF: hybrid convolutional-SVM-fuzzy C-means model combining convolutional neural network (CNN) with the classifier support vector machine (SVM) and clustering technique fuzzy C-means (FCM). The proposed model was implemented on Br35H, BraTs 2020 and BraTs2021 datasets. The suggested model outperformed the existing methods by achieving 98.6% of accuracy on Br35H dataset and dice score of 0.63, 0.87, 0.81 on BraTs 2020 dataset for enhancing tumor (ET), whole tumor (WT), and tumor core (TC), respectively. The achieved dice scores on the BraTs 2021datasets are 0.89, 0.95, and 0.89 for ET, WT, and TC, respectively. The results show that the suggested model HybriCSF outperforms the other CNN-based models in terms of accuracy.
Clinical named entity extraction for extracting information from medical data Kuttaiyapillai, Dhanasekaran; Madasamy, Anand; Ayyavu, Shobanadevi; Sayeed, Md Shohel
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i3.pp1722-1731

Abstract

Clinical named entity extraction (NER) based on deep learning gained much attention among researchers and data analysts. This paper proposes a NER approach to extract valuable Parkinson’s disease-related information. To develop an effective NER method and to handle problems in disease data analytics, a unique NER technique applies a “recognize-map-extract (RME)” mechanism and aims to deal with complex relationships present in the data. Due to the fast-growing medical data, there is a challenge in the development of suitable deep-learning methods for NER. Furthermore, the traditional machine learning approaches rely on the time-consuming process of creating corpora and cannot extract information for specific needs and locations in certain situations. This paper presents a clinical NER approach based on a convolutional neural network (CNN) for better use of specific features around medical entities and analyzes the performance of the proposed approach through fine-tuning NER with effective pre-training on the BC5CDR dataset. The proposed method uses annotation of entities for various medical concepts. The second stage develops a clinically NER method. This proposed method shows interesting results on the performance measures achieving a precision of 92.57%, recall of 92.22%, and F1- measure of 91.6%.
Novel modified Chernobyl disaster optimizer for controlling DC motor Aribowo, Widi; Shehadeh, Hisham A.
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i3.pp1361-1369

Abstract

This article presents the modified Chernobyl disaster optimizer (CDO) method for DC motor control to find the optimal proportional integral derivative (PID) settings. DC motors are widely used machinery. DC motors are also simple to use. The detonation of the Chernobyl nuclear reactor core served as the inspiration for the idea and guiding principles of the CDO. CDO has limitations in the stability of exploration and exploitation areas. This research aims to obtain a new balance of exploration and exploitation. This study suggests incorporating the levy flight and chaotic algorithm (CA) techniques to enhance the CDO method. This study was conducted with the MATLAB/Simulink software. A comparative technique, which included the marine predator algorithm (MPA), golden jackal optimization (GJO), and CDO, was utilized to determine the performance of the MCDO method. According to the study’s findings, the MCDO method’s overshoot value outperformed all other approaches.
An intelligent approach to detect and predict online fraud transaction using XGBoost algorithm Bala, Bala Santhosh; Yadav, Pasupula Praveen; Reddy, Mogathala Raghavendra
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i3.pp1491-1498

Abstract

The most popular payment method in recent years is the credit card. Due to the E-commerce industry’s explosive growth, the usage of credit cards for online purchases have been greatly increased as a result frauds has increased. Banks have been facing challenges to detect the credit card system fraud in recent years. Credit card fraud happens when the card was stolen for any unauthorized purposes or if the fraudster utilizes the credit card information for his own use. In order to prevent credit card fraud, it is essential to build detection measures. While detecting credit card theft with machine learning (ML), the features of credit card frauds play an important and they must be carefully selected. A fraud detection algorithm must be created in order to correctly locate and stop fraudulent activity as technology advances along with the amount of fraud cases. ML methods are essential for identifying fraudulent transactions. The implementation of fraud detection models is particularly difficult because of the sensitive nature of the data, the unbalanced class distributions, and the lack of data. In this work, an intelligent approach to detect and predict online fraud transaction using extreme gradient boosting (XGBoost) algorithm is described. The XGBoost model predicts whether a transaction is fraud or not. This model will achieve better performance interarm of recall, precision, accuracy and F1-score for credit card fraud detection.
Feature selection technique on convolutional neural network – multilabel classification task Hayami, Regiolina; Yusoff, Nooraini; Daud, Kauthar Mohd; Mukhtar, Harun; Al Amien, Januar
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i3.pp2001-2009

Abstract

Automated text-based recommendation, an artificial intelligence development, finds application in document analysis like job resumes. The classification of job resumes poses challenges due to the ambiguity in categorizing multiple potential jobs in a single application file, termed multi-label classification, deep learning, particularly convolutional neural networks (CNN), offers flexibility in enhancing feature representations. Despite its robust learning capabilities, the black-box design of deep learning lacks interpretability and demands a substantial number of parameters, requiring significant computational resources. The primary challenge in multilabel learning is the ambiguity of labels not fully explained by traditional equivalence relations. To address this, the research employs feature selection techniques, specifically the Chi-square method. The goal is to reduce features in deep learning models while considering label relevance in multi-label text classification, easing computational workload while preserving model performance. Experimental tests, both with and without the Chi-square feature selection technique on the dataset, underscore its substantial impact on the classification model's ability. The conclusion emphasizes the influence of the Chi-square feature selection technique on performance and computational time. In summary, the research underscores the importance of balancing computational efficiency and model interpretability, especially in complex multi-label classification tasks like job applications.
Predicting customer churn in telecommunication sector using Naïve Bayes algorithm Agasti, Biswa Ranjan; Satpathy, Susanta
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i3.pp1610-1617

Abstract

The telecom sector creates huge amounts of information every day as a result of its large customer base. Business professionals and decision-makers emphasized that maintaining existing clients is less expensive than recruiting new ones. Business analysts and customer relationship management (CRM)need to know the reasons why customers leave and the behavior patterns from earlier churn consumer’s data. Today, there is a problem with customer churn examination and prediction in the telecom industry since it is crucial for the sector to examine customer behavior to identify those who are going to stop their subscriptions. Customer retention could be increased by utilizing detection system to detect consumer behavior. Recent advancements in machine learning(ML)have made churn prediction more precise and practical. It is essential for identifying customers ready to leave using company’s products and services in the early stage. Hence in this work, predicting customers churn in telecommunication sector usingNaïveBayes(NB) model is presented. The performance of presentedNBalgorithmis evaluated using the parameters accuracy, precision, and sensitivity. The NB algorithm will have better performance than pervious approaches.

Filter by Year

2024 2024


Filter By Issues
All Issue 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