Hierarchical linear support vector machine
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5957374 (Why is no real title available?)
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- 10.1162/15324430260185637
- A Parallel Mixture of SVMs for Very Large Scale Problems
- A hybrid SVM based decision tree
- A streaming parallel decision tree algorithm
- Bagging predictors
- Boosting the margin: a new explanation for the effectiveness of voting methods
- Core vector machines: fast SVM training on very large data sets
- Cost-sensitive learning and decision making for massachusetts pip claim fraud data
- Enlarging the margins in perceptron decision trees
- Generalization error bounds for threshold decision lists
- Improved boosting algorithms using confidence-rated predictions
- Inferring decision trees using the minimum description length principle
- LIBLINEAR: a library for large linear classification
- Learning decision trees from random examples
- Learning the set covering machine by bound minimization and margin-sparsity trade-off
- Learning with decision lists of data-dependent features
- Pegasos: primal estimated sub-gradient solver for SVM
- SGD-QN: careful quasi-Newton stochastic gradient descent
- Tree decomposition for large-scale SVM problems
- Very simple classification rules perform well on most commonly used datasets
Cited in
(4)
This page was built for publication: Hierarchical linear support vector machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454434)