The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Aiming at the inseparable multi-class problem, a new multi-class SVM recognition algorithm of the decision tree based on the between-class dissimilarity matrix is presented after the two novel concepts of the shorter neighboring distance and the between -class dissimilarity matrix are defined. In the algorithm, the centroids of all the classes are firstly calculated. Then the between-class city-block...
In this paper, we present a new SVM model to calculate the optimal value of cost parameter C for particular problems of linearity non-separability of data. A lower bound, positive number, C0 is required to provide for avoiding choosing a candidate set of C. Numerical experiments show that this model for choice of is suitable for solving SVM problems.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.