Skip to content

Commit a1cfd78

Browse files
Merge pull request #259 from przemub/patch-1
Fix a typo.
2 parents 90f191d + 496d0ac commit a1cfd78

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

linear-classify.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,7 @@ Table of Contents:
2121

2222
## Linear Classification
2323

24-
In the last section we introduced the problem of Image Classification, which is the task of assigning a single label to an image from a fixed set of categories. Morever, we described the k-Nearest Neighbor (kNN) classifier which labels images by comparing them to (annotated) images from the training set. As we saw, kNN has a number of disadvantages:
24+
In the last section we introduced the problem of Image Classification, which is the task of assigning a single label to an image from a fixed set of categories. Moreover, we described the k-Nearest Neighbor (kNN) classifier which labels images by comparing them to (annotated) images from the training set. As we saw, kNN has a number of disadvantages:
2525

2626
- The classifier must *remember* all of the training data and store it for future comparisons with the test data. This is space inefficient because datasets may easily be gigabytes in size.
2727
- Classifying a test image is expensive since it requires a comparison to all training images.

0 commit comments

Comments
 (0)