Aug 2026· Informatica· Vol 50· 0 citations· 70 references
TL;DR
Experimental results show that the proposed method achieves the highest macro-averaged precision and significantly outperforms classical baselines while remaining competitive with state-of-the-art modelbased approaches, demonstrating the effectiveness of the proposed framework in delivering personalized learning resources.
Abstract
This paper introduces HyperR, an integrated framework that combines hyperparameter optimization with a rule-based book recommender for developer profiling on Stack Overflow. The proposed optimizationmethod employs a cost-bounded, accuracy-aware strategy with early stopping and adaptive search to balance computational efficiency and search effectiveness. The framework evaluates both model-free (Grid Search, Random Search, Nelder–Mead, DEoptim) and model-based (Bayesian Optimization, AutoFT, mlrMBO,TuRBO) optimizers across multiple classifiers on a dataset of 20,000 Stack Overflow questions, using stratified 70/30 train-test splits with 20 repeated runs per configuration. Experimental results show that the proposed method achieves the highest macro-averaged precision (0.671) and significantly outperformsclassical baselines (adjusted p < 0.008), while remaining competitive with state-of-the-art modelbased approaches (adjusted p > 0.05). In addition, it reduces peak memory usage by up to 25% compared with exhaustive search methods. The recommendation module achieves strong performance (Precision@3= 0.82 and Recall@3 = 0.77), demonstrating the effectiveness of the proposed framework in delivering personalized learning resources.
Approximate nearest neighbor search (ANNS) is a critical component in modern data-intensive applications, but its performance is often hindered by the use of a static query budget parameter. This one-size-fits-all approach, even if well-tuned, fails to account for the varying difficulty of individual queries, inevitabl...
Jonghyun Bae, Tae Jun Ham, Alan Li et al.· Proceedings of the VLDB Endo...· 0 citations
Industrial ranking systems often rely on sorting by predicted Click-Through Rate (CTR). However, current CTR models heavily depend on features derived from user behavioral signals and struggle to accurately rank cold items in the case of insufficient user behavioral data. To address this challenge, we introduce UCB-FE,...
Anastasiia Soboleva, Andrey Pudovikov, Aleksandr Katrutsa et al.· Proceedings of the 32nd ACM...· 0 citations
Ranking-constraint counterfactual explanation for sequential recommendation requires query-limited search to decide where to edit and what to substitute—the bottlenecked for query efficiency lies more in how the search space is structured than in the mutation rate alone. We propose TRACE (Targeted Ranking-Aware Counter...
Ungsik Kim, Sang-Min Choi, Gun-Woo Kim et al.· Proceedings of the 20th ACM...· 1 citation
SWIM (Step-Wise Integrated Measure), a list-level evaluator that models user behaviors as a finite-horizon prefix session-level survival process, and efficiently estimates continuation probabilities and utilities in parallel, satisfying strict industrial latency constraints.
Yuan Pu, Cheng-Hao Zhang, Chao Feng et al.· 0 citations
Offline evaluation is the dominant experimental paradigm in recommender systems research, enabling reproducible and cost-effective comparisons on historical interaction data. Yet, while considerable attention has been devoted to recommendation models and evaluation methodologies, the data processing decisions that prec...
Alberto Carlo Maria Mancino, Angela Di Fazio, Danilo Danese et al.· 0 citations