Comparar métodos

	Regras de Associação	FP-Growth (Frequent Pattern Growth)
Área	Aprendizado de máquina	Aprendizado de máquina
Família	Machine learning	Machine learning
Ano de origem	1993	2000
Autor original	Agrawal, R., Imielinski, T., & Swami, A.	Jiawei Han, Jian Pei & Yiwen Yin
Tipo	Unsupervised pattern discovery	Frequent-itemset mining algorithm
Fonte seminal	Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207–216.	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12.
Outros nomes	market basket analysis, association rule mining, frequent itemset mining, affinity analysis	frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme
Relacionados	4	4
Resumo	Association rule learning is an unsupervised technique that discovers co-occurrence patterns — 'if X then Y' implications — within large transactional datasets. Originally formalized by Agrawal, Imielinski, and Swami (1993) for supermarket basket analysis, it is now widely applied in e-commerce recommendation, health informatics, bioinformatics, and behavioral research.	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.