Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Indexul Jaccard× | Pierderea Hamming (Hamming Loss)× | |
|---|---|---|
| Domeniu | Evaluarea modelelor | Evaluarea modelelor |
| Familie | MCDM | MCDM |
| Anul apariției≠ | 1901 | 2000s |
| Autorul original≠ | Paul Jaccard | Information theory and multi-label learning |
| Tip≠ | Similarity metric | Loss function |
| Sursa seminală≠ | 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 ↗ |
| Denumiri alternative | Jaccard Similarity, Intersection over Union (IoU) | Hamming Distance, Subset Accuracy Loss |
| Înrudite≠ | 2 | 1 |
| Rezumat≠ | 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. |
| ScholarGateSet de date ↗ |
|
|