方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| F1分数× | 汉明损失× | |
|---|---|---|
| 领域 | 模型评估 | 模型评估 |
| 方法族 | MCDM | MCDM |
| 起源年份≠ | 1979 | 2000s |
| 提出者≠ | C. J. van Rijsbergen | Information theory and multi-label learning |
| 类型≠ | Evaluation metric | Loss function |
| 开创性文献≠ | van Rijsbergen, C. J. (1979). Information Retrieval (2nd ed.). Butterworth-Heinemann. link ↗ | Schapire, R. E., & Singer, Y. (2000). BoosTexter: A boosting-based system for text categorization. Machine Learning, 39(2-3), 135-168. DOI ↗ |
| 别名 | F-measure, Harmonic Mean | Hamming Distance, Subset Accuracy Loss |
| 相关≠ | 5 | 1 |
| 摘要≠ | The F1-score is the harmonic mean of precision and recall, providing a single metric that balances both concerns. It was introduced by van Rijsbergen in information retrieval and has become a standard metric for evaluating classification models where both precision and recall are important. | Hamming loss measures the fraction of labels that are incorrectly predicted in multi-label classification. It counts the number of label mistakes divided by the total number of labels, providing a simple metric for multi-label problems. |
| ScholarGate数据集 ↗ |
|
|