방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 강건 판별 분석× | 선형 판별 분석 (LDA)× | |
|---|---|---|
| 분야≠ | 통계학 | 머신러닝 |
| 계열≠ | Regression model | Latent structure |
| 기원 연도≠ | 1997 | 1936 |
| 창시자≠ | Hawkins & McLachlan (high-breakdown LDA); Croux & Dehon (S-estimator robust LDA) | Fisher, R. A. |
| 유형≠ | Robust classification / discriminant analysis | Supervised dimensionality reduction and linear classifier |
| 원전≠ | Hawkins, D. M. & McLachlan, G. J. (1997). High Breakdown Linear Discriminant Analysis. Journal of the American Statistical Association, 92(437), 136-143. DOI ↗ | Fisher, R. A. (1936). The use of multiple measurements in taxonomic problems. Annals of Eugenics, 7(2), 179–188. DOI ↗ |
| 별칭≠ | robust LDA, high-breakdown discriminant analysis, MCD-based discriminant analysis, Robust Diskriminant Analizi | LDA, Fisher's discriminant analysis, Fisher linear discriminant, normal discriminant analysis |
| 관련≠ | 5 | 4 |
| 요약≠ | Robust Discriminant Analysis is a classification method that separates groups with a linear discriminant function while resisting the influence of outliers. It replaces the classical mean and covariance with a high-breakdown estimator such as the Minimum Covariance Determinant (MCD), an approach developed by Hawkins & McLachlan (1997) and Croux & Dehon (2001). | Linear Discriminant Analysis is a supervised method for dimensionality reduction and classification, introduced by Ronald A. Fisher in 1936, that finds linear combinations of features which maximally separate predefined classes while preserving as much class-discriminatory information as possible. It simultaneously serves as a feature-projection technique and a probabilistic classifier, making it one of the foundational methods in pattern recognition and statistical learning. |
| ScholarGate데이터셋 ↗ |
|
|