Alternating local search based VNS for linear classification
From MaRDI portal
Publication:970175
DOI10.1007/S10479-009-0538-ZzbMATH Open1185.90136OpenAlexW2019620506MaRDI QIDQ970175FDOQ970175
Emilio Carrizosa, Steven De Bruyne, Frank Plastria
Publication date: 10 May 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0538-z
Recommendations
- Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients
- Arbitrary-norm hyperplane separation by variable neighbourhood search
- A tabu search with an oscillation strategy for the discriminant analysis problem
- Linear separation and approximation by minimizing the sum of concave functions of distances
- Variable Neighborhood Search
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- Variable neighborhood search
- Variable Neighborhood Search
- Title not available (Why is that?)
- Arbitrary-norm separating plane
- Misclassification minimization
- Optimal Expected-Distance Separating Halfspace
- Arbitrary-norm hyperplane separation by variable neighbourhood search
- Gauge distances and median hyperplanes
- Exact \(L_{2}\)-norm plane separation
Cited In (7)
- Supervised classification and mathematical optimization
- Variable neighbourhood search: methods and applications
- Face Representations via Tensorfaces of Various Complexities
- Optimization approaches to supervised classification
- Linear separation and approximation by minimizing the sum of concave functions of distances
- Multi-instance classification through spherical separation and VNS
- Minmax-distance approximation and separation problems: geometrical properties
Uses Software
This page was built for publication: Alternating local search based VNS for linear classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970175)
