विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| बैगिंग (बूटस्ट्रैप एग्रीगेटिंग)× | आइसोलेशन फ़ॉरेस्ट× | |
|---|---|---|
| क्षेत्र | मशीन अधिगम | मशीन अधिगम |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1996 | 2008 |
| प्रवर्तक≠ | Breiman, L. | Liu, F.T., Ting, K.M. & Zhou, Z.-H. |
| प्रकार≠ | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) | Unsupervised ensemble (random partitioning trees) |
| मौलिक स्रोत≠ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ | Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗ |
| उपनाम≠ | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor | Isolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection |
| संबंधित | 5 | 5 |
| सारांश≠ | Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner. | 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. |
| ScholarGateडेटासेट ↗ |
|
|