ScholarGate
Assistent

Methoden vergelijken

Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.

Isolation Forest×Gaussiaans Mixture Model×
VakgebiedMachine learningMachine learning
FamilieMachine learningMachine learning
Jaar van ontstaan20081977
GrondleggerLiu, F.T., Ting, K.M. & Zhou, Z.-H.Dempster, Laird & Rubin (EM algorithm)
TypeUnsupervised ensemble (random partitioning trees)Probabilistic (soft) clustering — mixture model
Oorspronkelijke bronLiu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗Dempster, A.P., Laird, N.M. & Rubin, D.B. (1977). Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society: Series B, 39(1), 1–22. DOI ↗
AliassenIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detectionGaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians
Verwant54
SamenvattingIsolation 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.A Gaussian Mixture Model is a probabilistic clustering method that models the data as a weighted mixture of several Gaussian distributions, fitted with the Expectation–Maximization algorithm formalized by Dempster, Laird & Rubin in 1977. It is a generalization of K-means in which each cluster can take its own shape, size, and orientation.
ScholarGateGegevensset
  1. v1
  2. 1 Bronnen
  3. PUBLISHED
  1. v1
  2. 1 Bronnen
  3. PUBLISHED

Naar zoeken Dia's downloaden

ScholarGateMethoden vergelijken: Isolation Forest · Gaussian Mixture Model. Geraadpleegd op 2026-06-17 via https://scholargate.app/nl/compare