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 |
An instance of supervised learning that identifies the category or categories which a new instance of dataset belongs.
4
votes
1
answer
489
views
How to best estimate the coefficients of a confusion matrix in case of strong class imbalance?
I have a trained binary classifier (forget about how this was trained and think of it as a magical black box) and I would like to measure its classification performance (e.g. compute a confusion matrix …
1
vote
Accepted
How to calculate Accuracy, Precision, Recall and F1 score based on predict_proba matrix?
To compute performance metrics like precision, recall and F1 score you need to compare two things with each other:
the predictions of your model for your evaluation set (in what follows, I'll call …
0
votes
1
answer
317
views
How can I train a decision tree constrained to have number of decision nodes = tree depth?
Given a vector x with n components, the classification logic will thus look like:
def classify(x):
if x[0] < t_0:
if x[1] < t_1:
if x[2] < t_2:
if x[3] < t_3:
... …