ScholarGate
Assistent

Methoden vergelijken

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

K-means Clustering×Variational Autoencoder×
VakgebiedMachine learningDeep learning
FamilieMachine learningMachine learning
Jaar van ontstaan1967 (formalized 1982)2014
GrondleggerMacQueen, J. B.; Lloyd, S. P.Kingma, D. P. & Welling, M.
TypePartitional clusteringDeep generative latent-variable model (encoder–decoder)
Oorspronkelijke bronLloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗Kingma, D. P. & Welling, M. (2014). Auto-Encoding Variational Bayes. International Conference on Learning Representations (ICLR). link ↗
Aliassenk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-meansDeğişkensel Otokodlayıcı (VAE), VAE, auto-encoding variational Bayes, deep latent variable model
Verwant45
SamenvattingK-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis.The Variational Autoencoder (VAE) is a deep generative latent-variable model, introduced by Diederik Kingma and Max Welling in 2014, that encodes data as a probability distribution in a latent space and samples from that distribution to generate new examples. It is used for data generation, anomaly detection, and feature learning.
ScholarGateGegevensset
  1. v1
  2. 2 Bronnen
  3. PUBLISHED
  1. v1
  2. 2 Bronnen
  3. PUBLISHED

Naar zoeken Dia's downloaden

ScholarGateMethoden vergelijken: K-means · Variational Autoencoder. Geraadpleegd op 2026-06-17 via https://scholargate.app/nl/compare