ScholarGate
সহকারী

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

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

কে-মিনস ক্লাস্টারিং×ডিবিস্ক্যান×প্রধান উপাদান বিশ্লেষণ×
ক্ষেত্রযন্ত্র শিখনযন্ত্র শিখনযন্ত্র শিখন
পরিবারMachine learningMachine learningMachine learning
উদ্ভবের বছর1967 (formalized 1982)19962002
প্রবর্তকMacQueen, J. B.; Lloyd, S. P.Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
ধরনPartitional clusteringDensity-based clustering algorithmUnsupervised dimensionality reduction
মৌলিক উৎসLloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. 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 ↗Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗
অপর নামk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-meansDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringTemel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
সম্পর্কিত433
সারসংক্ষেপ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.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.Principal Component Analysis (PCA) is an unsupervised dimensionality-reduction method — given its modern textbook treatment by Ian Jolliffe (2002) — that compresses high-dimensional data into fewer dimensions while preserving the maximum possible variance. It re-expresses correlated variables as a small set of uncorrelated principal components ordered by how much of the data's variation each one captures.
ScholarGateডেটাসেট
  1. v1
  2. 2 উৎস
  3. PUBLISHED
  1. v1
  2. 1 উৎস
  3. PUBLISHED
  1. v1
  2. 1 উৎস
  3. PUBLISHED

অনুসন্ধানে যান স্লাইড ডাউনলোড করুন

ScholarGateপদ্ধতির তুলনা করুন: K-means · DBSCAN · Principal Component Analysis. 2026-06-19 তারিখে সংগৃহীত, উৎস: https://scholargate.app/bn/compare