Σύγκριση μεθόδων

	Δείκτης Jaccard	Βαθμολογία F1	Απώλεια Hamming
Πεδίο	Αξιολόγηση Μοντέλων	Αξιολόγηση Μοντέλων	Αξιολόγηση Μοντέλων
Οικογένεια	MCDM	MCDM	MCDM
Έτος προέλευσης	1901	1979	2000s
Δημιουργός	Paul Jaccard	C. J. van Rijsbergen	Information theory and multi-label learning
Τύπος	Similarity metric	Evaluation 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.	van Rijsbergen, C. J. (1979). Information Retrieval (2nd ed.). Butterworth-Heinemann.	Schapire, R. E., & Singer, Y. (2000). BoosTexter: A boosting-based system for text categorization. Machine Learning, 39(2-3), 135-168.
Εναλλακτικές ονομασίες	Jaccard Similarity, Intersection over Union (IoU)	F-measure, Harmonic Mean	Hamming Distance, Subset Accuracy Loss
Συναφείς	2	5	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.	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.