...ch is to use algorithms which determine the points from � � � � � or their convex combinations. The separating hyperplane is spread on them. Kozinec’s algorithm (Kozinec, 1973) and its modifications (=-=Franc and Hlaváč, 2003-=-) belong to this group. A drawback of these algorithms is the assumption that the sets are linearly separable. Sometimes it is impossible to fulfil this condition a priori. Jó´zwik’s algorithm (Jó´zwi...

...which are originally non-separable. But this is done by investigating the solution in a space whose dimension is much higher than the original one (Cristianini and ShaweTaylor, 2000; Jankowski, 2003; =-=Mangasarian, 2000-=-). Unlike the above-mentioned group, the algorithm which is296 presented here finds a solution in the space � , where is the dimension of the original space. In this paper an example of using the ori...

...to separate sets which are originally non-separable. But this is done by investigating the solution in a space whose dimension is much higher than the original one (Cristianini and ShaweTaylor, 2000; =-=Jankowski, 2003-=-; Mangasarian, 2000). Unlike the above-mentioned group, the algorithm which is296 presented here finds a solution in the space � , where is the dimension of the original space. In this paper an examp...