手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| ジャカード指数× | F1スコア× | ハミング損失× | |
|---|---|---|---|
| 分野 | モデル評価 | モデル評価 | モデル評価 |
| 系統 | 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. link ↗ | 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 ↗ |
| 別名 | 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. |
| ScholarGateデータセット ↗ |
|
|
|