Pages that link to "Item:Q427883"
From MaRDI portal
The following pages link to Minimizing the error of linear separators on linearly inseparable data (Q427883):
Displaying 9 items.
- Nonlinear separation of data via mixed 0-1 integer and linear programming (Q990586) (← links)
- PAC-learning in the presence of one-sided classification~noise (Q2254605) (← links)
- Separability of imprecise points (Q2362104) (← links)
- Regularizing conjunctive features for classification (Q2662672) (← links)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
- Error Localization for Erroneous Data: Continuous Data, Linear Constraints (Q3803966) (← links)
- Algorithms for Radon partitions with tolerance (Q5918766) (← links)
- Integer programming models and polyhedral study for the geodesic classification problem on graphs (Q6556086) (← links)
- Finding the largest separating rectangle among two point sets (Q6614025) (← links)