SciRepID - Scientific Publication Search

Publication Search

41,520 articles from 397 journals · 1,447 citations tracked

Showing 1-3 of 3

Analytics

Andy Hermawan; Akbar Kanugraha; Indira Faisa Afgani; Khaerun Nisa’Tri Safaati; Mutiara Ayu Alzahra Ramadhani

Modem : Jurnal Informatika dan Sains Teknologi 2026 Asosiasi Profesi Telekomunikasi Dan Informatika Indonesia

The exponential growth of digital music catalogs on streaming platforms such as Spotify has made personalized recommendation systems crucial for enhancing user experience. This study develops a hybrid music recommendation system that addresses both warm-user and cold-user scenarios by combining Alternating Least Squares (ALS) collaborative filtering with content-based filtering (CBF) augmented by a popularity component. The dataset consists of 8,549,544 user-track interactions and a master file of 1,204,025 tracks with ten audio features. After preprocessing, users were segmented into 14,880 warm users and 723 cold users based on a five-interaction threshold. The ALS model was trained on the user-item implicit feedback matrix and tuned through grid search over factors, alpha, and regularization. CBF was implemented using cosine similarity on normalized audio features, while popularity scores were applied for new users with insufficient history. Evaluation used Precision@10, Recall@10, and NDCG@10. The final ALS configuration achieved NDCG@10 of 0.1116, representing a 30% improvement over baseline, while the hybrid CBF improved NDCG@10 for cold users from 0.0070 to 0.0201. Findings indicate that adaptive routing among ALS, CBF, and popularity reliably handles different user states, providing a practical foundation for production-grade music recommendation systems.

Eka Prasetya Adhy Sugara; Nurul Azwanti; Ivy Derla

Journal of Information Technology and Computer Science 2025 International Forum of Researchers and Lecturers

This paper explores the application of quantum-inspired optimization algorithms in the training of large-scale Graph Neural Networks (GNNs) within distributed cloud-edge environments. GNNs have gained significant attention due to their ability to model complex relationships in graph-structured data, yet their training presents challenges such as high computational demand, inefficient resource allocation, and slow convergence, especially for large datasets. Traditional meta-heuristic algorithms, while useful, often face scalability and performance issues when applied to such large-scale tasks. To address these challenges, we propose a quantum-inspired meta-heuristic algorithm that leverages quantum principles, such as superposition and entanglement, to enhance optimization processes. The algorithm was integrated into a hybrid cloud-edge system, where computational tasks are dynamically distributed between edge nodes and the cloud, optimizing resource utilization and reducing latency. Our experimental results demonstrate significant improvements in training speed, resource efficiency, and convergence rate when compared to traditional optimization methods such as Genetic Algorithms and Simulated Annealing. The quantum-inspired algorithm not only accelerates the training process but also reduces memory usage, making it well-suited for large-scale GNN applications. Furthermore, the system's scalability was enhanced by the hybrid cloud-edge architecture, which balances computational load and enables real-time data processing. The findings suggest that quantum-inspired optimization algorithms can significantly improve the training of GNNs in distributed systems, opening new avenues for real-time applications in areas such as social network analysis, anomaly detection, and recommendation systems. Future work will focus on refining these algorithms to handle even larger datasets and more complex GNN architectures, with potential integration into edge devices for enhanced real-time decision-making.

Novi Siti Juariah; Rizky Pratama .H; Melda Ayu Nengsi

International Journal of Applied Mathematics and Computing 2024 Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Collaborative filtering systems rely heavily on matrix factorization techniques, which often face scalability issues when handling large datasets. This paper presents an efficient parallel algorithm that leverages distributed computing to perform largescale matrix factorization. Experimental results show that our algorithm significantly reduces computation time while maintaining high accuracy. The approach has practical implications for recommendation systems, particularly in ecommerce and social media platforms.