Name
Abstract | ||
|---|---|---|
Classical learning algorithms from the fields of artificial neural networks and machine learning, typically, do not take any costs into account or allow only costs depending on the classes of the examples that are used for learning. As an extension of class dependent costs, we consider costs that are example, i.e. feature and class dependent. We present a natural cost-sensitive extension of the support vector machine (SVM) and discuss its relation to the Bayes rule. We also derive an approach for including example dependent costs into an arbitrary cost-insensitive learning algorithm by sampling according to modified probability distributions. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-39857-8_5 | LECTURE NOTES IN ARTIFICIAL INTELLIGENCE |
Keywords | Field | DocType |
support vector machine,bayes rule,machine learning | Cost matrix,Computer science,Support vector machine,Probability distribution,Artificial intelligence,Sampling (statistics),Artificial neural network,Bayes' theorem | Conference |
Volume | ISSN | Citations |
2837 | 0302-9743 | 42 |
PageRank | References | Authors |
2.09 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ulf Brefeld | 1 | 633 | 51.89 |
| Peter Geibel | 2 | 286 | 26.62 |
| Fritz Wysotzki | 3 | 456 | 45.46 |