A string with the name of the base algorithm. (Default:
options("utiml.base.algorithm", "SVM"))
p
Number of instances to prune. All labelsets that occurs p times or
less in the training data is removed. (Default: 3)
info.loss
Logical value where TRUE means discard infrequent
labelsets and FALSE means reintroduce infrequent labelsets via
subsets. (Default: FALSE)
...
Others arguments passed to the base algorithm for all subproblems
cores
Not used
seed
An optional integer used to set the seed. (Default:
options("utiml.seed", NA))
Value
An object of class PPTmodel containing the set of fitted
models, including:
labels
A vector with the label names.
model
A LP model contained only the most common labelsets.
Details
Pruned Problem Transformation (PPT) is a multi-class transformation that
remove the less common classes to predict multi-label data.
References
Read, J., Pfahringer, B., & Holmes, G. (2008). Multi-label classification
using ensembles of pruned sets. In Proceedings - IEEE International
Conference on Data Mining, ICDM (pp. 995<U+2013>1000).
Read, J. (2008). A pruned problem transformation method for multi-label
classification. In Proceedings of the New Zealand Computer Science
Research Student Conference (pp. 143-150).
# NOT RUN {model <- ppt(toyml, "RANDOM")
pred <- predict(model, toyml)
# }# NOT RUN {##Change default configurationsmodel <- ppt(toyml, "RF", p=4, info.loss=TRUE)
# }