পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| লংফর্মার / বিগবার্ড× | গ্রাফ অ্যাটেনশন নেটওয়ার্ক× | XGBoost× | |
|---|---|---|---|
| ক্ষেত্র≠ | গভীর শিখন | গভীর শিখন | যন্ত্র শিখন |
| পরিবার | Machine learning | Machine learning | Machine learning |
| উদ্ভবের বছর≠ | 2020 | 2018 | 2016 |
| প্রবর্তক≠ | Beltagy, Peters & Cohan (Longformer); Zaheer et al. (BigBird) | Veličković, P. et al. | Chen, T. & Guestrin, C. |
| ধরন≠ | Sparse-attention Transformer for long sequences | Graph neural network (attention-based) | Ensemble (gradient-boosted decision trees) |
| মৌলিক উৎস≠ | Beltagy, I., Peters, M. E. & Cohan, A. (2020). Longformer: The Long-Document Transformer. arXiv. link ↗ | Veličković, P. et al. (2018). Graph Attention Networks. ICLR. link ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| অপর নাম≠ | Uzun Dizi Transformer (Longformer / BigBird), uzun dizi transformer, long-document transformer, sparse-attention transformer | Graf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural network | XGBoost, extreme gradient boosting, scalable tree boosting |
| সম্পর্কিত≠ | 4 | 4 | 5 |
| সারসংক্ষেপ≠ | 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. | The Graph Attention Network (GAT), introduced by Veličković and colleagues in 2018, is a graph neural network variant that learns how much importance to assign to each neighbouring node through a self-attention mechanism. On heterogeneous neighbourhoods and relational classification it produces results superior to graph convolutional networks (GCN). | 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. |
| ScholarGateডেটাসেট ↗ |
|
|
|