Name
Abstract | ||
|---|---|---|
Consider the classification task of assigning a test instance to one of two or more possible classes. An intuitive way to proceed is to assign the instance to that class, to which the distance is minimal. If one considers the distance to the convex hull of a class as a distance measure, then the resulting classification method is the Nearest Convex Hull (NCH) classifier. There are two key issues with this method per se that severely restrict its applicability, which we solve in this paper: first, how to handle class overlap, and second, how to provide (nonlinear) solutions with better generalization ability. The first problem is handled via using so-called kernel functions and slack variables. The second problem is dealt with using a penalization term that suppresses too complex solutions. We call the resulting method the soft-NCH classifier. In spirit and computationally the method is close to the popular Support Vector Machine (SVM) classifier and can be viewed as an instance-based large-margin classification technique. Advantages of the soft-NCH classifier include its robustness to outliers, good generalization ability and naturally easy handling of multi-class problems. We compare the performance of soft-NCH against state-of-art techniques and report promising results. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.3233/978-1-60750-606-5-841 | ECAI |
Keywords | Field | DocType |
convex hull | Computer science,Convex hull,Robustness (computer science),Artificial intelligence,Classifier (linguistics),Slack variable,Mathematical optimization,Pattern recognition,Support vector machine,Margin classifier,Machine learning,Kernel (statistics),Quadratic classifier | Conference |
Volume | ISSN | Citations |
215 | 0922-6389 | 0 |
PageRank | References | Authors |
0.34 | 13 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Georgi I. Nalbantov | 1 | 4 | 3.56 |
| Evgueni N. Smirnov | 2 | 24 | 20.38 |