विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| जैकर्ड इंडेक्स× | हैमिंग लॉस (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डेटासेट ↗ |
|
|