ScholarGate
Assistente

Confronta i metodi

Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.

Albero decisionale×FP-Growth (Frequent Pattern Growth)×Random Forest×
CampoApprendimento automaticoApprendimento automaticoApprendimento automatico
FamigliaMachine learningMachine learningMachine learning
Anno di origine198420002001
IdeatoreBreiman, Friedman, Olshen & StoneJiawei Han, Jian Pei & Yiwen YinBreiman, L.
TipoRecursive partitioning (if-then rules)Frequent-itemset mining algorithmEnsemble (bagging of decision trees)
Fonte seminaleBreiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
AliasKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treefrequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütmeRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Correlati544
SintesiA Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.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.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.
ScholarGateInsieme di dati
  1. v1
  2. 1 Fonti
  3. PUBLISHED
  1. v1
  2. 2 Fonti
  3. PUBLISHED
  1. v1
  2. 2 Fonti
  3. PUBLISHED

Vai alla ricerca Scarica le diapositive

ScholarGateConfronta i metodi: Decision Tree · FP-Growth · Random Forest. Consultato il 2026-06-19 da https://scholargate.app/it/compare