Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Онлайн-правила асоціацій× | FP-Growth (Frequent Pattern Growth)× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1996 | 2000 |
| Автор методу≠ | Cheung, D. W., Han, J., Ng, V. T., & Wong, C. Y. | Jiawei Han, Jian Pei & Yiwen Yin |
| Тип≠ | Incremental / streaming pattern mining | Frequent-itemset mining algorithm |
| Основоположне джерело≠ | 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 ↗ | Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12. DOI ↗ |
| Інші назви | Incremental association rule mining, Streaming association rules, Online ARM, Incremental ARM | frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme |
| Пов'язані≠ | 5 | 4 |
| Підсумок≠ | 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. | FP-Growth, introduced by Jiawei Han, Jian Pei, and Yiwen Yin in 2000, mines frequent itemsets from transaction data without generating candidate sets, the costly step that slows the classic Apriori algorithm. It compresses the database into a frequent-pattern tree (FP-tree) in two scans, then grows frequent patterns recursively from that structure, making it dramatically faster than Apriori on large, dense datasets. |
| ScholarGateНабір даних ↗ |
|
|