ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

DBSCAN×K-means Shlukování×Samoučící se učení×
OborStrojové učeníStrojové učeníStrojové učení
RodinaMachine learningMachine learningMachine learning
Rok vzniku19961967 (formalized 1982)2018–2020
TvůrceEster, M., Kriegel, H.-P., Sander, J. & Xu, X.MacQueen, J. B.; Lloyd, S. P.LeCun, Y. and community (formalized ~2018–2020)
TypDensity-based clustering algorithmPartitional clusteringRepresentation learning paradigm
Původní zdrojEster, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231. link ↗Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗LeCun, Y. & Misra, I. (2022). Self-supervised learning: The dark matter of intelligence. Meta AI Blog. https://ai.facebook.com/blog/self-supervised-learning-the-dark-matter-of-intelligence/ link ↗
Další názvyDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-meansSSL, self-supervised pre-training, pretext-task learning, unsupervised representation learning
Příbuzné343
ShrnutíDBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.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.Self-supervised learning (SSL) is a machine-learning paradigm that generates its own supervisory signal directly from unlabeled data by defining an auxiliary pretext task — such as predicting masked words, rotating images, or contrasting augmented views — and uses the learned representations as a powerful starting point for downstream tasks with minimal labeled examples.
ScholarGateDatová sada
  1. v1
  2. 1 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: DBSCAN · K-means · Self-supervised Learning. Získáno 2026-06-17 z https://scholargate.app/cs/compare