Порівняння методів

	Правила асоціацій з активним навчанням	FP-Growth (Frequent Pattern Growth)
Галузь	Машинне навчання	Машинне навчання
Родина	Machine learning	Machine learning
Рік появи	2010s	2000
Автор методу	Dzyuba, V. & van Leeuwen, M.; Boley, M. et al.	Jiawei Han, Jian Pei & Yiwen Yin
Тип	Interactive pattern mining	Frequent-itemset mining algorithm
Основоположне джерело	Dzyuba, V., & van Leeuwen, M. (2017). Interactive Discovery of Interesting Association Rules by Subjective Interestingness. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD). Springer.	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12.
Інші назви	interactive association rule mining, active rule mining, query-driven association rule discovery, user-guided association rules	frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme
Пов'язані	5	4
Підсумок	Active learning association rules combines the iterative query-and-label loop of active learning with association rule mining, allowing a human expert to guide the discovery process interactively. Instead of exhaustively enumerating all rules above a fixed support-confidence threshold, the system selects the most informative rule candidates and asks the user to judge their interestingness, focusing the search on subjectively useful patterns.	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.