Claim Missing Document
Check
Articles

CLASSIFICATION ANALYSIS USING BOOTSTRAP AGGREGATING MULTIVARIATE ADAPTIVE REGRESSION SPLINE (BAGGING MARS) Rupilu, Rina Apriany Helen Wite; Rosadi, Dedi
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 18 No 3 (2024): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol18iss3pp1381-1390

Abstract

Classification analysis is a method used to classify or analyze the relationship between several predictor variables and response variables that aim to predict the class of an object whose label is unknown. This classification problem arises when a number of measures consist of one or more categories that cannot be defined directly but use a measure. MARS is one of the classification methods focused on overcoming high-dimensionality and discontinuity problems in data. The accuracy or classification level of the MARS method can be improved using a resampling method, namely bagging. This study will apply the MARS model to obtain a model for classifying the status of people with diabetes based on people with diabetes. The data used in this study is secondary data obtained from the Kaggle website which can be accessed through https://www.kaggle.com/uciml/pima-indians-diabetes-database, namely the Pima Indians Diabetes Database and processed using R software. The results of MARS modeling concluded that the probability of someone having diabetes is 0. The probability of someone not having diabetes is 1, with a classification accuracy of 81.38%. In contrast, the accuracy of the best MARS bagging method among 200 replications is 75.23%, so in this study, a more appropriate method is used to classify the status of people with diabetes.
Optimization hybrid weighted switching filtering (OHWSF) using SVD and SVD++ for addressing data sparsity Muhammad, Malim; Gunardi, Gunardi; Danardono, Danardono; Rosadi, Dedi
International Journal of Advances in Intelligent Informatics Vol 11, No 3 (2025): August 2025
Publisher : Universitas Ahmad Dahlan

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

Abstract

Recommender systems are crucial for filtering vast amounts of digital content and providing personalized recommendations; however, their effectiveness is often hindered by data sparsity, where limited user-item interactions lead to reduced prediction accuracy. This study introduces a novel hybrid model, Optimization Hybrid Weighted Switching Filtering (OHWSF), to overcome this challenge by integrating two complementary strategies: Hybrid Weighted Filtering (HWF), which linearly combines predictions from SVD and SVD++ using a weighting parameter (α), and Hybrid Switching Filtering (HSF), which dynamically selects predictions based on a threshold rating (θ). The OHWSF framework introduces a tunable optimization mechanism governed by the parameter σ₁ to adaptively balance weighting and switching decisions based on actual rating deviations. Unlike existing static or manually tuned hybrid methods, the proposed model combines dynamic switching with weight optimization to minimize prediction error effectively. Extensive experiments on four benchmark datasets (ML-100K, ML-1M, Amazon Cell Phones Reviews, and GoodBooks-10K) demonstrate that OHWSF consistently outperforms traditional collaborative filtering (UBCF, IBCF), matrix factorization techniques (SVD, SVD++), and standalone hybrid models across all evaluation metrics (MAE, MSE, RMSE). The model achieves optimal performance within the range of α = 0.6–0.9 and θ = 1.0–1.5, demonstrating robustness across varying sparsity levels. Notably, OHWSF achieves up to 742.16% MAE improvement over the UBCF model, with significantly reduced training time compared to SVD++. These findings confirm that OHWSF significantly improves prediction accuracy, scalability, and adaptability in sparse data environments. This research contributes a flexible, interpretable, and efficient hybrid recommendation framework suitable for real-world applications.
Integrating IndoBERT and balanced iterative reducing and clustering using hierarchies of BERTopic in Indonesian short text Muhajir, Muhammad; Gunardi, Gunardi; Danardono, Danardono; Rosadi, Dedi
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 14, No 5: October 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v14.i5.pp4192-4201

Abstract

Short text topic modeling remains challenging due to data sparsity, limited word co-occurrences, and unstable clustering results, particularly for Indonesian texts. This study proposes an improved BERTopic framework that integrates IndoBERT embeddings, best match 25 (BM25)-based topic representation, and balanced iterative reducing and clustering using hierarchies (BIRCH) clustering to address these issues. IndoBERT generates contextual embeddings adapted to Indonesian linguistic features, and BM25 weighting improves keyword relevance by considering document length and term saturation. BIRCH clustering minimizes outliers by assigning most documents to valid clusters, which enhances data utilization and topic stability. Experiments on Indonesian datasets from X (formerly Twitter), Google Reviews, and YouTube demonstrate that the proposed approach consistently achieves higher topic coherence. The proposed method yields stable topic diversity values between 0.91 and 0.94, maintains embedding density from 0.60 to 0.66, and achieves intra-topic similarity between 0.39 and 0.41 across increasing dataset sizes. The proposed framework successfully reduces outlier proportions to 1-5%, which significantly outperforms standard BERTopic and K-Means. Furthermore, the model maintains stable topic counts as the data volume grows, confirming robustness and scalability for sparse short text modeling. Overall, integrating IndoBERT, BM25, and BIRCH provides a more coherent, stable, and effective solution for Indonesian short text topic modeling.
Model Pengoptimuman Portofolio Mean-Variance dan Perkembangan Praktisnya Setiawan, Ezra Putranda; Rosadi, Dedi
Jurnal Optimasi Sistem Industri Vol. 18 No. 1 (2019): Published April 2019
Publisher : The Industrial Engineering Department of Engineering Faculty at Universitas Andalas

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/josi.v18.n1.p8-16.2019

Abstract

Many research about portfolio optimization in Indonesia still uses the ‘original’ mean-variance model as proposed by Markowitz more than 60 years ago. This article reviews the development and modification of the Markowitz’s mean-variance model, especially that dealing with real stock-market features, which could help the investor to create their own portfolio. There were several real-stock market features that implemented in the modification of mean-variance portfolios optimization models, such as the minimum transaction lots, the transaction cost, the cardinality constraint, the weight constraint, and the sectoral constraint. To implement these features, several heuristic methods were used to obtain the optimal portfolio weight, such as genetic algorithm, Tabu search, bee colony algorithm, particle swarm algorithm, and simulated annealing. These methods become alternative to the mathematical programming method.