Structure Preserving Dimension Reduction for Clustered Text Data Based on the Generalized Singular Value Decomposition

DOI10.1137/S0895479801393666zbMath1061.68135WikidataQ60360083 ScholiaQ60360083MaRDI QIDQ4443805

Haesun Park, Peg Howland, Moongu Jeon

Publication date: 18 January 2004

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

pattern recognitiondiscriminant analysisdimension reductiongeneralized eigenvalue problemgeneralized singular value decompositiontext classificationscatter matrixtrace optimization

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Theory of matrix inversion and generalized inverses (15A09) Pattern recognition, speech recognition (68T10) Eigenvalues, singular values, and eigenvectors (15A18) Information storage and retrieval of data (68P20)

Related Items (30)

On sparse linear discriminant analysis algorithm for high-dimensional data classification ⋮ Nonlinear feature extraction based on centroids and kernel functions ⋮ DISCOVERING ROBUST EMBEDDINGS IN (DIS)SIMILARITY SPACE FOR HIGH-DIMENSIONAL LINGUISTIC FEATURES ⋮ Multiclass classifiers based on dimension reduction with generalized LDA ⋮ Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method ⋮ Superlinear convergence of a general algorithm for the generalized Foley-Sammon discriminant analysis ⋮ Unified formulation of linear discriminant analysis methods and optimal parameter selection ⋮ A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair ⋮ Regularized orthogonal linear discriminant analysis ⋮ On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere ⋮ A note on simple nonzero finite generalized singular values ⋮ A discriminant model for the pattern recognition of linearly independent samples ⋮ Novel Fisher discriminant classifiers ⋮ A novel method for the diagnosis of the incipient faults in analog circuits based on LDA and HMM ⋮ Complexity-reduced implementations of complete and null-space-based linear discriminant analysis ⋮ The GSVD: Where are the Ellipses?, Matrix Trigonometry, and More ⋮ A comparison of generalized linear discriminant analysis algorithms ⋮ Locally linear discriminant embedding: An efficient method for face recognition ⋮ A new and fast implementation for null space based linear discriminant analysis ⋮ Fingerprint classification using fast Fourier transform and nonlinear discriminant analysis ⋮ Text data mining: theory and methods ⋮ Feature extraction using two-dimensional local graph embedding based on maximum margin criterion ⋮ Kernel-based nonlinear discriminant analysis using minimum squared errors criterion for multiclass and undersampled problems ⋮ On choices of formulations of computing the generalized singular value decomposition of a large matrix pair ⋮ MBLDA: a novel multiple between-class linear discriminant analysis ⋮ Incremental Regularized Least Squares for Dimensionality Reduction of Large-Scale Data ⋮ Improving implementation of linear discriminant analysis for the high dimension/small sample size problem ⋮ A Jacobi-Davidson type method for the generalized singular value problem ⋮ A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy ⋮ Perturbation analysis for the trace quotient problem

This page was built for publication: Structure Preserving Dimension Reduction for Clustered Text Data Based on the Generalized Singular Value Decomposition