ScholarGate
Assistent

Compara mètodes

Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.

Arbre de decisió×FP-Growth (Frequent Pattern Growth)×Random Forest×
CampAprenentatge automàticAprenentatge automàticAprenentatge automàtic
FamíliaMachine learningMachine learningMachine learning
Any d'origen198420002001
Autor originalBreiman, Friedman, Olshen & StoneJiawei Han, Jian Pei & Yiwen YinBreiman, L.
TipusRecursive partitioning (if-then rules)Frequent-itemset mining algorithmEnsemble (bagging of decision trees)
Font seminalBreiman, 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 ↗
ÀliesKarar 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
Relacionats544
ResumA 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.
ScholarGateConjunt de dades
  1. v1
  2. 1 Fonts
  3. PUBLISHED
  1. v1
  2. 2 Fonts
  3. PUBLISHED
  1. v1
  2. 2 Fonts
  3. PUBLISHED

Ves a la cerca Baixa les diapositives

ScholarGateCompara mètodes: Decision Tree · FP-Growth · Random Forest. Recuperat el 2026-06-19 de https://scholargate.app/ca/compare