ScholarGate
সহকারী

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

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

সিদ্ধান্ত বৃক্ষ×গাউসিয়ান মিক্সচার মডেল×প্রধান উপাদান বিশ্লেষণ×
ক্ষেত্রযন্ত্র শিখনযন্ত্র শিখনযন্ত্র শিখন
পরিবারMachine learningMachine learningMachine learning
উদ্ভবের বছর198419772002
প্রবর্তকBreiman, Friedman, Olshen & StoneDempster, Laird & Rubin (EM algorithm)Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
ধরনRecursive partitioning (if-then rules)Probabilistic (soft) clustering — mixture modelUnsupervised dimensionality reduction
মৌলিক উৎসBreiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Dempster, A.P., Laird, N.M. & Rubin, D.B. (1977). Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society: Series B, 39(1), 1–22. DOI ↗Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗
অপর নামKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeGaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of GaussiansTemel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
সম্পর্কিত543
সারসংক্ষেপA Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.A Gaussian Mixture Model is a probabilistic clustering method that models the data as a weighted mixture of several Gaussian distributions, fitted with the Expectation–Maximization algorithm formalized by Dempster, Laird & Rubin in 1977. It is a generalization of K-means in which each cluster can take its own shape, size, and orientation.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. 1 উৎস
  3. PUBLISHED
  1. v1
  2. 1 উৎস
  3. PUBLISHED
  1. v1
  2. 1 উৎস
  3. PUBLISHED

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

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