In this paper a new scheme is proposed for training of the support vector machine (SVM) with probabilistic constraints. In the SVM, a pattern recognition problem is coverted to a constraint quadratic programming . Each constraint is related to a training sample thereupon noisy data is caused appearance of incorrect support vector. Probabilistic constraints admit presence probably of samples in each class is applied based on a distribution function for determining suitable support vectors. In this way, it is possible noisy samples have low effect for finding support vectors. In the proposed method, SVm with the probabilistic constraints is converted to form of neural network model which can be described by the nonlinear dynamic system. A set of differential equations are defined for modelling of this dynamic and converges to optimal solution for the SVm with the probalistic problem. Another feature of the proposed method is solving both the primal and dual problem of SVM. Experimental results show the capabilistiy of the proposed method relative to conventional SVM>

Keywords