방법 비교

	LightGBM	결정 트리	Isolation Forest	랜덤 포레스트
분야	머신러닝	머신러닝	머신러닝	머신러닝
계열	Machine learning	Machine learning	Machine learning	Machine learning
기원 연도	2017	1984	2008	2001
창시자	Ke, G. et al. (Microsoft)	Breiman, Friedman, Olshen & Stone	Liu, F.T., Ting, K.M. & Zhou, Z.-H.	Breiman, L.
유형	Gradient boosting decision tree ensemble	Recursive partitioning (if-then rules)	Unsupervised ensemble (random partitioning trees)	Ensemble (bagging of decision trees)
원전	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.	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	Isolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	5	5	5	4
요약	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.	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.	Isolation Forest is an unsupervised machine-learning method for anomaly and outlier detection, introduced by Liu, Ting and Zhou in 2008, that isolates anomalies through random partitioning of the data. It works without any labelled anomaly data and scales to high-dimensional 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.