방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 결정 트리× | LightGBM× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1984 | 2017 |
| 창시자≠ | Breiman, Friedman, Olshen & Stone | Ke, G. et al. (Microsoft) |
| 유형≠ | Recursive partitioning (if-then rules) | Gradient boosting decision tree ensemble |
| 원전≠ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ | Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q. & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems (NeurIPS) 30, 3146–3154. link ↗ |
| 별칭≠ | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting |
| 관련 | 5 | 5 |
| 요약≠ | 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. | LightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy. |
| ScholarGate데이터셋 ↗ |
|
|