ScholarGate
Асистент

Сравнение на методи

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

Робастен каноничен корелационен анализ (Robust CCA)×Устойчив дискриминантен анализ×
ОбластСтатистикаСтатистика
СемействоLatent structureRegression model
Година на възникване20031997
СъздателCroux & Dehon (building on Hotelling's CCA framework)Hawkins & McLachlan (high-breakdown LDA); Croux & Dehon (S-estimator robust LDA)
ТипRobust multivariate associationRobust classification / discriminant analysis
Основополагащ източникCroux, C. & Dehon, C. (2003). Robust estimation of the canonical correlations. Computational Statistics, 18(3), 555–569. link ↗Hawkins, D. M. & McLachlan, G. J. (1997). High Breakdown Linear Discriminant Analysis. Journal of the American Statistical Association, 92(437), 136-143. DOI ↗
Други названияRobust CCA, RCCA, robust CCA, outlier-resistant canonical correlationrobust LDA, high-breakdown discriminant analysis, MCD-based discriminant analysis, Robust Diskriminant Analizi
Свързани45
РезюмеRobust canonical correlation analysis extends classical CCA by replacing the standard sample covariance matrix with a robust estimator — such as the Minimum Covariance Determinant (MCD) or S-estimator — so that outlying observations do not distort the estimated canonical correlations and canonical variates between two sets of variables.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).
ScholarGateНабор от данни
  1. v1
  2. 2 Източници
  3. PUBLISHED
  1. v1
  2. 2 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: Robust Canonical Correlation Analysis · Robust Discriminant Analysis. Извлечено на 2026-06-18 от https://scholargate.app/bg/compare