Clustering and Disjoint Principal Component Analysis - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computational Statistics and Data Analysis Année : 2008

Clustering and Disjoint Principal Component Analysis

Résumé

A constrained principal component analysis, which aims at a simultaneous clustering of objects and a partitioning of variables is proposed. The new methodology allows to identify components with maximum variance, each one a linear combination of a subset of variables. All the subsets form a partition of variables. Simultaneously, a partition of objects is also computed maximizing the between cluster variance. The methodology is formulated in a semi-parametric least-squares framework as a quadratic mixed continuous and integer problem. An alternating leastsquares algorithm is proposed to solve the clustering and disjoint PCA. Two applications are given to show the features of the methodology.

Dates et versions

hal-01125538 , version 1 (06-03-2015)

Identifiants

Citer

Maurizio Vichi, Gilbert Saporta. Clustering and Disjoint Principal Component Analysis. Computational Statistics and Data Analysis, 2008, 53 (8), pp.3194-3208. ⟨10.1016/j.csda.2008.05.028⟩. ⟨hal-01125538⟩

Collections

CNAM CEDRIC-CNAM
89 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More