Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Reguły asocjacyjne× | Uczenie ze wsparciem częściowym× | |
|---|---|---|
| Dziedzina | Uczenie maszynowe | Uczenie maszynowe |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1993 | 1970s–2006 (formalized) |
| Twórca≠ | Agrawal, R., Imielinski, T., & Swami, A. | Vapnik, V. N. and others (community of researchers, 1970s–2000s) |
| Typ≠ | Unsupervised pattern discovery | Learning paradigm |
| Źródło pierwotne≠ | Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207–216. DOI ↗ | Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9 |
| Inne nazwy | market basket analysis, association rule mining, frequent itemset mining, affinity analysis | SSL, semi-supervised machine learning, transductive learning, label-efficient learning |
| Pokrewne≠ | 4 | 5 |
| Podsumowanie≠ | Association rule learning is an unsupervised technique that discovers co-occurrence patterns — 'if X then Y' implications — within large transactional datasets. Originally formalized by Agrawal, Imielinski, and Swami (1993) for supermarket basket analysis, it is now widely applied in e-commerce recommendation, health informatics, bioinformatics, and behavioral research. | Semi-supervised learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained. |
| ScholarGateZbiór danych ↗ |
|
|