ScholarGate
Assistent

Methoden vergleichen

Prüfen Sie die ausgewählten Methoden nebeneinander; abweichende Zeilen sind hervorgehoben.

Isolation Forest×Gaußsches Mischmodell×
FachgebietMaschinelles LernenMaschinelles Lernen
FamilieMachine learningMachine learning
Entstehungsjahr20081977
UrheberLiu, F.T., Ting, K.M. & Zhou, Z.-H.Dempster, Laird & Rubin (EM algorithm)
TypUnsupervised ensemble (random partitioning trees)Probabilistic (soft) clustering — mixture model
Wegweisende QuelleLiu, 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 ↗
AliasnamenIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detectionGaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians
Verwandt54
ZusammenfassungIsolation 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.
ScholarGateDatensatz
  1. v1
  2. 1 Quellen
  3. PUBLISHED
  1. v1
  2. 1 Quellen
  3. PUBLISHED

Zur Suche Folien herunterladen

ScholarGateMethoden vergleichen: Isolation Forest · Gaussian Mixture Model. Abgerufen am 2026-06-17 von https://scholargate.app/de/compare