A method of synthesis of linear discriminant function in the case of nonseparability
References (9)
A penalty linear programming method using reduced-gradient basis-exchange techniques
Linear Algebra Applics
(1980)- et al.
There are more references available in the full text version of this article.
Cited by (22)
Piecewise-linear criterion functions in oblique survival tree induction
2017, Artificial Intelligence in MedicineThe feature selection bias problem in relation to high-dimensional gene data
2016, Artificial Intelligence in MedicineCitation Excerpt :Some are very similar to the CPL formula (10). 1-norm SVM [29] is even equivalent to the CPL formula (10), despite the fact that their genesis are different [30,28]. The RLS approach to the feature selection problem refers to the concept of the linear separability of the learning sets (3) [31].
Linear regression modeling of interval-censored survival times based on a convex piecewise-linear criterion function
2012, Biocybernetics and Biomedical EngineeringA new algorithm for learning in piecewise-linear neural networks
2000, Neural NetworksEfficient perceptron learning using constrained steepest descent
2000, Neural NetworksCitation Excerpt :We note that our algorithm provides a natural way of performing steepest descent in the perceptron weight space. In this sense it is related to the algorithm proposed by Bobrowski and Niemiro (Bobrowski & Niemiro, 1984; Bobrowski, 1991), whose algorithm is designed to chose steepest polytope edges, rather than steepest feasible directions. We shall refer to this method as the BN-method.
A survey of fuzzy clustering
1993, Mathematical and Computer Modelling
Copyright © 1984 Published by Elsevier B.V.