Description Usage Arguments Details Value References See Also Examples
Create a Hierarchy Of Multilabel classifiER (HOMER).
1 2 3 4 5 6 7 8 9 10 |
mdata |
A mldr dataset used to train the binary models. |
base.algorithm |
A string with the name of the base algorithm. (Default:
|
clusters |
Number maximum of nodes in each level. (Default: 3) |
method |
The strategy used to organize the labels (create the meta-labels). The options are: "balanced", "clustering" and "random". (Default: "balanced"). |
iteration |
The number max of iterations, used by balanced or clustering methods. |
... |
Others arguments passed to the base algorithm for all subproblems. |
cores |
The number of cores to parallelize the training. Values higher
than 1 require the parallel package. (Default:
|
seed |
An optional integer used to set the seed. (Default:
|
HOMER is an algorithm for effective and computationally efficient multilabel classification in domains with many labels. It constructs a hierarchy of multilabel classifiers, each one dealing with a much smaller set of labels.
An object of class HOMERmodel containing the set of fitted
models, including:
A vector with the label names.
The number of nodes in each level
The Hierarchy of BR models.
Tsoumakas, G., Katakis, I., & Vlahavas, I. (2008). Effective and efficient multilabel classification in domains with large number of labels. In Proc. ECML/PKDD 2008 Workshop on Mining Multidimensional Data (MMD'08) (pp. 30-44). Antwerp, Belgium.
Other Transformation methods:
brplus(),
br(),
cc(),
clr(),
dbr(),
ebr(),
ecc(),
eps(),
esl(),
lift(),
lp(),
mbr(),
ns(),
ppt(),
prudent(),
ps(),
rakel(),
rdbr(),
rpc()
1 2 3 4 5 6 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.