Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| Algoritmo Ensemble Apriori× | Random Forest× | |
|---|---|---|
| Área | Aprendizado de máquina | Aprendizado de máquina |
| Família | Machine learning | Machine learning |
| Ano de origem≠ | 1994 (Apriori base); ensemble extensions 2000s–2010s | 2001 |
| Autor original≠ | Agrawal, R. & Srikant, R. (Apriori base); ensemble extension by multiple researchers | Breiman, L. |
| Tipo≠ | Ensemble / Frequent Pattern Mining | Ensemble (bagging of decision trees) |
| Fonte seminal≠ | Agrawal, R. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 1215, 487–499. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Outros nomes | Ensemble Apriori, Ensemble Association Rule Mining, EAR mining, Distributed Apriori Ensemble | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Relacionados≠ | 5 | 4 |
| Resumo≠ | The Ensemble Apriori Algorithm applies ensemble principles to the classic Apriori frequent-pattern miner by running multiple Apriori instances on different data partitions or parameter settings and merging their rule sets. This approach improves coverage, reduces sensitivity to the minimum-support threshold, and scales association rule mining to larger transactional datasets. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGateConjunto de dados ↗ |
|
|