A general soft method for learning SVM classifiers with L1 L 1 -norm penalty ?
Based on the geometric interpretation of support vector machines (SVMs), this paper presents a general technique that allows almost all the existing L2 L 2 -norm penalty based geometric algorithms, including Gilbert's algorithm, SchlesingerKozinecs (SK) algorithm and MitchellDemyanovMalozemovs  (MDM) algorithm, to be softened to achieve the corresponding learning L1 L 1 -SVM classifiers. Intrinsically, the resulting soft algorithms are to find ? ? -optimal nearest points between two soft convex hulls. Theoretical analysis has indicated that our proposed soft algorithms are essentially generalizations of the corresponding existing hard algorithms, and consequently, they have the same properties of convergence and almost the identical cost of computation. As a specific example, the problem of solving ? ? -SVMs by the proposed soft MDM algorithm is investigated and the corresponding solution procedure is specified and analyzed. To validate the general soft technique, several real classification experiments are conducted with the proposed L1 L 1 -norm based MDM algorithms and numerical results have demonstrated that their performance is competitive to that of the corresponding L2 L 2 -norm based algorithms, such as SK and MDM algorithms.
classification support vector machines gilbert's algorithms nearest points soft convex hulls ? ? -svms ? ? ? ? ? schlesingerkozinec's algorithms mitchelldemyanovmalozemov's algorithms