Compară metode

	DBSCAN auto-supervizat	DBSCAN
Domeniu	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning
Anul apariției	2018–2021	1996
Autorul original	Ester et al. (DBSCAN base); pipeline pattern established in multiple works c. 2018–2021	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.
Tip	Two-stage pipeline (self-supervised pre-training + density-based clustering)	Density-based clustering algorithm
Sursa seminală	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.	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.
Denumiri alternative	SSL-DBSCAN, self-supervised density clustering, contrastive DBSCAN, representation-based DBSCAN	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering
Înrudite	5	3
Rezumat	Self-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.