cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
International Journal of Advances in Intelligent Informatics
Published by Universitas Ahmad Dahlan
ISSN : 24426571     EISSN : 25483161     DOI : 10.26555
Core Subject : Science,
Computer Science & IT
International journal of advances in intelligent informatics (IJAIN) e-ISSN: 2442-6571 is a peer reviewed open-access journal published three times a year in English-language, provides scientists and engineers throughout the world for the exchange and dissemination of theoretical and practice-oriented papers dealing with advances in intelligent informatics. All the papers are refereed by two international reviewers, accepted papers will be available on line (free access), and no publication fee for authors.
Arjuna Subject : -
Articles 330 Documents
 24   25   26   27   28 
Fault diagnosis-based SDG transfer for zero-sample fault symptom Yu, Mengqin; Lee, Yi Shan; Chen, Junghui
International Journal of Advances in Intelligent Informatics Vol 9, No 3 (2023): November 2023
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v9i3.1434

Abstract

The traditional fault diagnosis models cannot achieve good fault diagnosis accuracy when a new unseen fault class appears in the test set, but there is no training sample of this fault in the training set. Therefore, studying the unseen cause-effect problem of fault symptoms is extremely challenging. As various faults often occur in a chemical plant, it is necessary to perform fault causal-effect diagnosis to find the root cause of the fault. However, only some fault causal-effect data are always available to construct a reliable causal-effect diagnosis model. Another worst thing is that measurement noise often contaminates the collected data. The above problems are very common in industrial operations. However, past-developed data-driven approaches rarely include causal-effect relationships between variables, particularly in the zero-shot of causal-effect relationships. This would cause incorrect inference of seen faults and make it impossible to predict unseen faults. This study effectively combines zero-shot learning, conditional variational autoencoders (CVAE), and the signed directed graph (SDG) to solve the above problems. Specifically, the learning approach that determines the cause-effect of all the faults using SDG with physics knowledge to obtain the fault description. SDG is used to determine the attributes of the seen and unseen faults. Instead of the seen fault label space, attributes can easily create an unseen fault space from a seen fault space. After having the corresponding attribute spaces of the failure cause, some failure causes are learned in advance by a CVAE model from the available fault data. The advantage of the CVAE is that process variables are mapped into the latent space for dimension reduction and measurement noise deduction; the latent data can more accurately represent the actual behavior of the process. Then, with the extended space spanned by unseen attributes, the migration capabilities can predict the unseen causes of failure and infer the causes of the unseen failures. Finally, the feasibility of the proposed method is verified by the data collected from chemical reaction processes.
Computer-aided pulmonary disease diagnosis using lung ultrasound video Bahri, Saeful; Suprijanto, Suprijanto; Juliastuti, Endang
International Journal of Advances in Intelligent Informatics Vol 10, No 3 (2024): August 2024
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v10i3.1397

Abstract

The development of a machine learning-based computer-aided diagnosis (CAD) system implemented for processing lung ultrasound images will greatly assist doctors in making decisions in diagnosing lung diseases. The learning method of the classifier model used in the computer-aided diagnosis system will affect the system's accuracy in diagnosing lung disease. Determining variables in the classifier and image pre-processing stages requires special attention to obtain a highly accurate classifier model. This study presents the development of a machine learning-based CAD as an add-on tool to classify lung disease based on a lung ultrasound (LUS) video. The main steps in this study are capturing the LUS videos and converting them into images, image pre-processing for speckle noise removal, image contrast and brightness enhancement, feature extraction, and the classification stage. In this study, three learning algorithm models, namely Support Vector Machine (SVM), K-Nearest Neighbor (KNN), and Naïve Bayes (NB), were used to classify images into three categories, namely healthy conditions, pneumonia, and COVID-19.  The performance of the three classifier models is compared to each other to obtain the best classifier model. The experimental results demonstrate the superiority of the suggested strategy utilizing the SVM classifier. Based on experimental data using 2,149 lung images for three classes and 20 texture feature sets, the SVM has an accuracy of 98.1%, the KNN is 94.7%, and the Gaussian NB is 79.6%. The model with the highest accuracy will be used to develop the computer-aided diagnosis (CAD) system.
Detecting signal transtition in dynamic sign language using R-GB LSTM method Ridwang, Ridwang; Adriani, Adriani; rahmania, Rahmania; Sahrim, Mus’ab; Syahyadi, Asep Indra; Setiaji, Haris
International Journal of Advances in Intelligent Informatics Vol 10, No 2 (2024): May 2024
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v10i2.1445

Abstract

Sign Language Recognition (SLR) helps deaf people communicate with normal people. However, SLR still has difficulty detecting dynamic movements of connected sign language, which reduces the accuracy of detection. This results from a sentence's usage of transitional gestures between words. Several researchers have tried to solve the problem of transition gestures in dynamic sign language, but none have been able to produce an accurate solution. The R-GB LSTM method detects transition gestures within a sentence based on labelled words and transition gestures stored in a model. If a gesture to be processed during training matches a transition gesture stored in the pre-training process and its probability value is greater than 0.5, it is categorized as a transition gesture. Subsequently, the detected gestures are eliminated according to the gesture's time value (t). To evaluate the effectiveness of the proposed method, we conducted an experiment using 20 words in Indonesian Sign Language (SIBI). Twenty representative words were selected for modelling using our R-GB LSTM technique. The results are promising, with an average accuracy of 80% for gesture sentences and an even more impressive accuracy rate of 88.57% for gesture words. We used a confusion matrix to calculate accuracy, specificity, and sensitivity. This study marks a significant leap forward in developing sustainable sign language recognition systems with improved accuracy and practicality. This advancement holds great promise for enhancing communication and accessibility for deaf and hard-of-hearing communities.
Optimization of use case point through the use of metaheuristic algorithm in estimating software effort Ardiansyah, Ardiansyah; Zulfa, Mulki Indana; Tarmuji, Ali; Jabbar, Farisna Hamid
International Journal of Advances in Intelligent Informatics Vol 10, No 1 (2024): February 2024
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v10i1.1298

Abstract

Use Case Points estimation framework relies on the complexity weight parameters to estimate software development projects. However, due to the discontinue parameters, it lead to abrupt weight classification and results in inaccurate estimation. Several research studies have addressed these weaknesses by employing various approaches, including fuzzy logic, regression analysis, and optimization techniques. Nevertheless, the utilization of optimization techniques to determine use case weight parameter values has yet to be extensively explored, with the potential to enhance accuracy further. Motivated by this, the current research delves into various metaheuristic search-based algorithms, such as genetic algorithms, Firefly algorithms, Reptile search algorithms, Particle swarm optimization, and Grey Wolf optimizers. The experimental investigation was carried out using a Silhavy UCP estimation dataset, which contains 71 project data from three software houses and is publicly available. Furthermore, we compared the performance between models based on metaheuristic algorithms. The findings indicate that the performance of the Firefly algorithm outperforms the others based on five accuracy metrics: mean absolute error, mean balance relative error, mean inverted relative error, standardized accuracy, and effect size. This research could be useful for software project managers to leverage the practical implications of this study by utilizing the UCP estimation method, which is optimized using the Firefly algorithm.
Dynamic path planning using a modified genetic algorithm Pratomo, Awang Hendrianto; Wahyunggoro, Oyas; Triharminto, Hendri Himawan
International Journal of Advances in Intelligent Informatics Vol 10, No 3 (2024): August 2024
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v10i3.699

Abstract

Genetic algorithm (GA) is well-known algorithm to find a feasible path planning which can be defined as global optimum problem. The drawback of GA is the high computation due to random process on each operator.  In this research, the new initial population integrating with new crossover operator strategy was proposed. The parameter is the length of distance travelled of the robot. Before employing the crossover operator, generating a c-obstacle have been done. The c-obstacle is used  as a filter to reduce unnecessary nodes to decrease time computation. After that, the initial population has been determined. The initial population is divided into two parents which parent’s chromosome contains an initial and goal position. The second parents are fulfilled with nodes from each obstacle. The genes of chromosome will add with c-obstacle nodes. Crossover operator is applied after filtering and c-obstacle of possible hopping is determined. Filtering method is used to remove unnecessary nodes that are part of c-obstacle. Fitness function considers the distance from  the last to next position. Optimum value is the shortest distance of path planning which avoids the obstacle in front.  The aim of the proposed method is to reduce the random population and random operating in GA. By using a similar data set of previous researches, the modified GA can reduce the total of generation and yield an adaptive generation number. This means that the modified GA converges faster than the other GA methods.
Domain adaptation for driver's gaze mapping for different drivers and new environments Sonom-Ochir, Ulziibayar; Karungaru, Stephen; Terada, Kenji; Ayush, Altangerel
International Journal of Advances in Intelligent Informatics Vol 10, No 1 (2024): February 2024
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v10i1.1168

Abstract

Distracted driving is a leading cause of traffic accidents, and often arises from a lack of visual attention on the road. To enhance road safety, monitoring a driver's visual attention is crucial. Appearance-based gaze estimation using deep learning and Convolutional Neural Networks (CNN) has shown promising results, but it faces challenges when applied to different drivers and environments. In this paper, we propose a domain adaptation-based solution for gaze mapping, which aims to accurately estimate a driver's gaze in diverse drivers and new environments. Our method consists of three steps: pre-processing, facial feature extraction, and gaze region classification. We explore two strategies for input feature extraction, one utilizing the full appearance of the driver and environment and the other focusing on the driver's face. Through unsupervised domain adaptation, we align the feature distributions of the source and target domains using a conditional Generative Adversarial Network (GAN). We conduct experiments on the Driver Gaze Mapping (DGM) dataset and the Columbia Cave-DB dataset to evaluate the performance of our method. The results demonstrate that our proposed method reduces the gaze mapping error, achieves better performance on different drivers and camera positions, and outperforms existing methods. We achieved an average Strictly Correct Estimation Rate (SCER) accuracy of 81.38% and 93.53% and Loosely Correct Estimation Rate (LCER) accuracy of 96.69% and 98.9% for the two strategies, respectively, indicating the effectiveness of our approach in adapting to different domains and camera positions. Our study contributes to the advancement of gaze mapping techniques and provides insights for improving driver safety in various driving scenarios.
Enhancement of images compression using channel attention and post-filtering based on deep autoencoder Wirabudi, Andri Agustav; Fachrurrozi, Nurwan Reza; Dorand, Pietra; Royhan, Muhamad
International Journal of Advances in Intelligent Informatics Vol 10, No 3 (2024): August 2024
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v10i3.1499

Abstract

Image compression is a crucial research topic in today's information age, especially to meet the demand for balanced data compression efficiency with the quality of the resulting image reconstruction. Common methods used for image compression nowadays are based on autoencoders with deep learning foundations. However, these methods have limitations as they only consider residual values in processed images to achieve existing compression efficiency with less satisfying reconstruction results. To address this issue, we introduce the Attention Block mechanism to improve coding efficiency even further. Additionally, we introduce post-filtering methods to enhance the final reconstruction results of images. Experimental results using two datasets, CLIC for training and KODAK for testing, demonstrate that this method outperforms several previous research methods. With an efficiency coding improvement of -28.16%, an average PSNR improvement of 34%, and an MS-SSIM improvement of 8%, the model in this study significantly enhances the rate-distortion (RD) performance compared to previous approaches.
Predictive optimization in automotive supply chains: a BiLSTM-Attention and reinforcement learning approach Amellal, Asmae; Amellal, Issam; Ech-charrat, Mohammed Rida; Seghiouer, Hamid
International Journal of Advances in Intelligent Informatics Vol 10, No 3 (2024): August 2024
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v10i3.1351

Abstract

Effective supply chain management is pivotal for enhancing customer satisfaction and driving competitiveness and profitability in the automotive service and spare parts distribution sector. Our research introduces an innovative approach, integrating game theory, BiLSTM-Attention deep learning, and Reinforcement Learning (RL) to refine supply and pricing strategies within this domain. Focusing on Moroccan automobile companies, we utilized Enterprise Resource Planning (ERP) system data to forecast customer behavior using a BiLSTM model enhanced with an Attention mechanism. This predictive model achieved a Mean Squared Error (MSE) of 0.0525 and an R² value of 0.896, indicating high accuracy and an ability to explain substantial variance in customer behavior. To further our analysis, we incorporated reinforcement learning, evaluating three algorithms: Q-learning, Deep Q-Networks (DQN), and SARSA. Our findings demonstrate SARSA's superior performance in our context, attributed to its adeptness at navigating the dynamic environment of the automotive supply chain. By synergizing the predictive power of the BiLSTM-Attention model with the strategic optimization capabilities of reinforcement learning, particularly SARSA, our study offers a comprehensive framework for automotive companies to enhance their supply chain strategies, balancing profitability and customer satisfaction effectively in a rapidly evolving industry sector
Self-supervised few-shot learning for real-time traffic sign classification Nguyen, Anh-Khoa Tho; Tran, Tin; Nguyen, Phuc Hong; Dinh, Vinh Quang
International Journal of Advances in Intelligent Informatics Vol 10, No 1 (2024): February 2024
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v10i1.1522

Abstract

Although supervised approaches for traffic sign classification have demonstrated excellent performance, they are limited to classifying several traffic signs defined in the training dataset. This prevents them from being applied to different domains, i.e., different countries. Herein, we propose a self-supervised approach for few-shot learning-based traffic sign classification. A center-awareness similarity network is designed for the traffic sign problem and trained using an optical flow dataset. Unlike existing supervised traffic sign classification methods, the proposed method does not depend on traffic sign categories defined by the training dataset. It applies to any traffic signs from different countries. We construct a Korean traffic sign classification (KTSC) dataset, including 6000 traffic sign samples and 59 categories. We evaluate the proposed method with baseline methods using the KTSC, German traffic sign, and Belgian traffic sign classification datasets. Experimental results show that the proposed method extends the ability of existing supervised methods and can classify any traffic sign, regardless of region/country dependence. Furthermore, the proposed approach significantly outperforms baseline methods for patch similarity. This approach provides a flexible and robust solution for classifying traffic signs, allowing for accurate categorization of every traffic sign, regardless of regional or national differences.
Deep learning mango fruits recognition based on tensorflow lite Mustaffa, Mas Rina; Idris, Aainaa Azullya; Abdullah, Lili Nurliyana; Nasharuddin, Nurul Amelina
International Journal of Advances in Intelligent Informatics Vol 9, No 3 (2023): November 2023
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v9i3.1368

Abstract

Agricultural images such as fruits and vegetables have previously been recognised and classified using image analysis and computer vision techniques. Mangoes are currently being classified manually, whereby mango sellers must laboriously identify mangoes by hand. This is time-consuming and tedious. In this work, TensorFlow Lite was used as a transfer learning tool. Transfer learning is a fast approach in resolving classification problems effectively using small datasets. This work involves six categories, where four mango types are classified (Harum Manis, Langra, Dasheri and Sindhri), categories for other types of mangoes, and a non-mango category. Each category dataset comprises 100 images, and is split 70/30 between the training and testing set, respectively. This work was undertaken with a mobile-based application that can be used to distinguish various types of mangoes based on the proposed transfer learning method. The results obtained from the conducted experiment show that adopted transfer learning can achieve an accuracy of 95% for mango recognition. A preliminary user acceptance survey was also carried out to investigate the user’s requirements, the effectiveness of the proposed functionalities, and the ease of use of its proposed interfaces, with promising results.

Page 26 of 33 | Total Record : 330

 24   25   26   27   28 

Filter by Year

2015 2026


Reset
Filter By Issues
All Issue Vol 12, No 1 (2026): February 2026 Vol 11, No 4 (2025): November 2025 Vol 11, No 3 (2025): August 2025 Vol 11, No 2 (2025): May 2025 Vol 11, No 1 (2025): February 2025 Vol 10, No 3 (2024): August 2024 Vol 10, No 2 (2024): May 2024 Vol 10, No 1 (2024): February 2024 Vol 9, No 3 (2023): November 2023 Vol 9, No 2 (2023): July 2023 Vol 9, No 1 (2023): March 2023 Vol 8, No 3 (2022): November 2022 Vol 8, No 2 (2022): July 2022 Vol 8, No 1 (2022): March 2022 Vol 7, No 3 (2021): November 2021 Vol 7, No 3 (2021): November 2021 (Issue in Progress) Vol 7, No 2 (2021): July 2021 (Issue in Progess) Vol 7, No 2 (2021): July 2021 Vol 7, No 1 (2021): March 2021 Vol 6, No 3 (2020): November 2020 Vol 6, No 2 (2020): July 2020 Vol 6, No 1 (2020): March 2020 Vol 5, No 3 (2019): November 2019 Vol 5, No 2 (2019): July 2019 Vol 5, No 1 (2019): March 2019 Vol 4, No 3 (2018): November 2018 Vol 4, No 2 (2018): July 2018 Vol 4, No 1 (2018): March 2018 Vol 3, No 3 (2017): November 2017 Vol 3, No 2 (2017): July 2017 Vol 3, No 1 (2017): March 2017 Vol 2, No 3 (2016): November 2016 Vol 2, No 2 (2016): July 2016 Vol 2, No 1 (2016): March 2016 Vol 1, No 3 (2015): November 2015 Vol 1, No 2 (2015): July 2015 Vol 1, No 1 (2015): March 2015 More Issue