পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| অনলাইন অ্যাক্টিভ লার্নিং× | অনলাইন লজিস্টিক রিগ্রেশন× | |
|---|---|---|
| ক্ষেত্র | যন্ত্র শিখন | যন্ত্র শিখন |
| পরিবার | Machine learning | Machine learning |
| উদ্ভবের বছর≠ | 2000s | 1960s (perceptron); formalized for logistic loss ~2000s |
| প্রবর্তক≠ | Cesa-Bianchi, N. and others (multiple contributors) | Rosenblatt, F. / Widrow, B. (perceptron era); modern SGD form: Bottou, L. |
| ধরন≠ | Hybrid learning paradigm (online + active) | Incremental supervised classifier |
| মৌলিক উৎস≠ | Cesa-Bianchi, N., Gentile, C., & Zaniboni, L. (2006). Worst-case analysis of selective sampling for linear classification. Journal of Machine Learning Research, 7, 1205–1230. link ↗ | Bottou, L. (2010). Large-Scale Machine Learning with Stochastic Gradient Descent. In Proceedings of COMPSTAT 2010, 177–186. Physica-Verlag. link ↗ |
| অপর নাম | streaming active learning, online query-by-committee, sequential active learning, incremental active learning | incremental logistic regression, streaming logistic regression, SGD logistic classifier, online binary classifier |
| সম্পর্কিত≠ | 6 | 5 |
| সারসংক্ষেপ≠ | Online active learning combines two complementary paradigms: it processes data as a stream (online learning) and selectively requests labels only for the most informative instances (active learning). The result is a model that adapts continuously to new data while keeping labeling costs low — useful whenever labeled data is expensive and examples arrive sequentially rather than all at once. | Online Logistic Regression fits a logistic classifier one sample (or mini-batch) at a time via stochastic gradient descent, updating model weights as each observation arrives rather than waiting to see the full dataset. This makes it the standard choice for high-volume, streaming, or memory-constrained binary classification problems where batch training is infeasible. |
| ScholarGateডেটাসেট ↗ |
|
|