ScholarGate
Assistente

Comparar métodos

Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.

Isolation Forest×Modelo de Mistura Gaussiana×
ÁreaAprendizado de máquinaAprendizado de máquina
FamíliaMachine learningMachine learning
Ano de origem20081977
Autor originalLiu, F.T., Ting, K.M. & Zhou, Z.-H.Dempster, Laird & Rubin (EM algorithm)
TipoUnsupervised ensemble (random partitioning trees)Probabilistic (soft) clustering — mixture model
Fonte seminalLiu, 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 ↗
Outros nomesIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detectionGaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians
Relacionados54
ResumoIsolation 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.
ScholarGateConjunto de dados
  1. v1
  2. 1 Fontes
  3. PUBLISHED
  1. v1
  2. 1 Fontes
  3. PUBLISHED

Ir para a pesquisa Baixar slides

ScholarGateComparar métodos: Isolation Forest · Gaussian Mixture Model. Recuperado em 2026-06-17 de https://scholargate.app/pt/compare