Article Per Year (5 Year)
p-Index From 2021 - 2026
13.688
P-Index
This Author published in this journals
All Journal Jurnal Buana Informatika Sinkron : Jurnal dan Penelitian Teknik Informatika U Karst JURNAL MEDIA INFORMATIKA BUDIDARMA Indonesian Journal of Artificial Intelligence and Data Mining Jurnal Informatika Universitas Pamulang Jiko (Jurnal Informatika dan komputer) J-SAKTI (Jurnal Sains Komputer dan Informatika) J-Dinamika: Jurnal Pengabdian Kepada Masyarakat Building of Informatics, Technology and Science Buletin Ilmiah Sarjana Teknik Elektro Jurnal Informatika Ekonomi Bisnis Abdi: Jurnal Pengabdian dan Pemberdayaan Masyarakat Jurnal Teknik Informatika C.I.T. Medicom JOURNAL OF INFORMATION SYSTEM RESEARCH (JOSH) Journal of Computer System and Informatics (JoSYC) Jurnal Sistem Komputer dan Informatika (JSON) Reswara: Jurnal Pengabdian Kepada Masyarakat Jurnal Teknologi Informatika dan Komputer Journal of Computer Networks, Architecture and High Performance Computing Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika) Jurnal Teknik Informatika (JUTIF) Yumary: Jurnal Pengabdian kepada Masyarakat International Journal of Robotics and Control Systems KLIK: Kajian Ilmiah Informatika dan Komputer J-SAKTI (Jurnal Sains Komputer dan Informatika) Brilliance: Research of Artificial Intelligence Malcom: Indonesian Journal of Machine Learning and Computer Science Jurnal Informatika Ekonomi Bisnis Jurnal Pengabdian Masyarakat Charitas Kesatria : Jurnal Penerapan Sistem Informasi (Komputer dan Manajemen)
Airlangga, Gregorius
Atma Jaya Catholic University Of Indonesia
Religion Agriculture, Biological Sciences & Forestry Humanities Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Health Professions Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Mathematics Medicine & Pharmacology Public Health Social Sciences Other

Published : 118 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 118 Documents
Search

 8   9   10   11   12 
A Comparative Study of Ensemble Learning and Neural Networks for the Heart Disease Prediction Airlangga, Gregorius; Nugroho, Oskar Ika Adi; Lim, Bobi Hartanto Pramudita
Sinkron : jurnal dan penelitian teknik informatika Vol. 9 No. 1 (2025): Research Article, January 2025
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v9i1.14347

Abstract

Heart disease continues to be a leading global cause of death, making the development of predictive models for early diagnosis a critical task. This study investigates the performance of various machine learning and deep learning models for heart disease prediction using a structured dataset of 918 observations and 11 features. The analysis includes ensemble methods like Random Forest, Gradient Boosting, and XGBoost, as well as neural networks such as Multi-Layer Perceptrons (MLPs) and Convolutional Neural Networks (CNNs). Traditional classifiers, including Support Vector Machines (SVM) and Logistic Regression, are also considered for benchmarking. The dataset was preprocessed using label encoding, standardization, and the Synthetic Minority Oversampling Technique (SMOTE) to address class imbalance and ensure data consistency. Model evaluation was conducted using key metrics such as precision, recall, F1-score, and ROC-AUC. The results demonstrated that ensemble methods, particularly Random Forest (ROC-AUC: 0.9313) and Gradient Boosting (ROC-AUC: 0.9279), consistently delivered superior performance. Among neural networks, MLPs showed promising results (ROC-AUC: 0.9232), outperforming CNNs, which were less effective in handling tabular data. Meanwhile, TabNet was found to be unsuitable for this dataset, as it significantly underperformed across all metrics. This research highlights the effectiveness of ensemble methods and MLPs in heart disease prediction and the importance of proper preprocessing techniques. Future work could focus on integrating hybrid models or advanced optimization techniques to further enhance predictive accuracy in clinical settings.
Application of Traditional Machine Learning Techniques for the Classification of Human DNA Sequences: A Comparative Study of Random Forest and XGBoost Airlangga, Gregorius
Jurnal Informatika Universitas Pamulang Vol 9 No 1 (2024): JURNAL INFORMATIKA UNIVERSITAS PAMULANG
Publisher : Teknik Informatika Universitas Pamulang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32493/informatika.v9i1.39353

Abstract

This study evaluates the performance of hybrid machine learning models, specifically Random Forest and XGBoost, in classifying human DNA sequences into seven functional classes. Utilizing advanced feature vectorization techniques, this research addresses the challenges of analyzing high-dimensional genomic data. Both models were trained and tested on a dataset of annotated human DNA sequences, with an emphasis on generalizability to new, unseen data. Our results indicate that the Random Forest model achieved an accuracy of 87.98%, slightly outperforming the XGBoost model, which recorded an accuracy of 87.06%. These findings underscore the effectiveness of employing traditional machine learning techniques coupled with innovative data preprocessing for predictive modeling in genomics. The study not only enhances our understanding of genomic functionalities but also suggests robust methodologies for future genetic research and potential applications in personalized medicine. The implications of these results for improving classification accuracy and the recommendations for integrating more complex algorithms are also discussed
A Hybrid Model for Human DNA Sequence Classification Using Convolutional Neural Networks and Random Forests Airlangga, Gregorius
Jurnal Informatika Universitas Pamulang Vol 9 No 2 (2024): JURNAL INFORMATIKA UNIVERSITAS PAMULANG
Publisher : Teknik Informatika Universitas Pamulang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32493/informatika.v9i2.39355

Abstract

Human DNA sequence classification is a fundamental task in genomics, essential for understanding genetic variations and its implications in disease susceptibility, personalized medicine, and evolutionary biology. This study proposes a novel hybrid model combining Convolutional Neural Networks (CNN) for feature extraction and Random Forest classifiers for final classification. The model was evaluated on a dataset of human DNA sequences, with achieving an accuracy of 75.34%. The results showed that performance metrics, including precision, recall, and F1-scores across multiple classes, showed significant improvements over traditional models. The CNN component effectively captures local dependencies and patterns within the sequences, while the Random Forest classifier handles complex decision boundaries, resulting in enhanced classification accuracy. Comparative analysis demonstrated the superiority of our hybrid approach, with the CNN-LSTM model achieving only 59.47% accuracy, and other RNN-based models like CNN-GRU and CNN-BiLSTM performing similarly lower. These results suggest that hybrid models can leverage the strengths of both deep learning and traditional machine learning techniques an offering a more effective tool for DNA sequence classification. The future work will optimize model architecture and explore larger, thus more diverse datasets to validate our approach's generalizability and robustness.
Fuzzy A* for optimum Path Planning in a Large Maze Airlangga, Gregorius
Buletin Ilmiah Sarjana Teknik Elektro Vol. 5 No. 4 (2023): December
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/biste.v5i4.9394

Abstract

 Traditional A* path planning, while guaranteeing the shortest path with an admissible heuristic, often employs conservative heuristic functions that neglect potential obstacles and map inaccuracies. This can lead to inefficient searches and increased memory usage in complex environments. To address this, machine learning methods have been explored to predict cost functions, reducing memory load while maintaining optimal solutions. However, these require extensive data collection and struggle in novel, intricate environments. We propose the Fuzzy A* algorithm, an enhancement of the classic A* method, incorporating a new determinant variable to adjust heuristic cost calculations. This adjustment modulates the scope of scanned vertices during searches, optimizing memory usage and computational efficiency. In our approach, unlike traditional A* heuristics that overlook environmental complexities, the Fuzzy A* employs a dynamic heuristic function. This function, leveraging fuzzy logic principles, adapts to varying levels of environmental complexity, allowing a more nuanced estimation of the path cost that considers potential obstructions and route feasibility. This adaptability contrasts with standard machine learning-based solutions, which, while effective in known environments, often falter in unfamiliar or highly complex settings due to their reliance on pre-existing datasets. Our experimental framework involved 100 maze-solving trials in diverse maze configurations, ranging from simple to highly intricate layouts, to evaluate the effectiveness of Fuzzy A*. We employed specific metrics such as path length, computational time, and memory usage for a comprehensive assessment. The results showcased that Fuzzy A* consistently found the shortest paths (99.96% success rate) and significantly reduced memory usage by 67% and 59% compared to Breadth-First-Search (BFS) and traditional A*, respectively. These findings underline the effectiveness of our modified heuristic approach in diverse and challenging environments, highlighting its potential for real-world pathfinding applications.
Advancing UAV Path Planning System: A Software Pattern Language for Dynamic Environments Airlangga, Gregorius
Buletin Ilmiah Sarjana Teknik Elektro Vol. 5 No. 4 (2023): December
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/biste.v5i4.9407

Abstract

In the rapidly advancing domain of Unmanned Aerial Vehicle (UAV) technologies, the capability to navigate dynamic and unpredictable environments is paramount. To this end, we present a novel design pattern framework for real-time UAV path planning, derived from the established Pattern Language of Program Community (PLOP). This framework integrates a suite of software patterns, each selected for its role in enhancing UAV operational adaptability, environmental awareness, and resource management. Our proposed framework capitalizes on a blend of behavioral, structural, and creational patterns, which work in concert to refine the UAV's decision-making processes in response to changing environmental conditions. For instance, the Observer pattern is employed to maintain real-time environmental awareness, while the Strategy pattern allows for dynamic adaptability in the UAV's path planning algorithm. Theoretical analysis and conceptual evaluations form the backbone of this research, eschewing empirical experiments for a detailed exploration of the design's potential. By offering a systematic and standardized approach, this research contributes to the UAV field by providing a robust theoretical foundation for future empirical studies and practical implementations, aiming to elevate the efficiency and safety of UAV operations in dynamic environments.
Adaptive Cyber-Defense for Unmanned Aerial Vehicles: A Modular Simulation Model with Dynamic Performance Management Airlangga, Gregorius
Buletin Ilmiah Sarjana Teknik Elektro Vol. 5 No. 4 (2023): December
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/biste.v5i4.9415

Abstract

In light of escalating cyber threats, this study tackles the cybersecurity challenges in UAV systems, underscoring the limitations of static defense mechanisms. Traditional security approaches fall short against the sophisticated and evolving nature of cyber-attacks, particularly for UAVs that depend on real-time autonomy. Addressing this deficiency, we introduce an adaptive modular security system tailored for UAVs, enhancing resilience through real-time defensive adaptability. This system integrates scalable, modular components and employs machine learning techniques—specifically, neural networks and anomaly detection algorithm to improve threat prediction and response. Our approach marks a significant leap in UAV cybersecurity, departing from static defenses to a dynamic, context-aware strategy. By employing this system, UAV stakeholders gain the flexibility needed to counteract multifaceted cyber risks in diverse operational scenarios. The paper delves into the system's design and operational efficacy, juxtaposing it with conventional strategies. Experimental evaluations, using varied UAV scenarios, measure defense success rates, computational efficiency, and resource utilization. Findings reveal that our system surpasses traditional models in defense success and computational speed, albeit with a slight increase in resource usage a consideration for deployment in resource-constrained contexts. In closing, this research underscores the imperative for dynamic, adaptable cybersecurity solutions in UAV operations, presenting an innovative and proactive defense framework. It not only illustrates the immediate benefits of such adaptive systems but also paves the way for ongoing enhancements in UAV cyber defense mechanisms.
Comparative Analysis of MLP, CNN, and RNN Models in Automatic Speech Recognition: Dissecting Performance Metric Lenson, Abraham K. S.; Airlangga, Gregorius
Buletin Ilmiah Sarjana Teknik Elektro Vol. 5 No. 4 (2023): December
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/biste.v5i4.9668

Abstract

This study conducts a comparative analysis of three prominent machine learning models: Multi-Layer Perceptrons (MLP), Convolutional Neural Networks (CNN), and Recurrent Neural Networks (RNN) with Long Short-Term Memory (LSTM) in the field of automatic speech recognition (ASR). This research is distinct in its use of the LibriSpeech 'test-clean' dataset, selected for its diversity in speaker accents and varied recording conditions, establishing it as a robust benchmark for ASR performance evaluation. Our approach involved preprocessing the audio data to ensure consistency and extracting Mel-Frequency Cepstral Coefficients (MFCCs) as the primary features, crucial for capturing the nuances of human speech. The models were meticulously configured with specific architectural details and hyperparameters. The MLP and CNN models were designed to maximize their pattern recognition capabilities, while the RNN (LSTM) was optimized for processing temporal data. To assess their performance, we employed metrics such as precision, recall, and F1-score. The MLP and CNN models demonstrated exceptional accuracy, with scores of 0.98 across these metrics, indicating their effectiveness in feature extraction and pattern recognition. In contrast, the LSTM variant of RNN showed lower efficacy, with scores below 0.60, highlighting the challenges in handling sequential speech data. The results of this study shed light on the differing capabilities of these models in ASR. While the high accuracy of MLP and CNN suggests potential overfitting, the underperformance of LSTM underscores the necessity for further refinement in sequential data processing. This research contributes to the understanding of various machine learning approaches in ASR and paves the way for future investigations. We propose exploring hybrid model architectures and enhancing feature extraction methods to develop more sophisticated, real-world ASR systems. Additionally, our findings underscore the importance of considering model-specific strengths and limitations in ASR applications, guiding the direction of future research in this rapidly evolving field.
Optimizing UAV Navigation: A Particle Swarm Optimization Approach for Path Planning in 3D Environments Airlangga, Gregorius
Buletin Ilmiah Sarjana Teknik Elektro Vol. 5 No. 4 (2023): December
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/biste.v5i4.9696

Abstract

This study explores the application of Particle Swarm Optimization (PSO) in Unmanned Aerial Vehicle (UAV) path planning within a simulated three-dimensional environment. UAVs, increasingly prevalent across various sectors, demand efficient navigation solutions that account for dynamic and unpredictable elements. Traditional pathfinding algorithms often fall short in complex scenarios, hence the shift towards PSO, a bio-inspired algorithm recognized for its adaptability and robustness. We developed a Python-based framework to simulate the UAV path planning scenario. The PSO algorithm was tasked to navigate a UAV from a starting point to a predetermined destination while avoiding spherical obstacles. The environment was set within a 3D grid with a series of waypoints, marking the UAV's trajectory, generated by the PSO to ensure obstacle avoidance and path optimization. The PSO parameters were meticulously tuned to balance the exploration and exploitation of the search space, with an emphasis on computational efficiency. A cost function penalizing proximity to obstacles guided the PSO in real-time decision-making, resulting in a collision-free and optimized path. The UAV's trajectory was visualized in both 2D and 3D perspectives, with the analysis focusing on the path's smoothness, length, and adherence to spatial constraints. The results affirm the PSO's effectiveness in UAV path planning, successfully avoiding obstacles and minimizing path length. The findings highlight PSO's potential for practical UAV applications, emphasizing the importance of parameter optimization. This research contributes to the advancement of autonomous UAV navigation, indicating PSO as a viable solution for real-world path planning challenges.
Enhancing UAV Navigation in Dynamic Environments: A Detailed Integration of Fick's Law Algorithm for Optimal Pathfinding in Complex Terrains Airlangga, Gregorius
Buletin Ilmiah Sarjana Teknik Elektro Vol. 5 No. 4 (2023): December
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/biste.v5i4.9697

Abstract

In the realm of Unmanned Aerial Vehicles (UAVs), efficient navigation in complex environments is crucial, necessitating advanced pathfinding algorithms. This study introduces the Fick's Law Algorithm (FLA) for UAV path optimization, drawing inspiration from the principles of molecular diffusion, and positions it in the context of existing algorithms such as A* and Dijkstra's. Through a comparative analysis, we highlight FLA's unique approach and advantages in terms of computational efficiency and adaptability to dynamic obstacles. Our experiment, conducted in a simulated three-dimensional space with static and dynamic obstacles, involves an extensive quantitative analysis. FLA's performance is quantified through metrics like path length reduction, computation time, and obstacle avoidance efficacy, demonstrating a marked improvement over traditional methods. The technical foundation of FLA is detailed, emphasizing its iterative adaptation based on a cost function that accounts for path length and obstacle avoidance. The algorithm's rapid convergence towards an optimal solution is evidenced by a significant decrease in the cost function, supported by data from our convergence graph. Visualizations in both 2D and 3D effectively illustrate the UAV’s trajectory, highlighting FLA's efficiency in real-time path correction and obstacle negotiation. Furthermore, we discuss FLA's practical implications, outlining its adaptability in various real-world UAV applications, while also acknowledging its limitations and potential challenges. This exploration extends FLA's relevance beyond theoretical contexts, suggesting its efficacy in real-world scenarios. Looking ahead, future work will not only focus on enhancing FLA's computational efficiency but also on developing specific methodologies for real-world testing. These include adaptive scaling for different UAV models and environments, as well as integration with UAV hardware systems. Our study establishes FLA as a potent tool for autonomous UAV navigation, offering significant contributions to the field of dynamic path optimization.
Comparative Analysis of Machine Learning Models for Tree Species Classification from UAV LiDAR Data Airlangga, Gregorius
Buletin Ilmiah Sarjana Teknik Elektro Vol. 6 No. 1 (2024): March
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/biste.v6i1.10059

Abstract

Forest ecosystems play a pivotal role in maintaining global biodiversity and climate balance. The precise identification of tree species via remote sensing technologies is vital for effective ecological surveillance and forest stewardship. This research conducts a comparative analysis of various machine learning algorithms for the binary classification of tree species utilizing LiDAR data captured by Unmanned Aerial Vehicles (UAVs). We analyzed a dataset featuring 192 trees from a diverse forest, employing models such as Logistic Regression, Support Vector Machine (SVM), Random Forest, K-Nearest Neighbors (KNN), Gradient Boosting, and Decision Trees. These models were assessed on their accuracy, precision, recall, and F1-scores to ascertain their efficacy. Our findings reveal that Logistic Regression and SVM were superior, achieving precision and recall scores up to 0.96, indicating their robust predictive capability. In contrast, KNN underperformed, suggesting the need for parameter refinement. Although ensemble methods demonstrated resilience, they were more prone to overfitting in comparison to the more straightforward Logistic Regression and SVM models. Preliminary data preprocessing and feature engineering techniques are discussed, enhancing the models' performance. This work enriches the domain of remote sensing and ecological monitoring by offering an in-depth evaluation of machine learning models for tree species classification, underscoring their advantages and constraints. It underscores the transformative potential of machine learning in refining ecological analysis precision, thereby aiding in the pursuit of sustainable forest management. Future research directions could include model refinement through advanced feature selection or the exploration of novel machine learning algorithms for improved classification accuracy.
Co-Authors Afandi Nur Aziz Thohari, Afandi Nur Aziz Alamsyah - Amalia, Andika Elok Basuki, Widodo Widjaja Bata, Julius Victor Manuel Christanto, Henoch Juli Christiany Suwartono Denny Jean Cross Sihombing Denny Jean Cross Sihombing Eugenius Kau Suni Henoch Juli Christanto Julius Bata Julius Victor Manuel Bata KHAIRUL HUDA, KHAIRUL Kristian, Yoel Lenson, Abraham K. S. Lim, Bobi Hartanto Pramudita Makin, See Jong Nugroho, Oskar Ika Adi Pedro Manuel Lamberto Buu Sada Philia, Gregoria Piolo, Samuel Pujo Hari Saputro Rahmananta, Radyan Ronald Sukwadi Setiawan, Yohanes Evan Sidhunata, Billy Macarius Stephen Aprius Sutresno, Stephen Aprius Sugianto, Lai Ferry Suni, Eugenius Kau Wicaksana, Hilman Singgih