ScholarGate
Asistents

Salīdzināt metodes

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

DBSCAN×Skaidrojams K tuvāko kaimiņu algoritms×
NozareMašīnmācīšanāsMašīnmācīšanās
SaimeMachine learningMachine learning
Izcelsmes gads19961967 (KNN); 2010s (explainability extensions)
AutorsEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Cover, T. & Hart, P. (KNN); XAI extensions by various authors
TipsDensity-based clustering algorithmInstance-based learning with explainability layer
PirmavotsEster, 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 ↗Cover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗
Citi nosaukumiDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringXKNN, Interpretable KNN, Explainable KNN, Transparent K-Nearest Neighbors
Saistītās34
KopsavilkumsDBSCAN 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.Explainable K-Nearest Neighbors (XKNN) augments the classic KNN classifier or regressor with structured post-hoc or built-in explanation mechanisms, exposing which retrieved neighbors, which features, and which distance contributions drive each individual prediction — making the model's reasoning transparent and auditable for human decision-makers.
ScholarGateDatu kopa
  1. v1
  2. 1 Avoti
  3. PUBLISHED
  1. v1
  2. 2 Avoti
  3. PUBLISHED

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

ScholarGateSalīdzināt metodes: DBSCAN · Explainable K-Nearest Neighbors. Izgūts 2026-06-18 no https://scholargate.app/lv/compare