cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
De Rosal Ignatius Moses Setiadi
Contact Email
moses@dsn.dinus.ac.id
Phone
-
Journal Mail Official
editorial.jcta@gmail.com
Editorial Address
H building, Dian Nuswantoro University Imam Bonjol street no. 207 Semarang, Central Java, Indonesia
Location
Kota semarang,
Jawa tengah
INDONESIA
Journal of Computing Theories and Applications
Published by Universitas Dian Nuswantoro
ISSN : -     EISSN : 30249104     DOI : 10.62411/jcta
Core Subject : Science,
Computer Science & IT Decision Sciences, Operations Research & Management
Journal of Computing Theories and Applications (JCTA) is a refereed, international journal that covers all aspects of foundations, theories and the practical applications of computer science. FREE OF CHARGE for submission and publication. All accepted articles will be published online and accessed for free. The review process is carried out rapidly, about two until three weeks, to get the first decision. The journal publishes only original research papers in the areas of, but not limited to: Artificial Intelligence Big Data Bioinformatics Biometrics Cloud Computing Computer Graphics Computer Vision Cryptography Data Mining Fuzzy Systems Game Technology Image Processing Information Security Internet of Things Intelligent Systems Machine Learning Mobile Computing Multimedia Technology Natural Language Processing Network Security Pattern Recognition Signal Processing Soft Computing Speech Processing Special emphasis is given to recent trends related to cutting-edge research within the domain. If you want to become an author(s) in this journal, you can start by accessing the About page. You can first read the Policies section to find out the policies determined by the JCTA. Then, if you submit an article, you can see the guidelines in the Author Guidelines or Author Guidelines section. Each journal submission will be made online and requires prospective authors to register and have an account to be able to submit manuscripts.
Arjuna Subject : Ilmu Komputer (semua kategori) - Visi Komputer dan Pengenalan Pola
Articles 6 Documents
 1 
Search results for , issue "Vol. 3 No. 1 (2025): JCTA 3(1) 2025 - in progress" : 6 Documents clear
A Machine Learning Based Approach to Course and Career Recommendation System: A Systematic Literature Review Iorzua, Joseph Tersoo; Moses, Timothy; Eke, Christopher Ifeanyi; Agushaka, Ovre Jeffery; Kwaghtyo, Dekera Kenneth; Godswill, Theophilus
Journal of Computing Theories and Applications Vol. 3 No. 1 (2025): JCTA 3(1) 2025 - in progress
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62411/jcta.12603

Abstract

Learners are continually faced with choosing appropriate courses or making career choices due to increased educational opportunities. The emergence of machine learning-based course and career recommender systems has the potential to address this issue, offering personalized course recommendations tailored to individual learning pathways, preferences, and learning history. The optimization and feature engineering techniques and practical deployment environments have not been collectively examined in the previous research, despite the significant advancements in this area of research. Furthermore, previous research has rarely synthesized how these technical components help students choose appropriate courses and careers. This systematic review was carried out to investigate the current state of machine learning-based course and career recommender systems, focusing on key elements, such as primary data sources, feature engineering methods, algorithms, optimization techniques, evaluation metrics, and the environments where the existing course recommendation models are deployed. The PRISMA method for conducting a systematic review was used to choose studies that met the requirements for inclusion and exclusion. The study findings show significant reliance on interpretable and traditional machine learning algorithms, such as K-Nearest Neighbor and Random Forest, to develop recommender models. Feature engineering remains basic, as most studies rely on normalization, while optimization processes are often underreported. Also, evaluation metrics varied widely, impeding comparability, while most of the recommender models are deployed in an e-learning environment, leaving the traditional learning environment underrepresented. Furthermore, the study findings identified issues including data sparsity and diversity, data security and privacy, and changes in learner preferences that may have an impact on the performance of recommender systems while recommending further studies to make use of standardized optimization methods, and automated domain-informed feature engineering frameworks, benchmark and annotated datasets in developing models the gives priority to learners’ success and educational relevance.
Explainable Bayesian Network Recommender for Personalized University Program Selection Kikunda, Philippe Boribo; Ndikumagenge, Jérémie; Ndayisaba, Longin; Nsabimana, Thierry
Journal of Computing Theories and Applications Vol. 3 No. 1 (2025): JCTA 3(1) 2025 - in progress
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62411/jcta.12720

Abstract

In a context where students face increasingly complex academic choices, this work proposes a recommendation system based on Bayesian networks to guide new baccalaureate holders in their university choices. Using a dataset containing variables such as secondary school section, gender, type of school, percentage obtained, age, and first-year honors, we have constructed a probabilistic model capturing the dependencies between these characteristics and the option chosen. The data is collected at the Catholic University of Bukavu, the Official University of Bukavu, and the Higher Institute of Education of Bukavu, preprocessed and then used to learn the structure via the hill-climbing algorithm with the BIC score using R's bnlearn tool. The model enables us to estimate the probability that a candidate will choose a given stream, depending on their profile. The approach has been validated using metrics such as BIC, cross-validation, and bootstrap and offers a good compromise between interpretability and predictive performance. The results highlight the potential of Bayesian networks in constructing explainable recommendation systems in the field of academic guidance. The system produces orientation probability maps for each candidate, which can be used by enrollment service advisers, as well as an ordered list of options relevant to the candidate's profile. With a remarkable performance on a test sample of precision@k=0.85, recall@k=0.61, ndcg=0.8, and Map=0.88, it constitutes an effective lever for reducing the risk of being misdirected in universities in South-Kivu, in the Democratic Republic of Congo
A Novel Clustering Solution Based on Energy Threshold for Energy Efficiency Purposes in Wireless Sensor Networks Vu, Thang C.; Do, Binh D.; Nguyen, Mui D.; Nguyen, Dung T.; Nguyen, Tao V.; Dinh, Long Q.; Nguyen, Hung T.; Nguyen, Minh T.
Journal of Computing Theories and Applications Vol. 3 No. 1 (2025): JCTA 3(1) 2025 - in progress
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62411/jcta.13022

Abstract

In many wireless sensor network (WSN) applications, nodes are randomly deployed and self-organize into a wireless network to perform tasks. In practice, recharging the batteries of network nodes after deployment is often difficult. Network nodes often operate autonomously, so the main focus is on increasing the node lifetime. Data redundancy is another limitation that makes nodes inefficient. In most cases, densely deployed nodes in a monitoring area will have redundant data from neighboring nodes. Therefore, we propose a clustering technique to select the Cluster Head (CH) node in small-scale WSNs. Since transmission consumes more energy than data collection, this protocol enables reactive routing, where transmission occurs only when a certain threshold is reached. In addition, based on their heterogeneous energy levels, nodes can be grouped into three categories: Normal, Intermediate, and Advanced. Simulation results in MATLAB/Simulink show that, after approximately 3000 rounds, the proposed method successfully transmitted about 3.1 × 104 packets to the base station, compared to 2.3 × 104 packets for the Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. In addition, the time when the last node died was approximately 3,500 rounds, whereas the LEACH protocol only maintained about 1,500 rounds. The results have shown the effectiveness of this technique in reducing the dead node rate and increasing packet transmission efficiency.
An Integrated Framework for Optimizing Customer Retention Budget using Clustering, Classification, and Mathematical Optimization Prashanthan, Amirthanathan
Journal of Computing Theories and Applications Vol. 3 No. 1 (2025): JCTA 3(1) 2025 - in progress
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62411/jcta.13194

Abstract

The study presents a comprehensive framework for optimizing customer retention budget by integrating clustering, classification, and mathematical optimization techniques. The study begins with the IBM Telco dataset, which is prepared through data cleansing, encoding, and scaling.  In the preliminary phase, customer segmentation is performed using K-Means clustering, with k = 3 and k = 4 identified as optimal based on the elbow method and Silhouette score. The configurations produced three (Premium, Standard, Low) and four (Premium, Standard Plus, Standard, Low) customer segments based on purchase preferences, which served as input features for churn prediction. In the second phase, the dataset was divided into training and test sets in an 80:20 ratio, followed by data balancing using the Synthetic Minority Over-sampling Technique (SMOTE) and Edited Nearest Neighbors (ENN). Multiple classification algorithms were evaluated, including Naive Bayes (NB), Random Forest (RF), Categorical Boosting (CatBoost), Light Gradient Boosting Machine (LightGBM), Extreme Gradient Boosting (XGBoost), Gradient Boosting (GB), Support Vector Machine (SVM), Logistic Regression (LR), K-Nearest Neighbors (KNN), and Multi-Layer Perceptron (MLP) using F1-score as the performance metric. CatBoost and LightGBM, with k values of 3 and 4, respectively, were the highest-performing classification models, with only minimal differences in performance.    Ultimately, customer segmentation established customer prioritization, whereas churn prediction assessed customer churn likelihood. Four distinct configurations were assessed utilizing mixed-integer linear programming (MILP) to optimise retention budget allocation within uniform budget constraints, discount amounts, and churn thresholds. In both the k=3 and k=4 scenarios, CatBoost surpassed LightGBM, with CatBoost at K=3 effectively discounting 66% of at-risk consumers across all three segments, hence improving the intervention's efficacy and budget allocation, making it the ideal choice for maximizing customer retention. The results demonstrate the importance of segmentation in enhancing retention budgeting and budget optimization, particularly concerning parameter sensitivity.
Indoor Positioning using Smartphones: An Improved Time-of-Arrival Technique Vu, Thang C.; Nguyen, Trung H.; Nguyen, Mui D.; Nguyen, Dung T.; Nguyen, Tao V.; Dinh, Long Q.; Nguyen, Minh T.
Journal of Computing Theories and Applications Vol. 3 No. 1 (2025): JCTA 3(1) 2025 - in progress
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62411/jcta.13305

Abstract

Indoor positioning technology based on smartphones plays an important role in the current technological development context. Especially in applications such as warehouses, supermarkets, hospitals, or buildings. While the global positioning system (GNSS) is popular and effective outdoors, it has several limitations when operating in enclosed spaces, such as indoors, due to the complexity of these environments. Smartphones have many built-in sensors (such as light sensors, sound sensors, gyroscopes, accelerometers, and magnetic sensors) and support the connection of various types of wireless communication technologies such as Wi-Fi and Bluetooth. However, such sensors were not initially developed for positioning applications. This study addresses the positioning problem using the MUSIC technique in conjunction with the Time of Arrival (ToA) method. The effectiveness of the positioning solution is evaluated through the signal-to-noise ratio (SNR) index. The absolute error and squared error indices are evaluated through the cumulative distribution function (CDF) to indicate the effectiveness of the proposed solution. Additionally, we propose a Pedestrian Dead Reckoning method to determine a person's position in indoor environments continuously. Based on the segmentation of the moving process by turns, the direction measurements in each segment are processed using a Kalman filter, which is designed to enhance the results achieved by the system. We also discuss the challenges and some future research directions in the field of smartphone-based indoor positioning.
IoT-Based Home Electricity Monitoring and Consumption Forecasting using k-NN Regression for Efficient Energy Management Angdresey, Apriandy; Sitanayah, Lanny; Rumpesak, Zefanya Marieke Philia; Ooi, Jing-Quan
Journal of Computing Theories and Applications Vol. 3 No. 1 (2025): JCTA 3(1) 2025 - in progress
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62411/jcta.13602

Abstract

Electricity has emerged as an essential requirement in modern life. As demand escalates, electricity costs rise, making wastefulness a drain on financial resources. Consequently, forecasting electricity usage can enhance our management of consumption. This study presents an IoT-based monitoring and forecasting system for electricity consumption. The system comprises two NodeMCU micro-controllers, a PZEM-004T sensor for collecting real-time power data, and three relays that regulate the current flow to three distinct electrical appliances. The data gathered is transmitted to a web application utilizing the k-Nearest Neighbor (k-NN) algorithm to forecast future electricity usage based on historical patterns. We evaluated the system's performance using four weeks of electricity consumption data. The results indicated that predictions were most accurate when the user’s daily consumption pattern remained stable, achieving a Mean Absolute Error (MAE) of approximately 1 watt and a Mean Absolute Percentage Error (MAPE) ranging from 1% to 1.7%. Additionally, predictions were notably precise during the early morning hours (3:00 AM to 8:00 AM) when k=6 was employed. This study demonstrates the effectiveness of integrating IoT-based systems with machine learning for real-time energy monitoring and forecasting. Furthermore, it emphasizes the application of data mining techniques within embedded IoT environments, providing valuable insights into the implementation of lightweight machine learning for smart energy systems.

Page 1 of 1 | Total Record : 6

 1 

Filter by Year

2025 2025


Reset
Filter By Issues
All Issue Vol. 3 No. 1 (2025): JCTA 3(1) 2025 - in progress Vol. 2 No. 4 (2025): JCTA 2(4) 2025 Vol. 2 No. 3 (2025): JCTA 2(3) 2025 Vol. 3 No. 2 (2025): in progress Vol. 2 No. 2 (2024): JCTA 2(2) 2024 Vol. 2 No. 1 (2024): JCTA 2(1) 2024 Vol. 1 No. 4 (2024): JCTA 1(4) 2024 Vol. 1 No. 3 (2024): JCTA 1(3) 2024 Vol. 1 No. 2 (2023): JCTA 1(2) 2023 Vol. 1 No. 1 (2023): JCTA 1(1) 2023