Semi-superviseret DBSCAN
Semi-superviseret DBSCAN udvider den kanoniske densitetsbaserede klyngealgoritme (Ester et al., 1996) ved at inkorporere et lille sæt parvise eller label-begrænsninger — must-link-par, der skal dele en klynge; cannot-link-par, der skal adskilles; eller en håndfuld kendte labels — for at styre klyngedannelsen, samtidig med at DBSCAN's evne til at opdage vilkårligt formede klynger og markere støjpunkter bevares.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Method map
The neighbourhood of related methods — select a node to explore.
Kilder
- Ester, 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 ↗
- Zhu, X., & Goldberg, A. B. (2009). Introduction to Semi-Supervised Learning. Morgan & Claypool Publishers. ISBN: 978-1-59829-548-7
Sådan citerer du denne side
ScholarGate. (2026, June 3). Semi-supervised Density-Based Spatial Clustering of Applications with Noise. ScholarGate. https://scholargate.app/da/machine-learning/semi-supervised-dbscan
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- DBSCANMaskinlæring↔ compare
- HDBSCANMaskinlæring↔ compare
- K-means ClusteringMaskinlæring↔ compare
- Semi-supervised Gaussian Mixture ModelMaskinlæring↔ compare
- Semi-overvåget K-meansMaskinlæring↔ compare
Refereret af
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →