Abstract
SummaryWe introduce a conceptually simple, efficient and easily implemented approach for learning the block structure in a large matrix. Using the properties of U-statistics and large-dimensional random matrix theory, the group structure of many variables can be directly identified based on the eigenvalues and eigenvectors of the scaled sample matrix. We also establish the asymptotic properties of the proposed approach under mild conditions. The finite-sample performance of the approach is examined by extensive simulations and data examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.