방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| F1-점수× | 해밍 손실(Hamming Loss)× | |
|---|---|---|
| 분야 | 모델 평가 | 모델 평가 |
| 계열 | 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데이터셋 ↗ |
|
|