Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with classification
Search options not deleted
user 49398
Statistical classification is the problem of identifying the sub-population to which new observations belong, where the identity of the sub-population is unknown, on the basis of a training set of data containing observations whose sub-population is known. Therefore these classifications will show a variable behavior which can be studied by statistics.
1
vote
Accepted
Asymmetric distance measure in k-NN classifier?
It has to be symmetric. The reason is because, KNN can be viewed as a non-parametric kernel density estimation problem. In the estimation problem you get a term of the form $K(x-x_{i})$ and $K$ is a K …
- 2,637
1
vote
How to include a pattern for'unknown' for an SVM classifier?
If you don't mind me asking, why use a SVM? why not do something like a multi-class logistic regression (apologies if you have already tried it but thought I should put this in there).
As a tip, thi …
- 2,637
18
votes
In Naive Bayes, why bother with Laplace smoothing when we have unknown words in the test set?
You always need this 'fail-safe' probability.
To see why consider the worst case where none of the words in the training sample appear in the test sentence. In this case, under your model we would c …
- 2,637