ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

الوسيط كيه-مينز القوي (Robust k-means)×DBSCAN×تجميع K-means×
المجالتعلم الآلةتعلم الآلةتعلم الآلة
العائلةMachine learningMachine learningMachine learning
سنة النشأة199919961967 (formalized 1982)
صاحب الطريقةGarcia-Escudero, L. A. & Gordaliza, A.Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.MacQueen, J. B.; Lloyd, S. P.
النوعRobust clustering algorithmDensity-based clustering algorithmPartitional clustering
المصدر التأسيسيGarcia-Escudero, L. A., & Gordaliza, A. (1999). Robustness properties of k-means and trimmed k-means. Journal of the American Statistical Association, 94(447), 956–969. DOI ↗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 ↗Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗
الأسماء البديلةrobust k-means clustering, trimmed k-means, outlier-resistant k-means, RKMDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
ذات صلة434
الملخصRobust k-means is a variant of classical k-means clustering designed to resist the influence of outliers. By trimming a specified fraction of the most extreme observations before computing cluster centers, it produces stable and meaningful partitions even when the data contain noise, contamination, or heavy-tailed distributions — situations where standard k-means breaks down.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.K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis.
ScholarGateمجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 1 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Robust k-means · DBSCAN · K-means. استُرجع بتاريخ 2026-06-20 من https://scholargate.app/ar/compare