Linganisha mbinu
Pitia mbinu ulizochagua bega kwa bega; safu zinazotofautiana zinaangaziwa.
| Mti wa Uamuzi× | FP-Growth (Frequent Pattern Growth)× | Msitu Nasibu× | |
|---|---|---|---|
| Nyanja | Ujifunzaji wa Mashine | Ujifunzaji wa Mashine | Ujifunzaji wa Mashine |
| Familia | Machine learning | Machine learning | Machine learning |
| Mwaka wa asili≠ | 1984 | 2000 | 2001 |
| Mwanzilishi≠ | Breiman, Friedman, Olshen & Stone | Jiawei Han, Jian Pei & Yiwen Yin | Breiman, L. |
| Aina≠ | Recursive partitioning (if-then rules) | Frequent-itemset mining algorithm | Ensemble (bagging of decision trees) |
| Chanzo asilia≠ | Breiman, 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 ↗ |
| Majina mbadala≠ | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Zinazohusiana≠ | 5 | 4 | 4 |
| Muhtasari≠ | A 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. |
| ScholarGateSeti ya data ↗ |
|
|
|