17490
10507
sklearn.pipeline.Pipeline(trasformer=sklearn.compose._column_transformer.ColumnTransformer(cat=sklearn.pipeline.Pipeline(categorical_inputer=sklearn.impute._base.SimpleImputer,onehot=sklearn.preprocessing._encoders.OneHotEncoder)),estimator=sklearn.ensemble.gradient_boosting.GradientBoostingClassifier)
sklearn.Pipeline(ColumnTransformer,GradientBoostingClassifier)
sklearn.pipeline.Pipeline
1
openml==0.10.2,sklearn==0.21.3
Pipeline of transforms with a final estimator.
Sequentially apply a list of transforms and a final estimator.
Intermediate steps of the pipeline must be 'transforms', that is, they
must implement fit and transform methods.
The final estimator only needs to implement fit.
The transformers in the pipeline can be cached using ``memory`` argument.
The purpose of the pipeline is to assemble several steps that can be
cross-validated together while setting different parameters.
For this, it enables setting parameters of the various steps using their
names and the parameter name separated by a '__', as in the example below.
A step's estimator may be replaced entirely by setting the parameter
with its name to another estimator, or a transformer removed by setting
it to 'passthrough' or ``None``.
2020-01-11T14:41:31
English
sklearn==0.21.3
numpy>=1.6.1
scipy>=0.9
memory
None
null
Used to cache the fitted transformers of the pipeline. By default,
no caching is performed. If a string is given, it is the path to
the caching directory. Enabling caching triggers a clone of
the transformers before fitting. Therefore, the transformer
instance given to the pipeline cannot be inspected
directly. Use the attribute ``named_steps`` or ``steps`` to
inspect estimators within the pipeline. Caching the
transformers is advantageous when fitting is time consuming
steps
list
[{"oml-python:serialized_object": "component_reference", "value": {"key": "trasformer", "step_name": "trasformer"}}, {"oml-python:serialized_object": "component_reference", "value": {"key": "estimator", "step_name": "estimator"}}]
List of (name, transform) tuples (implementing fit/transform) that are
chained, in the order in which they are chained, with the last object
an estimator
verbose
boolean
false
If True, the time elapsed while fitting each step will be printed as it
is completed.
estimator
17437
1
sklearn.ensemble.gradient_boosting.GradientBoostingClassifier
sklearn.GradientBoostingClassifier
sklearn.ensemble.gradient_boosting.GradientBoostingClassifier
24
openml==0.10.2,sklearn==0.21.3
Gradient Boosting for classification.
GB builds an additive model in a
forward stage-wise fashion; it allows for the optimization of
arbitrary differentiable loss functions. In each stage ``n_classes_``
regression trees are fit on the negative gradient of the
binomial or multinomial deviance loss function. Binary classification
is a special case where only a single regression tree is induced.
2019-11-22T02:17:29
English
sklearn==0.21.3
numpy>=1.6.1
scipy>=0.9
criterion
string
"friedman_mse"
The function to measure the quality of a split. Supported criteria
are "friedman_mse" for the mean squared error with improvement
score by Friedman, "mse" for mean squared error, and "mae" for
the mean absolute error. The default value of "friedman_mse" is
generally the best as it can provide a better approximation in
some cases
.. versionadded:: 0.18
init
estimator or
null
An estimator object that is used to compute the initial predictions
``init`` has to provide `fit` and `predict_proba`. If 'zero', the
initial raw predictions are set to zero. By default, a
``DummyEstimator`` predicting the classes priors is used
learning_rate
float
0.1
learning rate shrinks the contribution of each tree by `learning_rate`
There is a trade-off between learning_rate and n_estimators
loss
"deviance"
max_depth
integer
3
maximum depth of the individual regression estimators. The maximum
depth limits the number of nodes in the tree. Tune this parameter
for best performance; the best value depends on the interaction
of the input variables
max_features
int
null
The number of features to consider when looking for the best split:
- If int, then consider `max_features` features at each split
- If float, then `max_features` is a fraction and
`int(max_features * n_features)` features are considered at each
split
- If "auto", then `max_features=sqrt(n_features)`
- If "sqrt", then `max_features=sqrt(n_features)`
- If "log2", then `max_features=log2(n_features)`
- If None, then `max_features=n_features`
Choosing `max_features < n_features` leads to a reduction of variance
and an increase in bias
Note: the search for a split does not stop until at least one
valid partition of the node samples is found, even if it requires to
effectively inspect more than ``max_features`` features
max_leaf_nodes
int or None
null
Grow trees with ``max_leaf_nodes`` in best-first fashion
Best nodes are defined as relative reduction in impurity
If None then unlimited number of leaf nodes
min_impurity_decrease
float
0.0
A node will be split if this split induces a decrease of the impurity
greater than or equal to this value
The weighted impurity decrease equation is the following::
N_t / N * (impurity - N_t_R / N_t * right_impurity
- N_t_L / N_t * left_impurity)
where ``N`` is the total number of samples, ``N_t`` is the number of
samples at the current node, ``N_t_L`` is the number of samples in the
left child, and ``N_t_R`` is the number of samples in the right child
``N``, ``N_t``, ``N_t_R`` and ``N_t_L`` all refer to the weighted sum,
if ``sample_weight`` is passed
.. versionadded:: 0.19
min_impurity_split
float
null
Threshold for early stopping in tree growth. A node will split
if its impurity is above the threshold, otherwise it is a leaf
.. deprecated:: 0.19
``min_impurity_split`` has been deprecated in favor of
``min_impurity_decrease`` in 0.19. The default value of
``min_impurity_split`` will change from 1e-7 to 0 in 0.23 and it
will be removed in 0.25. Use ``min_impurity_decrease`` instead
min_samples_leaf
int
1
The minimum number of samples required to be at a leaf node
A split point at any depth will only be considered if it leaves at
least ``min_samples_leaf`` training samples in each of the left and
right branches. This may have the effect of smoothing the model,
especially in regression
- If int, then consider `min_samples_leaf` as the minimum number
- If float, then `min_samples_leaf` is a fraction and
`ceil(min_samples_leaf * n_samples)` are the minimum
number of samples for each node
.. versionchanged:: 0.18
Added float values for fractions
min_samples_split
int
2
The minimum number of samples required to split an internal node:
- If int, then consider `min_samples_split` as the minimum number
- If float, then `min_samples_split` is a fraction and
`ceil(min_samples_split * n_samples)` are the minimum
number of samples for each split
.. versionchanged:: 0.18
Added float values for fractions
min_weight_fraction_leaf
float
0.0
The minimum weighted fraction of the sum total of weights (of all
the input samples) required to be at a leaf node. Samples have
equal weight when sample_weight is not provided
n_estimators
int
100
The number of boosting stages to perform. Gradient boosting
is fairly robust to over-fitting so a large number usually
results in better performance
n_iter_no_change
int
null
``n_iter_no_change`` is used to decide if early stopping will be used
to terminate training when validation score is not improving. By
default it is set to None to disable early stopping. If set to a
number, it will set aside ``validation_fraction`` size of the training
data as validation and terminate training when validation score is not
improving in all of the previous ``n_iter_no_change`` numbers of
iterations. The split is stratified
.. versionadded:: 0.20
presort
bool or
"auto"
Whether to presort the data to speed up the finding of best splits in
fitting. Auto mode by default will use presorting on dense data and
default to normal sorting on sparse data. Setting presort to true on
sparse data will raise an error
.. versionadded:: 0.17
*presort* parameter
random_state
int
0
If int, random_state is the seed used by the random number generator;
If RandomState instance, random_state is the random number generator;
If None, the random number generator is the RandomState instance used
by `np.random`
subsample
float
1.0
The fraction of samples to be used for fitting the individual base
learners. If smaller than 1.0 this results in Stochastic Gradient
Boosting. `subsample` interacts with the parameter `n_estimators`
Choosing `subsample < 1.0` leads to a reduction of variance
and an increase in bias
tol
float
0.0001
Tolerance for the early stopping. When the loss is not improving
by at least tol for ``n_iter_no_change`` iterations (if set to a
number), the training stops
.. versionadded:: 0.20
validation_fraction
float
0.1
The proportion of training data to set aside as validation set for
early stopping. Must be between 0 and 1
Only used if ``n_iter_no_change`` is set to an integer
.. versionadded:: 0.20
verbose
int
0
Enable verbose output. If 1 then it prints progress and performance
once in a while (the more trees the lower the frequency). If greater
than 1 then it prints progress and performance for every tree
warm_start
bool
false
When set to ``True``, reuse the solution of the previous call to fit
and add more estimators to the ensemble, otherwise, just erase the
previous solution. See :term:`the Glossary <warm_start>`
openml-python
python
scikit-learn
sklearn
sklearn_0.21.3
trasformer
17491
10507
sklearn.compose._column_transformer.ColumnTransformer(cat=sklearn.pipeline.Pipeline(categorical_inputer=sklearn.impute._base.SimpleImputer,onehot=sklearn.preprocessing._encoders.OneHotEncoder))
sklearn.ColumnTransformer
sklearn.compose._column_transformer.ColumnTransformer
1
openml==0.10.2,sklearn==0.21.3
Applies transformers to columns of an array or pandas DataFrame.
This estimator allows different columns or column subsets of the input
to be transformed separately and the features generated by each transformer
will be concatenated to form a single feature space.
This is useful for heterogeneous or columnar data, to combine several
feature extraction mechanisms or transformations into a single transformer.
2020-01-11T14:41:31
English
sklearn==0.21.3
numpy>=1.6.1
scipy>=0.9
n_jobs
int or None
null
Number of jobs to run in parallel
``None`` means 1 unless in a :obj:`joblib.parallel_backend` context
``-1`` means using all processors. See :term:`Glossary <n_jobs>`
for more details
remainder
"drop"
sparse_threshold
float
0.3
If the output of the different transformers contains sparse matrices,
these will be stacked as a sparse matrix if the overall density is
lower than this value. Use ``sparse_threshold=0`` to always return
dense. When the transformed output consists of all dense data, the
stacked result will be dense, and this keyword will be ignored
transformer_weights
dict
null
Multiplicative weights for features per transformer. The output of the
transformer is multiplied by these weights. Keys are transformer names,
values the weights
transformers
list of tuples
[{"oml-python:serialized_object": "component_reference", "value": {"key": "cat", "step_name": "cat", "argument_1": [false, true, false, true, false, true, true, true, true, true, false, false, false, true]}}]
List of (name, transformer, column(s)) tuples specifying the
transformer objects to be applied to subsets of the data
verbose
boolean
false
If True, the time elapsed while fitting each transformer will be
printed as it is completed.
cat
17492
10507
sklearn.pipeline.Pipeline(categorical_inputer=sklearn.impute._base.SimpleImputer,onehot=sklearn.preprocessing._encoders.OneHotEncoder)
sklearn.Pipeline(SimpleImputer,OneHotEncoder)
sklearn.pipeline.Pipeline
1
openml==0.10.2,sklearn==0.21.3
Pipeline of transforms with a final estimator.
Sequentially apply a list of transforms and a final estimator.
Intermediate steps of the pipeline must be 'transforms', that is, they
must implement fit and transform methods.
The final estimator only needs to implement fit.
The transformers in the pipeline can be cached using ``memory`` argument.
The purpose of the pipeline is to assemble several steps that can be
cross-validated together while setting different parameters.
For this, it enables setting parameters of the various steps using their
names and the parameter name separated by a '__', as in the example below.
A step's estimator may be replaced entirely by setting the parameter
with its name to another estimator, or a transformer removed by setting
it to 'passthrough' or ``None``.
2020-01-11T14:41:31
English
sklearn==0.21.3
numpy>=1.6.1
scipy>=0.9
memory
None
null
Used to cache the fitted transformers of the pipeline. By default,
no caching is performed. If a string is given, it is the path to
the caching directory. Enabling caching triggers a clone of
the transformers before fitting. Therefore, the transformer
instance given to the pipeline cannot be inspected
directly. Use the attribute ``named_steps`` or ``steps`` to
inspect estimators within the pipeline. Caching the
transformers is advantageous when fitting is time consuming
steps
list
[{"oml-python:serialized_object": "component_reference", "value": {"key": "categorical_inputer", "step_name": "categorical_inputer"}}, {"oml-python:serialized_object": "component_reference", "value": {"key": "onehot", "step_name": "onehot"}}]
List of (name, transform) tuples (implementing fit/transform) that are
chained, in the order in which they are chained, with the last object
an estimator
verbose
boolean
false
If True, the time elapsed while fitting each step will be printed as it
is completed.
categorical_inputer
17377
10522
sklearn.impute._base.SimpleImputer
sklearn.SimpleImputer
sklearn.impute._base.SimpleImputer
10
openml==0.10.2,sklearn==0.21.3
Imputation transformer for completing missing values.
2019-11-18T12:23:12
English
sklearn==0.21.3
numpy>=1.6.1
scipy>=0.9
add_indicator
boolean
false
If True, a `MissingIndicator` transform will stack onto output
of the imputer's transform. This allows a predictive estimator
to account for missingness despite imputation. If a feature has no
missing values at fit/train time, the feature won't appear on
the missing indicator even if there are missing values at
transform/test time.
copy
boolean
true
If True, a copy of X will be created. If False, imputation will
be done in-place whenever possible. Note that, in the following cases,
a new copy will always be made, even if `copy=False`:
- If X is not an array of floating values;
- If X is encoded as a CSR matrix;
- If add_indicator=True
fill_value
string or numerical value
null
When strategy == "constant", fill_value is used to replace all
occurrences of missing_values
If left to the default, fill_value will be 0 when imputing numerical
data and "missing_value" for strings or object data types
missing_values
number
NaN
The placeholder for the missing values. All occurrences of
`missing_values` will be imputed
strategy
string
"mean"
The imputation strategy
- If "mean", then replace missing values using the mean along
each column. Can only be used with numeric data
- If "median", then replace missing values using the median along
each column. Can only be used with numeric data
- If "most_frequent", then replace missing using the most frequent
value along each column. Can be used with strings or numeric data
- If "constant", then replace missing values with fill_value. Can be
used with strings or numeric data
.. versionadded:: 0.20
strategy="constant" for fixed value imputation
verbose
integer
0
Controls the verbosity of the imputer
openml-python
python
scikit-learn
sklearn
sklearn_0.21.3
onehot
17426
1
sklearn.preprocessing._encoders.OneHotEncoder
sklearn.OneHotEncoder
sklearn.preprocessing._encoders.OneHotEncoder
17
openml==0.10.2,sklearn==0.21.3
Encode categorical integer features as a one-hot numeric array.
The input to this transformer should be an array-like of integers or
strings, denoting the values taken on by categorical (discrete) features.
The features are encoded using a one-hot (aka 'one-of-K' or 'dummy')
encoding scheme. This creates a binary column for each category and
returns a sparse matrix or dense array.
By default, the encoder derives the categories based on the unique values
in each feature. Alternatively, you can also specify the `categories`
manually.
The OneHotEncoder previously assumed that the input features take on
values in the range [0, max(values)). This behaviour is deprecated.
This encoding is needed for feeding categorical data to many scikit-learn
estimators, notably linear models and SVMs with the standard kernels.
Note: a one-hot encoding of y labels should use a LabelBinarizer
instead.
2019-11-22T02:17:02
English
sklearn==0.21.3
numpy>=1.6.1
scipy>=0.9
categorical_features
'all' or array of indices or mask
null
Specify what features are treated as categorical
- 'all': All features are treated as categorical
- array of indices: Array of categorical feature indices
- mask: Array of length n_features and with dtype=bool
Non-categorical features are always stacked to the right of the matrix
.. deprecated:: 0.20
The `categorical_features` keyword was deprecated in version
0.20 and will be removed in 0.22
You can use the ``ColumnTransformer`` instead.
categories
'auto' or a list of lists
null
Categories (unique values) per feature:
- 'auto' : Determine categories automatically from the training data
- list : ``categories[i]`` holds the categories expected in the ith
column. The passed categories should not mix strings and numeric
values within a single feature, and should be sorted in case of
numeric values
The used categories can be found in the ``categories_`` attribute
drop
'first' or a list
null
Specifies a methodology to use to drop one of the categories per
feature. This is useful in situations where perfectly collinear
features cause problems, such as when feeding the resulting data
into a neural network or an unregularized regression
dtype
number type
{"oml-python:serialized_object": "type", "value": "np.float64"}
Desired dtype of output
handle_unknown
'error' or
"ignore"
Whether to raise an error or ignore if an unknown categorical feature
is present during transform (default is to raise). When this parameter
is set to 'ignore' and an unknown category is encountered during
transform, the resulting one-hot encoded columns for this feature
will be all zeros. In the inverse transform, an unknown category
will be denoted as None
n_values
'auto'
null
Number of values per feature
- 'auto' : determine value range from training data
sparse
boolean
true
Will return sparse matrix if set True else will return an array
openml-python
python
scikit-learn
sklearn
sklearn_0.21.3
openml-python
python
scikit-learn
sklearn
sklearn_0.21.3
openml-python
python
scikit-learn
sklearn
sklearn_0.21.3
openml-python
python
scikit-learn
sklearn
sklearn_0.21.3