ScholarGate
Trợ lý

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.

DBSCAN tự giám sát×DBSCAN×HDBSCAN×Phân cụm K-means×Học tăng cường tự giám sát×
Lĩnh vựcHọc máyHọc máyHọc máyHọc máyHọc máy
HọMachine learningMachine learningMachine learningMachine learningMachine learning
Năm ra đời2018–2021199620131967 (formalized 1982)2018–2020
Người khởi xướngEster et al. (DBSCAN base); pipeline pattern established in multiple works c. 2018–2021Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.Campello, R. J. G. B.; Moulavi, D.; Sander, J.MacQueen, J. B.; Lloyd, S. P.LeCun, Y. and community (formalized ~2018–2020)
LoạiTwo-stage pipeline (self-supervised pre-training + density-based clustering)Density-based clustering algorithmHierarchical density-based clusteringPartitional clusteringRepresentation learning paradigm
Công trình gốcEster, M., Kriegel, H.-P., Sander, J., & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), pp. 226–231. AAAI Press. link ↗Ester, 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 ↗Campello, R. J. G. B., Moulavi, D., & Sander, J. (2013). Density-Based Clustering Based on Hierarchical Density Estimates. In J. Pei et al. (Eds.), Advances in Knowledge Discovery and Data Mining. PAKDD 2013. Lecture Notes in Computer Science, vol. 7819 (pp. 160–172). Springer, Berlin, Heidelberg. DOI ↗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ácSSL-DBSCAN, self-supervised density clustering, contrastive DBSCAN, representation-based DBSCANDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringHDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-meansSSL, self-supervised pre-training, pretext-task learning, unsupervised representation learning
Liên quan53343
Tóm tắtSelf-supervised DBSCAN is a two-stage unsupervised pipeline that first trains a neural encoder on a pretext task — such as contrastive learning or masked reconstruction — to produce compact, semantically meaningful embeddings from unlabeled data, and then applies DBSCAN in the resulting embedding space to discover arbitrarily shaped clusters without requiring any class labels.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.HDBSCAN (Hierarchical Density-Based Spatial Clustering of Applications with Noise) is a density-based clustering algorithm introduced by Campello, Moulavi, and Sander in 2013. It extends DBSCAN by building a full hierarchy of density-based clusters across all density scales and then extracting a stable flat partition, making it robust to datasets where cluster densities vary substantially across regions.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
  1. v1
  2. 2 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 1 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 3 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 2 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 2 Nguồn tài liệu
  3. PUBLISHED

Đến trang tìm kiếm Tải xuống bản trình chiếu

ScholarGateSo sánh phương pháp: Self-supervised DBSCAN · DBSCAN · HDBSCAN · K-means · Self-supervised Learning. Truy cập ngày 2026-06-17 từ https://scholargate.app/vi/compare