ScholarGate
Asistents

Salīdzināt metodes

Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.

Daļēji uzraudzīta HDBSCAN×K-means klasterizācija×
NozareMašīnmācīšanāsMašīnmācīšanās
SaimeMachine learningMachine learning
Izcelsmes gads2017–present1967 (formalized 1982)
AutorsMcInnes, L.; Healy, J. (base HDBSCAN); semi-supervised extensions by various authorsMacQueen, J. B.; Lloyd, S. P.
TipsSemi-supervised density-based clusteringPartitional clustering
PirmavotsMcInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI ↗Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗
Citi nosaukumiConstrained HDBSCAN, Semi-supervised hierarchical density clustering, HDBSCAN with partial labels, SS-HDBSCANk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
Saistītās64
KopsavilkumsSemi-supervised HDBSCAN extends the Hierarchical Density-Based Spatial Clustering of Applications with Noise (HDBSCAN) algorithm by incorporating partial supervision — such as must-link and cannot-link pairwise constraints or a small set of labeled examples — to guide the density-based cluster hierarchy toward cluster assignments that are consistent with available domain knowledge.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.
ScholarGateDatu kopa
  1. v1
  2. 2 Avoti
  3. PUBLISHED
  1. v1
  2. 2 Avoti
  3. PUBLISHED

Doties uz meklēšanu Lejupielādēt slaidus

ScholarGateSalīdzināt metodes: Semi-supervised HDBSCAN · K-means. Izgūts 2026-06-18 no https://scholargate.app/lv/compare