Description Usage Arguments Details Value Author(s) See Also Examples
Soft and hard discretization of numerical data.
1 2 |
data |
a numerical |
numcats |
an |
mode |
a |
marginal |
a |
learnset |
observation indices to be used for setting the discretization parameters |
cover |
a numerical between 0 and 1, proportion of the sample to be used for setting the discretization parameters |
maxiter |
an |
eps |
a |
weights |
a |
The numerical data
is discretized into given number of categories, numcats
, using the empirical node quantiles.
As in all functions of catnet
package that accept data, if the data
parameter is a matrix
then it is organized in the row-node format. If it is a data.frame
, the column-node format is assumed.
The mode
specifies the discretization model.
Currently, two hard discretization methods are supported - "quantile" and "uniform", which is the default choice.
The quantile-based discretization method is applied as follows.
For each node, the sample node distribution is constructed,
which is then represented by a sum of non-intersecting classes separated by the quantile points of the sample distribution. Each node value is assigned the class index in which it falls into.
The uniform discretization breaks the range of values of each node into numcats
equal intervals or of lengths proportional to the corresponding qlevels
values.
Currently, the function assigns equal number of categories for each node of the data.
A matrix
or data.frame
of indices.
N. Balov
1 2 3 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.