Claim Missing Document
Check
Articles

Found 2 Documents
Search

SiMoI New Method to Solve the Sparsity Problem in Collaborative Filtering Kurniawan, Hendra; Lestari, Sri; Saleh, Sushanty; Satrio, Rafli Banu
Journal of Applied Data Sciences Vol 7, No 1: January 2026
Publisher : Bright Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47738/jads.v7i1.1015

Abstract

Sparsity data is a major challenge in collaborative recommendation systems, characterized by the predominance of missing values within the user-item matrix. When a substantial portion of data is unavailable, the estimation process becomes hindered, and prediction accuracy declines due to limited usable information. To address this issue, this study introduces a novel method called SiMoI (Similarity, Mode, and Minimum Imputation), which is adaptively designed to handle high levels of sparsity. The SiMoI method combines user similarity with imputation strategies based on mode and minimum values. By leveraging subsets of the most informative users and items, the method efficiently fills missing entries while maintaining prediction stability. Evaluation was conducted using both real and synthetic datasets with varying sizes and degrees of sparsity, including an extreme scenario with 93.7% missing data. Experimental results show that SiMoI consistently produces more accurate predictions than baseline methods. Under high-sparsity conditions, SiMoI achieved an RMSE as low as 0.823, outperforming KNNI (0.947) and MEAN (1.021). Moreover, SiMoI demonstrated resilience across different data scales and sparsity distributions, indicating its flexibility and scalability in diverse contexts. These findings suggest that SiMoI is an effective and stable approach for addressing sparsity and holds strong potential for implementation in user-based recommendation systems, particularly in real-world scenarios where data availability is frequently limited.
OPTIMALISASI PENANGANAN SPARSITY MENGGUNAKAN RANDOM FOREST, DEEP LEANING, DAN HOT-DECK IMPUTATION Lestari, Sri; Satrio, Rafli Banu; Kurniawan, Hendra; Saleh, Sushanty
JIPI (Jurnal Ilmiah Penelitian dan Pembelajaran Informatika) Vol 11, No 1 (2026)
Publisher : STKIP PGRI Tulungagung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29100/jipi.v11i1.7692

Abstract

Sparsity data dalam sistem rekomendasi dapat menurunkan akurasi prediksi dan relevansi saran. Penelitian ini membandingkan tiga metode imputasi—Random Forest Imputation, Deep Learning-Based Imputa-tion, dan Hot-Deck Imputation—dengan evaluasi menggunakan RMSE pada berbagai tingkat sparsitas. Hasil menunjukkan bahwa Random Forest Imputation consistently menghasilkan RMSE terendah di semua kondisi. Pada sparsitas 20%, metode ini lebih unggul dibandingkan Deep Learning-Based Imputation dengan selisih hingga 0.443 dan Hot-Deck Imputation hingga 0.338. Perbedaan RMSE se-makin meningkat seiring bertambahnya sparsitas, dengan selisih terbesar pada sparsitas tertinggi masing-masing dataset. Secara kese-luruhan, Random Forest Imputation terbukti paling efektif dalam me-nangani sparsitas dan meningkatkan akurasi rekomendasi.