Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix doc markdown Fixes #5731 #5732

Merged
merged 1 commit into from
Mar 30, 2021
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -37,7 +37,7 @@ public sealed class CalibratedBinaryClassificationMetrics : BinaryClassification
/// <remarks>
/// <format type="text/markdown"><![CDATA[
/// The log-loss reduction is scaled relative to a classifier that predicts the prior for every example:
/// $LogLossReduction = \frac{LogLoss(prior) - LogLoss(classifier)}{LogLoss(prior)}
/// $LogLossReduction = \frac{LogLoss(prior) - LogLoss(classifier)}{LogLoss(prior)}$
/// This metric can be interpreted as the advantage of the classifier over a random prediction.
/// For example, if the RIG equals 0.2, it can be interpreted as "the probability of a correct prediction is
/// 20% better than random guessing".
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -24,7 +24,7 @@ public sealed class MulticlassClassificationMetrics
/// <remarks>
/// <format type="text/markdown"><![CDATA[
/// The log-loss metric is computed as follows:
/// $LogLoss = - \frac{1}{m} \sum_{i = 1}^m log(p_i),
/// $LogLoss = - \frac{1}{m} \sum_{i = 1}^m log(p_i)$,
/// where $m$ is the number of instances in the test set and
/// $p_i$ is the probability returned by the classifier
/// of the instance belonging to the true class.
Expand All @@ -41,7 +41,7 @@ public sealed class MulticlassClassificationMetrics
/// <remarks>
/// <format type="text/markdown"><![CDATA[
/// The log-loss reduction is scaled relative to a classifier that predicts the prior for every example:
/// $LogLossReduction = \frac{LogLoss(prior) - LogLoss(classifier)}{LogLoss(prior)}
/// $LogLossReduction = \frac{LogLoss(prior) - LogLoss(classifier)}{LogLoss(prior)}$
/// This metric can be interpreted as the advantage of the classifier over a random prediction.
/// For example, if the RIG equals 0.2, it can be interpreted as "the probability of a correct prediction is
/// 20% better than random guessing".
Expand Down