diff options
| author | Gertjan van den Burg <gertjanvandenburg@gmail.com> | 2016-05-09 20:55:24 +0200 |
|---|---|---|
| committer | Gertjan van den Burg <gertjanvandenburg@gmail.com> | 2016-05-09 20:55:24 +0200 |
| commit | 7c8a5e4b2a7cff7573b1a308daf19d2dbd558a9c (patch) | |
| tree | 2c4774a63ec91d60931d822a7607a5011711c946 /src/gensvm_pred.c | |
| parent | add doc and test to phony (diff) | |
| download | gensvm-7c8a5e4b2a7cff7573b1a308daf19d2dbd558a9c.tar.gz gensvm-7c8a5e4b2a7cff7573b1a308daf19d2dbd558a9c.zip | |
strip whitespaces
Diffstat (limited to 'src/gensvm_pred.c')
| -rw-r--r-- | src/gensvm_pred.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/gensvm_pred.c b/src/gensvm_pred.c index 7baae07..7835bf6 100644 --- a/src/gensvm_pred.c +++ b/src/gensvm_pred.c @@ -6,7 +6,7 @@ * * @details * This file contains functions for predicting the class labels of instances - * and a function for calculating the predictive performance (hitrate) of + * and a function for calculating the predictive performance (hitrate) of * a prediction given true class labels. * */ @@ -24,7 +24,7 @@ * @brief Predict class labels of data given and output in predy * * @details - * The labels are predicted by mapping each instance in data to the + * The labels are predicted by mapping each instance in data to the * simplex space using the matrix V in the given model. Next, for each * instance the nearest simplex vertex is determined using an Euclidean * norm. The nearest simplex vertex determines the predicted class label, @@ -113,7 +113,7 @@ void gensvm_predict_labels(struct GenData *testdata, struct GenModel *model, * * @details * The predictive performance is calculated by simply counting the number - * of correctly classified samples and dividing by the total number of + * of correctly classified samples and dividing by the total number of * samples, multiplying by 100. * * @param[in] data the GenData dataset with known labels |