TRV-2026-0052Version 1 · Certified
Reason for this version
Certified into the record
Canonical text (the exact bytes fingerprinted)
TRUVACE RECORD VERSION record: TRV-2026-0052 version: 1 kind: certified reason: Certified into the record timestamp: 2026-07-12T20:50:18.365306Z status: published lens: trace sector: science headline: The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation dek: Abstract Background To evaluate binary classifications and their confusion matrices, scientific researchers can employ several statistical rates, accordingly to the goal of the experiment they are investigating. Despite being a crucial issue in machine learning, no widespread consensus has been reached on a unified elective chosen measure yet. Accuracy and F 1 score computed on confusion matrices have been (and still are) among the most popular adopted metrics in binary classification tasks. However, these statistical measures can dangerously show overoptimistic inflated results, especially on imbalanced datasets. Results The Matthews correlation coefficient (MCC), instead, is a more reliable statistical rate which produces a high score only if the prediction obtained good results in all of the four confusion matrix categories (true positives, false negatives, true negatives, and fals… gain_reading: The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation: Accuracy and F 1 score computed on confusion matrices have been (and still are) among the most popular adopted metrics in binary classification tasks. problem_reading: The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation: However, these statistical measures can dangerously show overoptimistic inflated results, especially on imbalanced datasets. limitation: Historical research candidate. An editor must verify study design, population, effect size, and whether later evidence changes the reading before publication. tag: Automated dual reading key_points: Abstract Background To evaluate binary classifications and their confusion matrices, scientific researchers can employ several statistical rates, accordingly to the goal of the experiment they are investigating. | Despite being a crucial issue in machine learning, no widespread consensus has been reached on a unified elective chosen measure yet. | Accuracy and F 1 score computed on confusion matrices have been (and still are) among the most popular adopted metrics in binary classification tasks. rundown: Abstract Background To evaluate binary classifications and their confusion matrices, scientific researchers can employ several statistical rates, accordingly to the goal of the experiment they are investigating. Despite being a crucial issue in machine learning, no widespread consensus has been reached on a unified elective chosen measure yet. Accuracy and F 1 score computed on confusion matrices have been (and still are) among the most popular adopted metrics in binary classification tasks. However, these statistical measures can dangerously show overoptimistic inflated results, especially on imbalanced datasets. sources: - peer_reviewed | BMC Genomics | https://doi.org/10.1186/s12864-019-6413-7 | 2020-01-02 prev: 0000000000000000000000000000000000000000000000000000000000000000
- sha256
- 5107a313e692b8ef5c759790dcf89738ba3b6ef4526602c7ef0ed4135f8f4226
- previous
- 0000000000000000000000000000000000000000000000000000000000000000
Verify this record
How to verify without trusting this page
Fetch the canonical text of any version from /api/record/TRV-2026-0052 and hash it yourself — for example shasum -a 256 on the saved canonical field. The result must equal content_hash, and each version’s text ends with prev:followed by the prior version’s hash (version 1 chains to 64 zeros). If a single character of any version had been altered since certification, the chain would not reproduce.