Regularized linear and kernel redundancy analysis
By Yoshio Takane, Heungsun Hwang. 2007
36 citations recorded by the source corpus.
Subfields: Analytical Chemistry, Food Science, Statistics and Probability
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Analytical Chemistry
- Sunho Jung
- X. Zhang
- Kaiming He
- Jianhua Zou
- Arthur Tenenhaus
- Michel Tenenhaus
- Breton L. Minnehan
- Andreas Savakis
In Food Science
- X. Zhang
- Kaiming He
- Jianhua Zou
- Sunho Jung
- Arthur Tenenhaus
- Breton L. Minnehan
- Andreas Savakis
- Michel Tenenhaus
In Statistics and Probability
- Michel Tenenhaus
- Heungsun Hwang
- Sunho Jung
- X. Zhang
- Kaiming He
- Jianhua Zou
- Breton L. Minnehan
- Andreas Savakis
Citations in the corpus
- Accelerating Very Deep Convolutional Networks for Classification and Detection (2015, methodology): “GSVD [30] is applied on 277 M̂: M̂ = USV>, such that U is a d-by-d orthogonal 278 matrix satisfying U>U = Id where Id is a d-by-d 279 identity matrix, and V is a d-by-d matrix satisfying 280 V>YY>V = Id (called generalized orthogonality).”
- Efficient and accurate approximations of nonlinear convolutional networks (2014, methodology): “The GSVD is applied on M̂ as M̂ = USV>, such that U is a d-by-d orthogonal matrix satisfying U>U = Id where Id is a d-by-d identity matrix, and V is a d-by-d matrix satisfying V>YY>V = Id (called generalized orthogonality).”
- Generalized Constrained Redundancy Analysis (2006, methodology): “A small positive value of λ is known to lead to estimates of model parameters associated with a smaller MSE, that is, on average closer to true parameter values (Takane and Hwang, 2006b).”
- Optimal selection of reduced rank estimators of high-dimensional matrices (2010, unknown): “1 is the GSVD of the least squares estimator B under the metric M = X'X, see Takane and Hwang (2007).”
- Cascaded Projection: End-To-End Network Compression and Acceleration (2019, methodology): “We obtain the transformation Φ(·) that projects each proxy matrix Xi to the closest location on the Grassmann manifold by performing Singular Value Decomposition (SVD) on Xi, such that Xi=UiΣiVTi , where Ui and VTi are orthogonal matrices and Σi is the matrix of singular values.”
- Regularized Generalized Structured Component Analysis (2009, background): “In particular, this tendency appears to be more prominent under small sample size and/or multi-collinearity ( Takane & Hwang, 2007 ).”
- Regularized Generalized Canonical Correlation Analysis (2011, methodology): “The special case 10 1τ≤ ≤ and 2 1τ = which corresponds to a regularized version of redundancy analysis has been studied by Takane and Hwang (2007) and by Bougeard, Hanafi and Qannari (2008) under the name “Continuum redundancy-PLS regression”.”