ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

K-평균 군집화×선형 판별 분석 (LDA×
분야머신러닝통계학
계열Machine learningHypothesis test
기원 연도19671936
창시자MacQueen, J.Ronald A. Fisher
유형Partitional clustering (centroid-based)Parametric linear classifier / dimensionality reduction
원전MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297. link ↗Fisher, R.A. (1936). The Use of Multiple Measurements in Taxonomic Problems. Annals of Eugenics, 7(2), 179–188. DOI ↗
별칭K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clusteringLDA, Fisher's LDA, Fisher's linear discriminant, discriminant function analysis
관련37
요약K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis.Linear Discriminant Analysis (LDA) is a parametric supervised classification method that finds the linear combination of continuous predictors that best separates two or more predefined groups. Introduced by Ronald A. Fisher in his landmark 1936 paper on taxonomic measurements, it simultaneously serves as a classifier and a dimensionality-reduction tool, and can be understood as the classification-oriented counterpart of MANOVA.
ScholarGate데이터셋
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: K-Means Clustering · Linear Discriminant Analysis (Classification). 2026-06-17에 다음에서 검색함: https://scholargate.app/ko/compare