Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Algoritmus Apriori× | Semisupervisední učení× | |
|---|---|---|
| Obor | Strojové učení | Strojové učení |
| Rodina | Machine learning | Machine learning |
| Rok vzniku≠ | 1994 | 1970s–2006 (formalized) |
| Tvůrce≠ | Agrawal, R. & Srikant, R. | Vapnik, V. N. and others (community of researchers, 1970s–2000s) |
| Typ≠ | Frequent itemset and association rule mining algorithm | Learning paradigm |
| Původní zdroj≠ | Agrawal, R. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 487–499. link ↗ | Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9 |
| Další názvy | Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining | SSL, semi-supervised machine learning, transductive learning, label-efficient learning |
| Příbuzné | 5 | 5 |
| Shrnutí≠ | The Apriori algorithm, introduced by Agrawal and Srikant in 1994, is the foundational method for discovering frequent itemsets and association rules in transactional databases. It uses a breadth-first, level-wise search guided by the anti-monotone property of support to efficiently enumerate all item combinations that co-occur above a user-set minimum threshold, then extracts interpretable if-then rules from those patterns. | 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. |
| ScholarGateDatová sada ↗ |
|
|