Pages that link to "Item:Q2475608"
From MaRDI portal
The following pages link to Accurately learning from few examples with a polyhedral classifier (Q2475608):
Displaying 8 items.
- Combining discrete SVM and fixed cardinality warping distances for multivariate time series classification (Q991257) (← links)
- Efficient exemplars for classifier design (Q1912539) (← links)
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities (Q1948524) (← links)
- An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier (Q2225169) (← links)
- Semisupervised spherical separation (Q2285335) (← links)
- Support vector machine polyhedral separability in semisupervised learning (Q2342142) (← links)
- Efficient MIP techniques for computing the relaxation complexity (Q6095738) (← links)
- Maximum-margin polyhedral separation for binary multiple instance learning (Q6491336) (← links)
