ScholarGate
Msaidizi

Linganisha mbinu

Pitia mbinu ulizochagua bega kwa bega; safu zinazotofautiana zinaangaziwa.

Explainable K-Means×DBSCAN×
NyanjaUjifunzaji wa MashineUjifunzaji wa Mashine
FamiliaMachine learningMachine learning
Mwaka wa asili20201996
MwanzilishiDasgupta, S.; Moshkovitz, M.; Frost, N.; Rashtchian, C.Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.
AinaExplainable unsupervised clustering algorithmDensity-based clustering algorithm
Chanzo asiliaDasgupta, S., Frost, N., Moshkovitz, M., & Rashtchian, C. (2020). Explainability of k-Means Clustering. Proceedings of the 37th International Conference on Machine Learning (ICML), PMLR 119. link ↗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. link ↗
Majina mbadalaExKMC, interpretable k-means, decision-tree k-means, explainable clusteringDBSCAN Kümeleme, density-based clustering, density-based spatial clustering
Zinazohusiana53
MuhtasariExplainable K-Means is a post-hoc and in-model interpretability approach to standard K-Means clustering that replaces or approximates cluster assignments with a small axis-aligned decision tree. Each leaf of the tree corresponds to one cluster, and every data point is assigned to a cluster by following a simple sequence of threshold rules on individual features — making cluster membership fully transparent and human-readable.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.
ScholarGateSeti ya data
  1. v1
  2. 2 Vyanzo
  3. PUBLISHED
  1. v1
  2. 1 Vyanzo
  3. PUBLISHED

Nenda kwenye utafutaji Pakua slaidi

ScholarGateLinganisha mbinu: Explainable K-Means · DBSCAN. Imepatikana 2026-06-17 kutoka https://scholargate.app/sw/compare