Abstract
The Principle of Homology Continuity (PHC) based covering learning method is an effective method to solve the pattern recognition problem. However, PHC and the existence of optimal coverage are not mathematical proven. To address this issue, we firstly give the mathematical description and theoretical proof of PHC. On this basis, the theoretical definition of optimal coverage is introduced. Optimal coverage can determine the internal connections among samples as prior knowledge and use covering neurons to learn prior knowledge. Finally, we propose a kind of covering neuron model, and the effectiveness of which is demonstrated through extensive experiments conducted on the CIFAR-10, LFW, and YTF datasets.
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 callMore From: ASP Transactions on Pattern Recognition and Intelligent Systems
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.
