Article Per Year (5 Year)
p-Index From 2021 - 2026
0.817
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering JOIV : International Journal on Informatics Visualization Indonesian Journal of Electrical Engineering and Computer Science Engineering, Mathematics and Computer Science Journal (EMACS)
Dani, Yasi
Unknown Affiliation
Civil Engineering, Building, Construction & Architecture Computer Science & IT Electrical & Electronics Engineering Engineering Industrial & Manufacturing Engineering Mathematics

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

Found 4 Documents
Search

 1 
Comparison of Iris dataset classification with Gaussian naïve Bayes and decision tree algorithms Dani, Yasi; Artanta Ginting, Maria
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 2: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i2.pp1959-1968

Abstract

In this study, we apply two classification algorithm methods, namely the Gaussian naïve Bayes (GNB) and the decision tree (DT) classifiers. The Gaussian naïve Bayes classifier is a probability-based classification model that predicts future probabilities based on past experiences. Whereas the decision tree classifier is based on a decision tree, a series of tests that are performed adaptively where the previous test affects the next test. Both of these methods are simulated on the Iris dataset where the dataset consists of three types of Iris: setosa, virginica, and versicolor. The data is divided into two parts, namely training and testing data, in which there are several features as information on flower characteristics. Furthermore, to evaluate the performance of the algorithms on both methods and determine the best algorithm for the dataset, we evaluate it using several metrics on the training and testing data for each method. Some of these metrics are recall, precision, F1-score, and accuracy where the higher the value, the better the algorithm's performance. The results show that the performance of the decision tree classifier algorithm is the most outperformed on the Iris dataset.
Two-Layer Shallow Water Equations with Momentum Conservative Scheme for Wave Propagation Simulation Ginting, Maria Artanta; Suandi, Dani; Dani, Yasi
Engineering, MAthematics and Computer Science Journal (EMACS) Vol. 6 No. 1 (2024): EMACS
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/emacsjournal.v6i1.10786

Abstract

In this paper, we discuss the implementation of momentum conservative scheme to shallow water equations (SWE). In shallow water model, the hydrodynamic pressure of the water is neglected. Here, the numerical calculation of mass and momentum conservation was applied on a staggered grid domain. The vertical interval was divided into two parts which made the computation quite efficient and accurate. Our focus is on the performance of the numerical scheme in simulating wave propagation and run-up phenomena, where the main challenge is to calculate the wave speed accurately and to count the non-linear term of the model. Here we also considered the wet and dry conditions of the topography. Three benchmark tests were picked out to validate the numerical scheme. A simulation of standing wave was carried out; the results were compared to the linear analytical solution and show a good fit. In addition, a simulation of harmonic wave propagation on a sloping beach was conducted, and the results closely align with the expected values from exact solution. Finally, we carried out a simulation of solitary wave with a sloping topography; and the results were compared to laboratory data. A good agreement was observed between the simulation results and experimental measurements.
Classification of Predicting Customer Ad Clicks Using Logistic Regression and k-Nearest Neighbors Dani, Yasi; Ginting, Maria Artanta
JOIV : International Journal on Informatics Visualization Vol 7, No 1 (2023)
Publisher : Society of Visual Informatics

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30630/joiv.7.1.1017

Abstract

Nowadays, conventional marketing techniques have changed to online (digital) marketing techniques requiring internet access. Online marketing techniques have many advantages, especially in terms of cost efficiency and fast information delivery to the public. Therefore, many companies are interested in online marketing and advertising on social media platforms and websites. However, one of the challenges for companies in online marketing is determining the right target consumers since if they target consumers who are not interested in buying the product, the advertising costs will be high. One use of online advertising is clicks on ads which is a marketing measurement of how many users click on the online ad. Thus, companies need a click prediction system to know the right target consumers. And different types of advertisers and search engines rely on modeling to predict ad clicks accurately. This paper constructs the customer ad clicks prediction model using the machine learning approach that becomes more sophisticated in effectively predicting the probability of a click. We propose two classification algorithms: the logistic regression (LR) classifier, which produces probabilistic outputs, and the k-nearest neighbors (k-NN) classifier, which produces non-probabilistic outputs. Furthermore, this study compares the two classification algorithms and determines the best algorithm based on their performance. We calculate the confusion matrix and several metrics: precision, recall, accuracy, F1-score, and AUC-ROC. The experiments show that the logistic regression algorithm performs best on a given dataset.
Stable and accurate customer churn prediction: comparative analysis of eight classification algorithms Haris, Vincent Alexander; Arsyad, Muhammad Ilyas; Adi Nugraha, Nathanael Septhian; Dani, Yasi; Ginting, Maria Artanta
Indonesian Journal of Electrical Engineering and Computer Science Vol 41, No 2: February 2026
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v41.i2.pp655-665

Abstract

Predicting customer churn is a challenging problem in many subscription-based industries, though it is considered more cost-effective than acquiring new customers. In this research, customer churn is predicted using a public dataset from an internet service provider, with 72,274 instances and 55% churn rate. The main contribution is to provide a comprehensive comparison of the stability and performance of eight classification algorithms in customer churn prediction using a large-scale public dataset. The research process includes data collection, data preprocessing, feature engineering, and model evaluation. The metrics evaluation presents test accuracy, accuracy gap, precision, recall, F1-Score, and ROC AUC, with stratified K-Fold cross-validation. Since the proportion of churn and non-churn in the dataset is relatively balanced, the F1-score is considered as the primary evaluation metric, as it provides a balanced assessment of precision and recall for both classes. The results show that CatBoost and XGBoost are the most effective models that achieve high F1-scores of 94.97% and 94.92%, respectively.
Co-Authors Adi Nugraha, Nathanael Septhian Arsyad, Muhammad Ilyas Artanta Ginting, Maria Dani Suandi Ginting, Maria Artanta Haris, Vincent Alexander