Robust learning from bites for data mining
From MaRDI portal
data mininglogistic regressionrobustnesssupport vector machineinfluence functiondistributed computingbreakdown pointscalabilityconvex risk minimizationstatistical machine learning
Computational methods for problems pertaining to statistics (62-08) Statistical aspects of big data and data science (62R07) Learning and adaptive systems in artificial intelligence (68T05) Generalized linear models (logistic models) (62J12) Robustness and adaptive procedures (parametric inference) (62F35)
Recommendations
- Quantitative robustness of localized support vector machines
- On robustness properties of convex risk minimization methods for pattern recognition
- Support vector machines: A robust prediction method with applications in bioinformatics
- A review on consistency and robustness properties of support vector machines for heavy-tailed distributions
- On properties of support vector machines for pattern recognition in finite samples
Cites work
- scientific article; zbMATH DE number 3829050 (Why is no real title available?)
- scientific article; zbMATH DE number 3954047 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- 10.1162/1532443041827925
- A Bounded Influence, High Breakdown, Efficient Regression Estimator
- A fast dual algorithm for kernel logistic regression
- Asymptotic distributions of the maximal depth estimators for regression and multivariate location
- Bounded influence regression using high breakdown scatter matrices
- Comparison between various regression depth methods and the support vector machine to approximate the minimum number of misclassifications
- Consistency and robustness of kernel-based regression in convex risk minimization
- Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
- Convexity, Classification, and Risk Bounds
- Cube root asymptotics
- Depth weighted scatter estimators
- Fast and robust bootstrap for LTS
- Function Classes That Approximate the Bayes Risk
- Greedy function approximation: A gradient boosting machine.
- High breakdown-point and high efficiency robust estimates for regression
- How to compare different loss functions and their risks
- Learning Theory
- Least Median of Squares Regression
- On a strategy to develop robust and simple tariffs from motor vehicle insurance data
- On properties of support vector machines for pattern recognition in finite samples
- On robustness properties of convex risk minimization methods for pattern recognition
- On the influence of the kernel on the consistency of support vector machines
- Order Statistics
- Principal Components Analysis Based on Multivariate MM Estimators With Fast and Robust Bootstrap
- Regression Depth
- Robust Bootstrap with Non Random Weights Based on the Influence Function
- Statistical Analysis of Financial Data in S-Plus
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Stochastic gradient boosting.
- Support vector machines are universally consistent
- The Influence Curve and Its Role in Robust Estimation
- The Remedian: A Robust Averaging Method for Large Data Sets
- The asymptotics of S-estimators in the linear regression model
- The deepest regression method
Cited in
(4)
This page was built for publication: Robust learning from bites for data mining
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1020821)