방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 자카드 지수× | 해밍 손실(Hamming Loss)× | |
|---|---|---|
| 분야 | 모델 평가 | 모델 평가 |
| 계열 | MCDM | MCDM |
| 기원 연도≠ | 1901 | 2000s |
| 창시자≠ | Paul Jaccard | Information theory and multi-label learning |
| 유형≠ | Similarity metric | Loss function |
| 원전≠ | Jaccard, P. (1901). Etude comparative de la distribution florale dans une portion des Alpes et des Jura. Bulletin de la Société Vaudoise des Sciences Naturelles, 37, 547-579. link ↗ | Schapire, R. E., & Singer, Y. (2000). BoosTexter: A boosting-based system for text categorization. Machine Learning, 39(2-3), 135-168. DOI ↗ |
| 별칭 | Jaccard Similarity, Intersection over Union (IoU) | Hamming Distance, Subset Accuracy Loss |
| 관련≠ | 2 | 1 |
| 요약≠ | The Jaccard index measures the similarity between predicted and true label sets by computing the ratio of intersection to union. It is widely used in multi-label classification and set-based similarity tasks where partial overlap is 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데이터셋 ↗ |
|
|