1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/CostSensWeightedPairsWrapper.R
\name{makeCostSensWeightedPairsWrapper}
\alias{makeCostSensWeightedPairsWrapper}
\alias{CostSensWeightedPairsWrapper}
\alias{CostSensWeightedPairsModel}
\title{Wraps a classifier for cost-sensitive learning to produce a weighted pairs model.}
\usage{
makeCostSensWeightedPairsWrapper(learner)
}
\arguments{
\item{learner}{(\link{Learner} | \code{character(1)})\cr
The classification learner.
If you pass a string the learner will be created via \link{makeLearner}.}
}
\value{
(\link{Learner}).
}
\description{
Creates a wrapper, which can be used like any other learner object.
Models can easily be accessed via \link{getLearnerModel}.
For each pair of labels, we fit a binary classifier.
For each observation we define the label to be the element of the pair with minimal costs.
During fitting, we also weight the observation with the absolute difference in costs.
Prediction is performed by simple voting.
This approach is sometimes called cost-sensitive one-vs-one (CS-OVO),
because it is obviously very similar to the
one-vs-one approach where one reduces a normal multi-class problem to
multiple binary ones and aggregates by voting.
}
\references{
Lin, HT.:
Reduction from Cost-sensitive Multiclass Classification to
One-versus-one Binary Classification.
In: Proceedings of the Sixth Asian Conference on Machine Learning.
JMLR Workshop and Conference Proceedings, vol 39, pp. 371-386. JMLR W&CP (2014).
\url{https://proceedings.mlr.press/v39/lin14.pdf}
}
\seealso{
Other costsens:
\code{\link{makeCostSensClassifWrapper}()},
\code{\link{makeCostSensRegrWrapper}()},
\code{\link{makeCostSensTask}()}
}
\concept{costsens}
|
