Alternating local search based VNS for linear classification
نویسندگان
چکیده
منابع مشابه
Alternating local search based VNS for linear classification
We consider the linear classification method consisting of separating two sets of points in d-space by a hyperplane. We wish to determine the hyperplane which minimises the sum of distances from all misclassified points to the hyperplane. To this end two local descent methods are developed, one grid-based and one optimisation-theory based, and are embedded in several ways into a VNS metaheurist...
متن کاملLocal linear perceptrons for classification
A structure composed of local linear perceptrons for approximating global class discriminants is investigated. Such local linear models may be combined in a cooperative or competitive way. In the cooperative model, a weighted sum of the outputs of the local perceptrons is computed where the weight is a function of the distance between the input and the position of the local perceptron. In the c...
متن کاملA novel local search method for microaggregation
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
متن کاملLocal Linear Convergence for Alternating and Averaged Nonconvex Projections
The idea of a finite collection of closed sets having “linearly regular intersection” at a point is crucial in variational analysis. This central theoretical condition also has striking algorithmic consequences: in the case of two sets, one of which satisfies a further regularity condition (convexity or smoothness for example), we prove that von Neumann’s method of “alternating projections” con...
متن کاملA local search method for pattern classification
We present a new method to compute depth-three threshold circuits for pattern classi cation problems. The rst layer of the circuits is calculated from a sample set S of the classi cation problem by a local search strategy that minimises the error on S for each individual gate. The local search is based on simulated annealing with the logarithmic cooling schedule c(k) = = ln (k + 2). The paramet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2009
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-009-0538-z