Сравнение на методи

	Откриване на извън-разпределени данни	Isolation Forest	Квантифициране на неопределеността
Област	Машинно обучение	Машинно обучение	Симулационно моделиране
Семейство	Machine learning	Machine learning	Process / pipeline
Година на възникване	2017	2008	Seminal modern form: 2002
Създател	Hendrycks & Gimpel	Liu, F.T., Ting, K.M. & Zhou, Z.-H.	Norbert Wiener (polynomial chaos, 1938); extended to Wiener–Askey scheme by Xiu & Karniadakis (2002)
Тип	Reliability and safety method for neural networks	Unsupervised ensemble (random partitioning trees)	Computational uncertainty analysis framework
Основополагащ източник	Hendrycks, D., & Gimpel, K. (2017). A baseline for detecting misclassified and out-of-distribution examples in neural networks. International Conference on Learning Representations.	Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422.	Xiu, D. & Karniadakis, G.E. (2002). The Wiener-Askey Polynomial Chaos for Stochastic Differential Equations. SIAM Journal on Scientific Computing, 24(2), 619–644.
Други названия	OOD Detection, Novelty Detection, Open-Set Recognition, Dağılım Dışı Tespit	Isolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection	UQ, polynomial chaos expansion, PCE, Kriging surrogate
Свързани	3	5	9
Резюме	Out-of-Distribution (OOD) detection is a set of techniques that identify when a deployed machine learning model receives inputs that differ significantly from its training data distribution. Introduced as a formal problem by Hendrycks and Gimpel in 2017, these methods enable models to flag unfamiliar inputs rather than silently produce unreliable predictions, making them foundational to trustworthy and safe AI deployment in high-stakes domains.	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.	Uncertainty Quantification (UQ) is a computational framework for systematically measuring how uncertainty in the inputs of a model propagates into uncertainty in its outputs. Building on Wiener's polynomial chaos theory (1938) and formalised for general stochastic problems by Xiu and Karniadakis (2002), UQ uses two primary strategies: Polynomial Chaos Expansion (PCE), which represents the model output as a series of orthogonal polynomials matched to the input distributions, and Kriging (Gaussian process) surrogates, which replace an expensive simulation with a fast statistical approximation fitted to a small set of carefully chosen runs.