ScholarGate
Ассистент

Сравнение методов

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

Онлайн-ассоциативные правила×Алгоритм Apriori×Онлайн-обучение×
ОбластьМашинное обучениеМашинное обучениеМашинное обучение
СемействоMachine learningMachine learningMachine learning
Год появления199619941958–2000s
Автор методаCheung, D. W., Han, J., Ng, V. T., & Wong, C. Y.Agrawal, R. & Srikant, R.Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors)
ТипIncremental / streaming pattern miningFrequent itemset and association rule mining algorithmLearning paradigm (sequential model update)
Основополагающий источникCheung, D. W., Han, J., Ng, V. T., & Wong, C. Y. (1996). Maintenance of discovered association rules in large databases: an incremental updating technique. In Proceedings of the 12th International Conference on Data Engineering (ICDE 1996), pp. 106–114. IEEE. link ↗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 ↗Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗
Другие названияIncremental association rule mining, Streaming association rules, Online ARM, Incremental ARMApriori, frequent itemset mining, ARL-Apriori, Apriori association miningincremental learning, sequential learning, streaming learning, online machine learning
Связанные556
СводкаOnline association rule mining discovers if-then patterns (e.g., buying bread implies buying butter) from transactional data that arrives incrementally or as a stream, updating existing rules and item counts without re-scanning the entire historical database each time new records arrive.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.Online learning is a machine learning paradigm in which a model is updated incrementally as each new data point arrives, rather than being trained once on a fixed dataset. It is essential when data streams continuously, storage is limited, or the underlying distribution shifts over time. Theoretical performance is measured by cumulative regret relative to the best fixed predictor in hindsight.
ScholarGateНабор данных
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 2 Источники
  3. PUBLISHED

Перейти к поиску Скачать слайды

ScholarGateСравнение методов: Online Association Rules · Apriori Algorithm · Online Learning. Получено 2026-06-18 из https://scholargate.app/ru/compare