Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Semi-supervised DBSCAN× | Semi-övervakad Gaussisk blandningsmodell× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2000s | 2000 |
| Upphovsperson≠ | Ester, M. et al. (DBSCAN base); semi-supervised extensions by multiple authors (2000s–2010s) | Nigam, K.; McCallum, A. K.; Thrun, S.; Mitchell, T. |
| Typ≠ | Constrained density-based clustering | Generative semi-supervised classifier |
| Ursprungskälla≠ | 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 ↗ | Chapelle, O., Scholkopf, B., & Zien, A. (Eds.). (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9 |
| Alias | Constrained DBSCAN, SS-DBSCAN, DBSCAN with must-link/cannot-link constraints, seeded DBSCAN | SS-GMM, semi-supervised GMM, partially labeled Gaussian mixture model, generative semi-supervised classifier |
| Närliggande≠ | 5 | 3 |
| Sammanfattning≠ | Semi-supervised DBSCAN extends the canonical density-based clustering algorithm (Ester et al., 1996) by incorporating a small set of pairwise or label constraints — must-link pairs that must share a cluster, cannot-link pairs that must be separated, or a handful of known labels — to guide cluster formation while retaining DBSCAN's ability to discover arbitrary-shaped clusters and flag noise points. | The Semi-supervised Gaussian Mixture Model (SS-GMM) is a generative probabilistic classifier that fits a Gaussian mixture to both labeled and unlabeled data using the Expectation-Maximization algorithm. Labeled points constrain component assignments while unlabeled points improve density estimates, enabling effective learning when annotations are scarce. |
| ScholarGateDatamängd ↗ |
|
|