Abstract
This paper discusses the relationship between linear feedforward neural network classifiers (FNNC) and the reduced-rank approximation. From the viewpoint of linear algebra, it is shown that if the rank of the trained connection weight matrix of a two layered linear FNNC is greater than or equal to the rank of the between-class dispersion matrix of the input training samples, the two layered linear FNNC will be merged into a one layered linear FNNC. In addition, the condition of the null error cost function for a reduced rank approximation is also derived.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
