Comprehensive studies of Grassmann manifold optimization and sequential candidate set algorithm in a principal fitted component model

In this paper we compare parameter estimation by Grassmann manifold optimization and sequential candidate set algorithm in a structured principal fitted component (PFC) model. The structured PFC model extends the form of the covariance matrix of a random error to relieve the limits that occur due to...

Full description

Saved in:
Bibliographic Details
Published inCommunications for statistical applications and methods Vol. 29; no. 6; pp. 721 - 733
Main Authors Chaeyoung, Lee, Jae Keun, Yoo
Format Journal Article
LanguageKorean
Published 한국통계학회 30.11.2022
Subjects
Online AccessGet full text
ISSN2287-7843

Cover

More Information
Summary:In this paper we compare parameter estimation by Grassmann manifold optimization and sequential candidate set algorithm in a structured principal fitted component (PFC) model. The structured PFC model extends the form of the covariance matrix of a random error to relieve the limits that occur due to too simple form of the matrix. However, unlike other PFC models, structured PFC model does not have a closed form for parameter estimation in dimension reduction which signals the need of numerical computation. The numerical computation can be done through Grassmann manifold optimization and sequential candidate set algorithm. We conducted numerical studies to compare the two methods by computing the results of sequential dimension testing and trace correlation values where we can compare the performance in determining dimension and estimating the basis. We could conclude that Grassmann manifold optimization outperforms sequential candidate set algorithm in dimension determination, while sequential candidate set algorithm is better in basis estimation when conducting dimension reduction. We also applied the methods in real data which derived the same result.
Bibliography:The Korean Statistical Society
KISTI1.1003/JNL.JAKO202206543211248
ISSN:2287-7843