\HeaderA{scdaCMA}{Shrunken Centroids Discriminant Analysis}{scdaCMA}
\keyword{multivariate}{scdaCMA}
\begin{Description}\relax
The nearest shrunken centroid classification algorithm is
detailly described in Tibshirani et al. (2002).

It is widely known under the name PAM (prediction analysis for microarrays),
which can also be found in the package \code{pamr}.

For \code{S4} method information, see \LinkA{scdaCMA-methods}{scdaCMA.Rdash.methods}.
\end{Description}
\begin{Usage}
\begin{verbatim}
scdaCMA(X, y, f, learnind, delta = 0.5, ...)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{X}] Gene expression data. Can be one of the following:
\Itemize{
\item A \code{matrix}. Rows correspond to observations, columns to variables.
\item A \code{data.frame}, when \code{f} is \emph{not} missing (s. below).
\item An object of class \code{ExpressionSet}.
}

\item[\code{y}] Class labels. Can be one of the following:
\Itemize{
\item A \code{numeric} vector.
\item A \code{factor}.
\item A \code{character} if \code{X} is an \code{ExpressionSet} that
specifies the phenotype variable.
\item \code{missing}, if \code{X} is a \code{data.frame} and a
proper formula \code{f} is provided.
}
\bold{WARNING}: The class labels will be re-coded to
range from \code{0} to \code{K-1}, where \code{K} is the
total number of different classes in the learning set.

\item[\code{f}] A two-sided formula, if \code{X} is a \code{data.frame}. The
left part correspond to class labels, the right to variables.
\item[\code{learnind}] An index vector specifying the observations that
belong to the learning set. May be \code{missing};
in that case, the learning set consists of all
observations and predictions are made on the
learning set.
\item[\code{delta}] The shrinkage intensity for the class centroids -
a hyperparameter that must be tuned. The default
\code{0.5} not necessarily produces good results.
\item[\code{...}] Currently unused argument.
\end{ldescription}
\end{Arguments}
\begin{Value}
An object of class \code{\LinkA{cloutput}{cloutput}}.
\end{Value}
\begin{Note}\relax
The results can differ from those obtained by
using the package \code{pamr}.
\end{Note}
\begin{Author}\relax
Martin Slawski \email{martin.slawski@campus.lmu.de}

Anne-Laure Boulesteix \url{http://www.slcmsr.net/boulesteix}
\end{Author}
\begin{References}\relax
Tibshirani, R., Hastie, T., Narasimhan, B., and Chu, G., (2003).

Class prediction by nearest shrunken centroids with applications to DNA microarrays.

\emph{Statistical Science, 18, 104-117}
\end{References}
\begin{SeeAlso}\relax
\code{\LinkA{compBoostCMA}{compBoostCMA}}, \code{\LinkA{dldaCMA}{dldaCMA}}, \code{\LinkA{ElasticNetCMA}{ElasticNetCMA}},
\code{\LinkA{fdaCMA}{fdaCMA}}, \code{\LinkA{flexdaCMA}{flexdaCMA}}, \code{\LinkA{gbmCMA}{gbmCMA}},
\code{\LinkA{knnCMA}{knnCMA}}, \code{\LinkA{ldaCMA}{ldaCMA}}, \code{\LinkA{LassoCMA}{LassoCMA}},
\code{\LinkA{nnetCMA}{nnetCMA}}, \code{\LinkA{pknnCMA}{pknnCMA}}, \code{\LinkA{plrCMA}{plrCMA}},
\code{\LinkA{pls\_ldaCMA}{pls.Rul.ldaCMA}}, \code{\LinkA{pls\_lrCMA}{pls.Rul.lrCMA}}, \code{\LinkA{pls\_rfCMA}{pls.Rul.rfCMA}},
\code{\LinkA{pnnCMA}{pnnCMA}}, \code{\LinkA{qdaCMA}{qdaCMA}}, \code{\LinkA{rfCMA}{rfCMA}},
\code{\LinkA{shrinkldaCMA}{shrinkldaCMA}}, \code{\LinkA{svmCMA}{svmCMA}}
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
### load Khan data
data(khan)
### extract class labels
khanY <- khan[,1]
### extract gene expression
khanX <- as.matrix(khan[,-1])
### select learningset
set.seed(111)
learnind <- sample(length(khanY), size=floor(2/3*length(khanY)))
### run Shrunken Centroids classfier, without tuning
scdaresult <- scdaCMA(X=khanX, y=khanY, learnind=learnind)
### show results
show(scdaresult)
ftable(scdaresult)
plot(scdaresult)\end{ExampleCode}
\end{Examples}

