Approximation of upper percentile points for the second largest latent root in principal component analysis
by Takakazu Sugiyama; Toru Ogura; Yuichi Takeda; Hiroki Hashiguchi
International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP), Vol. 4, No. 2, 2013

Abstract: The approximate distribution of the largest latent root was proposed by Sugiyama (1972b). We extend his idea and propose an approximate distribution of the upper percentile points for the second largest latent root of the Wishart matrix. The proposed approximate distribution is adjusted by the expectation of each latent root. The simulation results show the validity of our adjustment for the expectation of each latent root, and the proposed approximate distribution is effective also in various cases, even when the dimension and sample size are both large.

Online publication date: Sun, 08-Dec-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com