sprint (version 1.0.4)

psvm: Parallel Support Vector Machines

Description

A parallel implementation of the svm function from R package e1071. psvm is used to train a support vector machine. It can be used to carry out general regression and classification (of nu and epsilon-type), as well as density-estimation. A formula interface is provided.

Usage

psvm(x, y = NULL, type = "C", kernel = "radial", degree = 3, 
gamma = if (is.vector(x)) 1 else 1/ncol(x), coef0 = 0, cost = 1, 
nu = 0.5, class.weights = NULL, cachesize = 40, tolerance = 0.001, 
epsilon = 0.1, shrinking = TRUE, cross = 0, probability = FALSE, 
fitted = TRUE, seed = 1L, scale = TRUE, na.action = na.omit)

Arguments

x

a data matrix, a vector, or a sparse matrix (object of class Matrix provided by the Matrix package, or of class matrix.csr

y

a response vector with one label for each row/component of x. Can be either a factor (for classification tasks) or a numeric vector (for regression).

scale

A logical vector indicating the variables to be scaled. If scale is of length 1, the value is recycled as many times as needed. Per default, data are scaled internally (both x and y variables) to zero

type

psvm can be used as a classification machine, as a regression machine, or for novelty detection. Depending of whether y is a factor or not, the default setting for type is C-classification or

kernel

the kernel used in training and predicting. You might consider changing some of the following parameters, depending on the kernel type. [object Object],[object Object],[object Object],[object Object]

degree

parameter needed for kernel of type polynomial (default: 3)

gamma

parameter needed for all kernels except linear (default: 1/(data dimension))

coef0

parameter needed for kernels of type polynomial and sigmoid (default: 0)

cost

cost of constraints violation (default: 1)---it is the C-constant of the regularization term in the Lagrange formulation.

nu

parameter needed for nu-classification, nu-regression, and one-classification

class.weights

a named vector of weights for the different classes, used for asymmetric class sizes. Not all factor levels have to be supplied (default weight: 1). All components have to be named.

cachesize

cache memory in MB (default 40)

tolerance

tolerance of termination criterion (default: 0.001)

epsilon

epsilon in the insensitive-loss function (default: 0.1)

shrinking

option whether to use the shrinking-heuristics (default: TRUE)

cross

if a integer value k>0 is specified, a k-fold cross validation on the training data is performed to assess the quality of the model: the accuracy rate for classification and the Mean Squared Error for regression

fitted

logical indicating whether the fitted values should be computed and included in the model or not (default: TRUE)

probability

logical indicating whether the model should allow for probability predictions.

seed

integer seed for libsvm (used for cross-validation and probability prediction models).

...

additional parameters for the low level fitting function psvm.default

na.action

A function to specify the action to be taken if NAs are found. The default action is na.omit, which leads to rejection of cases with missing values on any required variable. An alternative is na.fail<

Value

• An object of class "psvm" containing the fitted model, including:
• SV
  The resulting support vectors (possibly scaled).
• index
  The index of the resulting support vectors in the data matrix. Note that this index refers to the preprocessed data (after the possible effect of na.omit and subset)
• coefs
  The corresponding coefficients times the training labels.
• rho
  The negative intercept.
• sigma
  In case of a probabilistic regression model, the scale parameter of the hypothesized (zero-mean) laplace distribution estimated by maximum likelihood.
• probA, probB
  numeric vectors of length k(k-1)/2, k number of classes, containing the parameters of the logistic distributions fitted to the decision values of the binary classifiers (1 / (1 + exp(a x + b))).

Details

For multiclass-classification with k levels, k>2, libsvm uses the one-against-one-approach, in which k(k-1)/2 binary classifiers are trained; the appropriate class is found by a voting scheme. libsvm internally uses a sparse data representation, which is also high-level supported by the package SparseM. If the predictor variables include factors, the formula interface must be used to get a correct model matrix.

plot.svm allows a simple graphical visualization of classification models.

The probability model for classification fits a logistic distribution using maximum likelihood to the decision values of all binary classifiers, and computes the a-posteriori class probabilities for the multi-class problem using quadratic optimization. The probabilistic regression model assumes (zero-mean) laplace-distributed errors for the predictions, and estimates the scale parameter using maximum likelihood.

See Also

SPRINT svm