ScholarGate
সহকারী

পদ্ধতির তুলনা করুন

নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।

দৃঢ় কে-মিনস (Robust 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/bn/compare