ScholarGate
Avustaja

Vertaile menetelmiä

Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.

DBSCAN×Selitettävä K-lähimmän naapurin menetelmä×
TieteenalaKoneoppiminenKoneoppiminen
MenetelmäperheMachine learningMachine learning
Syntyvuosi19961967 (KNN); 2010s (explainability extensions)
KehittäjäEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Cover, T. & Hart, P. (KNN); XAI extensions by various authors
TyyppiDensity-based clustering algorithmInstance-based learning with explainability layer
AlkuperäislähdeEster, 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 ↗
RinnakkaisnimetDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringXKNN, Interpretable KNN, Explainable KNN, Transparent K-Nearest Neighbors
Liittyvät34
Tiivistelmä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.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.
ScholarGateAineisto
  1. v1
  2. 1 Lähteet
  3. PUBLISHED
  1. v1
  2. 2 Lähteet
  3. PUBLISHED

Siirry hakuun Lataa diat

ScholarGateVertaile menetelmiä: DBSCAN · Explainable K-Nearest Neighbors. Haettu 2026-06-18 osoitteesta https://scholargate.app/fi/compare