ScholarGate
Assistent

Sammenlign metoder

Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.

Isolation Forest×Beslutningstræ×Gaussisk Blandingsmodel×
FagområdeMaskinlæringMaskinlæringMaskinlæring
FamilieMachine learningMachine learningMachine learning
Oprindelsesår200819841977
OphavspersonLiu, F.T., Ting, K.M. & Zhou, Z.-H.Breiman, Friedman, Olshen & StoneDempster, Laird & Rubin (EM algorithm)
TypeUnsupervised ensemble (random partitioning trees)Recursive partitioning (if-then rules)Probabilistic (soft) clustering — mixture model
Oprindelig kildeLiu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. 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 ↗
AliasserIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detectionKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeGaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians
Relaterede554
Resumé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.A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.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.
ScholarGateDatasæt
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED

Gå til søgning Hent slides

ScholarGateSammenlign metoder: Isolation Forest · Decision Tree · Gaussian Mixture Model. Hentet 2026-06-18 fra https://scholargate.app/da/compare