Home | Trees | Indices | Help |
|
---|
|
Linear model fitted by minimizing a regularized empirical loss with SGD. This node has been automatically generated by wrapping the ``scikits.learn.linear_model.stochastic_gradient.SGDClassifier`` class from the ``sklearn`` library. The wrapped instance can be accessed through the ``scikits_alg`` attribute. SGD stands for Stochastic Gradient Descent: the gradient of the loss is estimated each sample at a time and the model is updated along the way with a decreasing strength schedule (aka learning rate). The regularizer is a penalty added to the loss function that shrinks model parameters towards the zero vector using either the squared euclidean norm L2 or the absolute norm L1 or a combination of both (Elastic Net). If the parameter update crosses the 0.0 value because of the regularizer, the update is truncated to 0.0 to allow for learning sparse models and achieve online feature selection. This implementation works with data represented as dense numpy arrays of floating point values for the features. **Parameters** loss : str, 'hinge' or 'log' or 'modified_huber' The loss function to be used. Defaults to 'hinge'. The hinge loss is a margin loss used by standard linear SVM models. The 'log' loss is the loss of logistic regression models and can be used for probability estimation in binary classifiers. 'modified_huber' is another smooth loss that brings tolerance to outliers. penalty : str, 'l2' or 'l1' or 'elasticnet' The penalty (aka regularization term) to be used. Defaults to 'l2' which is the standard regularizer for linear SVM models. 'l1' and 'elasticnet' migh bring sparsity to the model (feature selection) not achievable with 'l2'. alpha : float Constant that multiplies the regularization term. Defaults to 0.0001 rho : float The Elastic Net mixing parameter, with 0 < rho <= 1. Defaults to 0.85. fit_intercept: bool Whether the intercept should be estimated or not. If False, the data is assumed to be already centered. Defaults to True. n_iter: int, optional The number of passes over the training data (aka epochs). Defaults to 5. shuffle: bool, optional Whether or not the training data should be shuffled after each epoch. Defaults to False. seed: int, optional The seed of the pseudo random number generator to use when shuffling the data. verbose: integer, optional The verbosity level n_jobs: integer, optional The number of CPUs to use to do the OVA (One Versus All, for multi-class problems) computation. -1 means 'all CPUs'. Defaults to 1. learning_rate : int The learning rate: - constant: eta = eta0 - optimal: eta = 1.0/(t+t0) [default] - invscaling: eta = eta0 / pow(t, power_t) eta0 : double The initial learning rate [default 0.01]. power_t : double The exponent for inverse scaling learning rate [default 0.25]. **Attributes** `coef_` : array, shape = [1, n_features] if n_classes == 2 else [n_classes, n_features] Weights assigned to the features. `intercept_` : array, shape = [1] if n_classes == 2 else [n_classes] Constants in decision function. **Examples** >>> import numpy as np >>> from scikits.learn import linear_model >>> X = np.array([[-1, -1], [-2, -1], [1, 1], [2, 1]]) >>> Y = np.array([1, 1, 2, 2]) >>> clf = linear_model.SGDClassifier() >>> clf.fit(X, Y) SGDClassifier(loss='hinge', n_jobs=1, shuffle=False, verbose=0, n_iter=5, learning_rate='optimal', fit_intercept=True, penalty='l2', power_t=0.5, seed=0, eta0=0.0, rho=1.0, alpha=0.0001) >>> print clf.predict([[-0.8, -1]]) [ 1.] See also LinearSVC, LogisticRegression
|
|||
|
|||
list |
|
||
|
|||
|
|||
|
|||
|
|||
Inherited from Inherited from |
|||
Inherited from ClassifierCumulator | |||
---|---|---|---|
|
|||
|
|||
|
|||
Inherited from ClassifierNode | |||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from PreserveDimNode | |||
|
|||
|
|||
Inherited from Node | |||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|
|||
|
|||
bool |
|
|
|||
Inherited from |
|||
Inherited from Node | |||
---|---|---|---|
_train_seq List of tuples: |
|||
dtype dtype |
|||
input_dim Input dimensions |
|||
output_dim Output dimensions |
|||
supported_dtypes Supported dtypes |
|
Linear model fitted by minimizing a regularized empirical loss with SGD. This node has been automatically generated by wrapping the ``scikits.learn.linear_model.stochastic_gradient.SGDClassifier`` class from the ``sklearn`` library. The wrapped instance can be accessed through the ``scikits_alg`` attribute. SGD stands for Stochastic Gradient Descent: the gradient of the loss is estimated each sample at a time and the model is updated along the way with a decreasing strength schedule (aka learning rate). The regularizer is a penalty added to the loss function that shrinks model parameters towards the zero vector using either the squared euclidean norm L2 or the absolute norm L1 or a combination of both (Elastic Net). If the parameter update crosses the 0.0 value because of the regularizer, the update is truncated to 0.0 to allow for learning sparse models and achieve online feature selection. This implementation works with data represented as dense numpy arrays of floating point values for the features. **Parameters** loss : str, 'hinge' or 'log' or 'modified_huber' The loss function to be used. Defaults to 'hinge'. The hinge loss is a margin loss used by standard linear SVM models. The 'log' loss is the loss of logistic regression models and can be used for probability estimation in binary classifiers. 'modified_huber' is another smooth loss that brings tolerance to outliers. penalty : str, 'l2' or 'l1' or 'elasticnet' The penalty (aka regularization term) to be used. Defaults to 'l2' which is the standard regularizer for linear SVM models. 'l1' and 'elasticnet' migh bring sparsity to the model (feature selection) not achievable with 'l2'. alpha : float Constant that multiplies the regularization term. Defaults to 0.0001 rho : float The Elastic Net mixing parameter, with 0 < rho <= 1. Defaults to 0.85. fit_intercept: bool Whether the intercept should be estimated or not. If False, the data is assumed to be already centered. Defaults to True. n_iter: int, optional The number of passes over the training data (aka epochs). Defaults to 5. shuffle: bool, optional Whether or not the training data should be shuffled after each epoch. Defaults to False. seed: int, optional The seed of the pseudo random number generator to use when shuffling the data. verbose: integer, optional The verbosity level n_jobs: integer, optional The number of CPUs to use to do the OVA (One Versus All, for multi-class problems) computation. -1 means 'all CPUs'. Defaults to 1. learning_rate : int The learning rate: - constant: eta = eta0 - optimal: eta = 1.0/(t+t0) [default] - invscaling: eta = eta0 / pow(t, power_t) eta0 : double The initial learning rate [default 0.01]. power_t : double The exponent for inverse scaling learning rate [default 0.25]. **Attributes** `coef_` : array, shape = [1, n_features] if n_classes == 2 else [n_classes, n_features] Weights assigned to the features. `intercept_` : array, shape = [1] if n_classes == 2 else [n_classes] Constants in decision function. **Examples** >>> import numpy as np >>> from scikits.learn import linear_model >>> X = np.array([[-1, -1], [-2, -1], [1, 1], [2, 1]]) >>> Y = np.array([1, 1, 2, 2]) >>> clf = linear_model.SGDClassifier() >>> clf.fit(X, Y) SGDClassifier(loss='hinge', n_jobs=1, shuffle=False, verbose=0, n_iter=5, learning_rate='optimal', fit_intercept=True, penalty='l2', power_t=0.5, seed=0, eta0=0.0, rho=1.0, alpha=0.0001) >>> print clf.predict([[-0.8, -1]]) [ 1.] See also LinearSVC, LogisticRegression
|
|
|
Transform the data and labels lists to array objects and reshape them.
|
|
|
Predict using the linear model
This node has been automatically generated by wrapping the
Returns
|
Fit linear model with Stochastic Gradient Descent.
This node has been automatically generated by wrapping the
Returns self : returns an instance of self.
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1-MDP on Mon Apr 27 21:56:23 2020 | http://epydoc.sourceforge.net |