So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Phân cụm K-means× | Học tăng cường tự giám sát× | |
|---|---|---|
| Lĩnh vực | Học máy | Học máy |
| Họ | Machine learning | Machine learning |
| Năm ra đời≠ | 1967 (formalized 1982) | 2018–2020 |
| Người khởi xướng≠ | MacQueen, J. B.; Lloyd, S. P. | LeCun, Y. and community (formalized ~2018–2020) |
| Loại≠ | Partitional clustering | Representation learning paradigm |
| Công trình gốc≠ | 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 ↗ |
| Tên gọi khác | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means | SSL, self-supervised pre-training, pretext-task learning, unsupervised representation learning |
| Liên quan≠ | 4 | 3 |
| Tóm tắt≠ | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|