ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Ομαδοποίηση K-means×Variational Autoencoder×
ΠεδίοΜηχανική ΜάθησηΒαθιά Μάθηση
ΟικογένειαMachine learningMachine learning
Έτος προέλευσης1967 (formalized 1982)2014
ΔημιουργόςMacQueen, J. B.; Lloyd, S. P.Kingma, D. P. & Welling, M.
ΤύποςPartitional clusteringDeep generative latent-variable model (encoder–decoder)
Θεμελιώδης πηγήLloyd, 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 ↗
Εναλλακτικές ονομασίεςk-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
Συναφείς45
ΣύνοψηK-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.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 2 Πηγές
  3. PUBLISHED
  1. v1
  2. 2 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: K-means · Variational Autoencoder. Ανακτήθηκε στις 2026-06-17 από https://scholargate.app/el/compare