방법 비교

	Longformer / BigBird	랜덤 포레스트
분야	딥러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2020	2001
창시자	Beltagy, Peters & Cohan (Longformer); Zaheer et al. (BigBird)	Breiman, L.
유형	Sparse-attention Transformer for long sequences	Ensemble (bagging of decision trees)
원전	Beltagy, I., Peters, M. E. & Cohan, A. (2020). Longformer: The Long-Document Transformer. arXiv.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	Uzun Dizi Transformer (Longformer / BigBird), uzun dizi transformer, long-document transformer, sparse-attention transformer	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	4	4
요약	Long-sequence Transformers such as Longformer (Beltagy, Peters & Cohan, 2020) and BigBird (Zaheer et al., 2020) replace the standard Transformer's O(n²) attention with sparse attention patterns that scale linearly, O(n), with sequence length. This lets a single model attend over thousands of tokens — full documents, legal texts, or genomic sequences — that would not fit a conventional Transformer.	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.