방법 비교

	오토인코더	랜덤 포레스트	XGBoost
분야	딥러닝	머신러닝	머신러닝
계열	Machine learning	Machine learning	Machine learning
기원 연도	2006	2001	2016
창시자	Hinton, G.E. & Salakhutdinov, R.R.	Breiman, L.	Chen, T. & Guestrin, C.
유형	Neural network (encoder-decoder)	Ensemble (bagging of decision trees)	Ensemble (gradient-boosted decision trees)
원전	Hinton, G.E. & Salakhutdinov, R.R. (2006). Reducing the Dimensionality of Data with Neural Networks. Science, 313(5786), 504–507.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
별칭	Otokodlayıcı (Autoencoder), otokodlayıcı, auto-encoder, encoder-decoder network	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	XGBoost, extreme gradient boosting, scalable tree boosting
관련	4	4	5
요약	An autoencoder is an encoder-decoder neural network, popularised by Hinton and Salakhutdinov in 2006, that compresses data into a low-dimensional latent code and then reconstructs it, enabling dimensionality reduction and anomaly detection. By learning to rebuild its own input through a narrow bottleneck, it discovers a compact representation of the data.	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.	XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.