ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Background in machine learning and data mining”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

math.STcs.LGmath.PREmpiricalRecentJun 4, 2026

How abundant are good interpolators?

August Y. Chen, Ahmed El Alaoui

This paper establishes a large deviation principle for the generalization error of interpolating classifiers in the overparametrized regime.

View →
stat.MLcs.LGEmpiricalRecentJun 28, 2026

Gradient boosting with vector-valued leafs

David Cortes

This paper extends gradient boosting to functions of vector inputs using a simple algorithm with histogram-based decision trees.

View →
cs.NEcs.LGEmpiricalRecentJun 30, 2026

Evaluation of Population Initialization Methods for Genetic Programming-based Symbolic Regression

Lukas Kammerer, Gabriel Kronberger, Deaglan J. Bartlett, Harry Desmond +2 more

This paper compares the effect of different initialization methods on the accuracy and complexity of solutions in genetic programming for symbolic regression, finding no significant differences.

View →
stat.MEstat.MLEmpiricalRecentJul 22, 2026

Twoblock clustering trees with coskewness-based dimension reduction: recovering piecewise multivariate linear regimes

Sven Serneels

The twoblock clustering tree is introduced as a new type of interpretable regression tree for multivariate responses, using local multivariate linear models as leaves and twoblock dimension reduction…

View →
cs.CRRecentMay 6, 2026

Assessing Generalisation Capability of Machine Learning Models for Intrusion Detection

Md Zakir Hossain, Md Ayshik Rahman Khan, Md Rafiqul Islam, Syed Mohammed Shamsul Islam +1 more

The study assesses the generalization capability of supervised machine learning models for intrusion detection using UNSW-NB15 and TON_IoT, finding a significant performance drop when models are teste…

View →
cs.DBcs.AIcs.DCEmpiricalRecentJul 3, 2026

Scalable Maximal Frequent Episode Mining with Desbordante

Maxim Ivanov, Matvei Smirnov, Alisa Strazdina, George Chernishev

This paper presents an improved parallel version of MaxFEM algorithm for maximal frequent episode mining, achieving up to 8x speedup in C++ implementation and 35x improvement overall.

View →
cs.LGcs.AIRecentMay 29, 2026

From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets

Zakk Heile, Hayden McTavish, Varun Babbar, Margo Seltzer +1 more

The paper introduces PRAXIS, a novel algorithm that efficiently approximates the computation of 'Rashomon sets' for decision trees, significantly reducing memory and runtime complexity.

View →
cs.CRcs.NIRecentApr 25, 2026

Advanced Anomaly Detection and Threat Intelligence in Zero Trust IoT Environments Using Machine Learning

Muhammad Umair Basharat, Jawad Hussain, Waqas Khalid, Chiew Foong Kwong

This paper enhances anomaly detection and threat intelligence in Zero Trust IoT environments by applying and comparing various machine learning classifiers, notably using SMOTE to improve accuracy on…

View →
cs.CRcs.LGRecentApr 24, 2026

Detecting Concept Drift in Evolving Malware Families Using Rule-Based Classifier Representations

Tomáš Kalný, Martin Jureček, Mark Stamp

The paper proposes a structural method using decision tree rulesets and multiple complementary metrics to detect concept drift in evolving malware families, finding that fixed-interval windowing with…

View →
cs.LGcs.AIRecentMay 28, 2026

The Little Book of Generative AI Foundations: An Intuitive Mathematical Primer

Tianhua Chen

This book provides a compact, derivation-oriented mathematical primer that connects major families of generative AI models, showing their underlying structural relationships.

View →
stat.MLcs.LGEmpiricalRecentJun 12, 2026

Gradient boosting for extremes: sampling theory and application to insurance

Stéphane Lhaut, Olivier Lopez

This paper develops statistical learning theory for gradient boosting in Peaks-over-Threshold modeling using Generalized Pareto distributions, deriving error bounds and reducing gradient correlation.

View →
cs.LGcs.AIRecentMay 29, 2026

ChurnNet: A Optimized Modern AI for Churn Prediction

Syed Saad Saif, Giulio Maggiore, Paolo Russo, Damiano Distante

This paper compares traditional machine learning models (Random Forests, XGBoost, SVM) against a complex Unified Multi-Task Time Series Model for churn prediction, concluding that conventional methods…

View →
cs.CRcs.AIcs.LGRecentMay 29, 2026

Improving IoT Intrusion Detection Through SMOTE-Based Oversampling and Extended Multi-Model Evaluation on Side-Channel Power Data

Muhammad Khuram Shahzad, Haseeb Khan, Muhammad Masood Khan, Mubashra Bibi

This paper improves IoT intrusion detection by addressing severe class imbalance using SMOTE and evaluating eight machine learning models, finding that Random Forest and Extra Trees achieve high perfo…

View →
cs.CRcs.AIcs.LGRecentMay 29, 2026

Improving IoT Intrusion Detection Through SMOTE-Based Oversampling and Extended Multi-Model Evaluation on Side-Channel Power Data

Muhammad Khuram Shahzad, Haseeb Khan, Muhammad Masood Khan, Mubashra Bibi

This paper improves IoT intrusion detection by addressing severe class imbalance using SMOTE and comparing the performance of multiple machine learning models on side-channel power data, showing Rando…

View →
cs.AImath.OCRecentJun 1, 2026

Stochastic convergence of parallel asynchronous adaptive first-order methods

Serge Gratton, Philippe L. Toint

The paper analyzes a new class of asynchronous adaptive first-order optimization methods and proves their stochastic convergence rate is O(1/sqrt{t}) for non-convex functions.

View →
cs.NEcs.AIcs.DSRecentMay 28, 2026

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems

Benjamin Doerr, Pietro S. Oliveto, John Alasdair Warwicker

This paper introduces a method to automatically determine the optimal learning period ($ au$) for the Random Gradient hyper-heuristic, enabling it to optimally solve Pseudo-Boolean Problems without ma…

View →
cs.LGcs.AIcs.NERecentMay 28, 2026

Evolving Features vs Evolving Entire Trees with GP for Interpretable Survival Analysis

Thalea Schlender, Peter A. N. Bosman, Tanja Alderliesten

This paper proposes using genetic programming (GP) to jointly evolve both the feature sets and the structure of survival trees, resulting in highly interpretable and high-performing shallow models for…

View →