Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Алгоритм Apriori× | Кластеризация методом k-средних× | Обучение с частичной разметкой× | |
|---|---|---|---|
| Область | Машинное обучение | Машинное обучение | Машинное обучение |
| Семейство | Machine learning | Machine learning | Machine learning |
| Год появления≠ | 1994 | 1967 (formalized 1982) | 1970s–2006 (formalized) |
| Автор метода≠ | Agrawal, R. & Srikant, R. | MacQueen, J. B.; Lloyd, S. P. | Vapnik, V. N. and others (community of researchers, 1970s–2000s) |
| Тип≠ | Frequent itemset and association rule mining algorithm | Partitional clustering | Learning paradigm |
| Основополагающий источник≠ | 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 ↗ | Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗ | Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9 |
| Другие названия | Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means | SSL, semi-supervised machine learning, transductive learning, label-efficient learning |
| Связанные≠ | 5 | 4 | 5 |
| Сводка≠ | 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. | K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis. | 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. |
| ScholarGateНабор данных ↗ |
|
|
|